Finding cycle types in permutation groups with few generators
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929741402996736 |
|---|---|
| author | Lohrey, Markus Rosowski, Andreas |
| author_facet | Lohrey, Markus Rosowski, Andreas |
| contents | The problem whether a given permutation group contains a permutation with a given cycle type is studied. This problem is known to be NP-complete. In this paper it is shown that the problem can be solved in logspace for a cyclic permutation group and that it is NP-complete for a 2-generated abelian permutation group. In addition it is shown that it is NP-complete whether a 2-generated abelian permutation group contains a fixpoint-free permutation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_02864 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Finding cycle types in permutation groups with few generators Lohrey, Markus Rosowski, Andreas Group Theory The problem whether a given permutation group contains a permutation with a given cycle type is studied. This problem is known to be NP-complete. In this paper it is shown that the problem can be solved in logspace for a cyclic permutation group and that it is NP-complete for a 2-generated abelian permutation group. In addition it is shown that it is NP-complete whether a 2-generated abelian permutation group contains a fixpoint-free permutation. |
| title | Finding cycle types in permutation groups with few generators |
| topic | Group Theory |
| url | https://arxiv.org/abs/2503.02864 |