We conjecture that every finite group G has a short presentation in terms of . generators and relations in the sense that the total length of the relations is ลฝ < <. Oลฝ1. log G .
Plat presentations for link groups
โ Scribed by Joan S. Birman
- Publisher
- John Wiley and Sons
- Year
- 1973
- Tongue
- English
- Weight
- 236 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0010-3640
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We give a presentation of length log 2 G for the groups G โผ = PSU 3 q . This result has applications in recent algorithms to compute the structure of permutation groups and matrix groups.
For a ring R with identity, define Unip R to be the group of upper-triangular n matrices over R all of whose diagonal entries are 1. For i s 1, 2, . . . , n y 1, let S i denote the matrix whose only nonzero off-diagonal entry is a 1 in the ith row and ลฝ . ลฝ . i q 1 st column. Then for any integer m
The participants of Presentation Group 18 of Genetic Analysis Workshop 14 analyzed the Collaborative Study on the Genetics of Alcoholism data set to investigate sex-specific effects for phenotypes related to alcohol dependence. In particular, the participants looked at imprinting (which is also know
## Abstract Given an increased emphasis on work teams in organizations, it is important to select applicants based on their ability to make contributions to a given work team. This paper proposes that personโgroup fit should be useful to select applicants for work teams and suggests that effective