Scholarlink

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.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Finding Cycle Types in Permutation Groups with Few Generators

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Markus Lohrey,
  • Andreas Rosowski

摘要

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.