Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.02864 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of 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.