Balanced subgroups of totally projective groups
β Scribed by Paul Hill
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 190 KB
- Volume
- 88
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A hypergraph is totally balanced if every non-trivial cycle has an edge containing at least three vertices of the cycle. Totally balanced hypergraphs are characterized here as special tree-hypergraphs. This approach provides a conceptually simpler proof of Anstee's related result and yields the stru
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.