Abstract
A finite permutation group is cycle-closed if it contains all the cycles of all of its elements. It is shown by elementary means that the cycle-closed groups are precisely the direct products of symmetric groups and cyclic groups of prime order. Moreover, from any group, a cycle-closed group is reached in at most three steps, a step consisting of adding all cycles of all group elements. For infinite groups, there are several possible generalisations. Some analogues of the finite result are proved.
| Original language | English |
|---|---|
| Pages (from-to) | 315-322 |
| Number of pages | 8 |
| Journal | Journal of Algebraic Combinatorics |
| Volume | 5 |
| Issue number | 4 |
| Publication status | Published - 1 Dec 1996 |
Keywords
- Cycle
- Fourier series
- Hopf algebra
- Permutation group
Fingerprint
Dive into the research topics of 'Cycle-closed permutation groups'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver