A finite subset A of a group is a near subgroup if the number of ordered pairs (x, y) e A 2 with xy ~ A is at most I A [. We show here that if I A I >/5, then A is a near subgroup if and only if A w {g} is a subgroup for some group element g. We also classify the counterexamples if LAI~< 4.
On near subgroups
โ Scribed by I. Krasikov; J. Schonheim
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 206 KB
- Volume
- 124
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
If, for every member a of a subset A of elements of an abelian group G, there is an automorphism 8, of G such that A + a = B,(A), then A is called a near-subgroup of G. If OE A and the order of G is odd, then A is a subgroup of G; otherwise A is not necessarily a coset. However, we show that for a cyclic group of a squarefree order any near-subgroup is a coset. A graph-theoretical motivation is emphasized.
๐ SIMILAR VOLUMES
In this paper we classify which simple groups contain proper nontrivial seminormal subgroups. We also develop a Suchr-Zassenhauz like theorem for seminormal subgroups. 1994 Academic Press, Inc.
We generalize and present simplified proofs almost all elementary lemmas from Section 8 of the Odd Order Paper. In many places we use Hall's enumeration principle and other simple combinatorial arguments. A number of related results are proved as well. Some open questions are posed. แฎ 1998 Academic