Groups covered by finitely many cosets or subgroups (Q3754177)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3991772
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Groups covered by finitely many cosets or subgroups |
scientific article; zbMATH DE number 3991772 |
Statements
Groups covered by finitely many cosets or subgroups (English)
0 references
1987
0 references
covered by a family of cosets or subgroups
0 references
set union
0 references
irredundant coverings
0 references
maximum index
0 references
lower and upper bounds
0 references
index of the centre
0 references
0 references
0.7135733
0 references
0.7081828
0 references
0.6989295
0 references
0.6969891
0 references
0 references
0 references
0.6864901
0 references
Let the (carrier of the) group \({\mathcal G}\) be the set union of a finite number, say n, of cosets of subgroups of \({\mathcal G}\), and assume the covering to be irredundant. Let \({\mathcal D}\) be the intersection of the subgroups involved in this, and denote by \(f_ 1(n)\) the maximum of the index \(| {\mathcal G}:{\mathcal D}|\) taken over all irredundant coverings of all groups by n cosets; let \(f_ 2(n)\) be the maximum when all the cosets are assumed to be (the carriers of) subgroups, and let \(f_ 3(n)\) be the maximum index of the centre of \({\mathcal G}\) in \({\mathcal G}\) when the subgroups are, moreover, assumed to be abelian. These maxima are all known to exist and to be finite: the reviewer [J. Lond. Math. Soc. 29, 236-248 (1954; Zbl 0055.01604); Publ. Math., Debrecen 3, 227-242 (1954; Zbl 0057.25603)] had proved this and given very crude upper bounds. The author shows that \(f_ 1(n)=n!\), that \(f_ 3(n)<f_ 2(n)<f_ 1(n)\), and he establishes very much improved lower and upper bounds for \(f_ 2(n)\) and \(f_ 3(n)\). He suggests that the lower bounds, which are exponential in n for \(f_ 2\) and polynomial, indeed quadratic, in n for \(f_ 3\), but too complicated to state here, are the true values. In the final section it is shown that if \({\mathcal G}\) has n, but no more than n pairwise non- commuting elements, then the index of the centre of \({\mathcal G}\) in \({\mathcal G}\) is bounded above by \(f_ 2(n)\); the existence of a finite bound had been established by the reviewer [J. Aust. Math. Soc., Ser. A 21, 467-472 (1976; Zbl 0333.05110)], who had conjectured a bound that James Wiegold had promptly demolished (unpublished). The author uses this Wiegold result to state also a lower, exponential, bound for the index. His proofs are ingenious and beautifully simple, and the paper is very clearly written.
0 references