The parameterized complexity of fixpoint free elements and bases in permutation groups

DOI10.1007/978-3-319-03898-8_2zbMATH Open1407.68200arXiv1301.0379OpenAlexW54441500MaRDI QIDQ2867068FDOQ2867068

Authors: Vikraman Arvind 

Publication date: 10 December 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Abstract: In this paper we study the parameterized complexity of two well-known permutation group problems which are NP-complete. 1. Given a permutation group G=, subgroup of $S_n$, and a parameter $k$, find a permutation $pi$ in G such that $|iin[n]midpi(i)ei|$ is at least $k$. This generalizes the well-known NP-complete problem of finding a fixed-point free permutation in G. (this is the case when $k=n$). We show that this problem with parameter $k$ is fixed parameter tractable. In the process, we give a simple deterministic polynomial-time algorithm for finding a fixed point free element in a transitive permutation group, answering an open question of Cameron. 2. Next we consider the problem of computing a base for a permutation group G=. A base for G is a subset B of $[n]$ such that the subgroup of G that fixes B pointwise is trivial. This problem is known to be NP-complete. We show that it is fixed parameter tractable for the case of cyclic permutation groups and for permutation groups of constant orbit size. For more general classes of permutation groups we do not know whether the problem is in FPT or is W[1]-hard.

Full work available at URL: https://arxiv.org/abs/1301.0379

Recommendations

• Finding fixed point free elements and small bases in permutation groups
• scientific article; zbMATH DE number 4165152
• Minimum bases for permutation groups: The greedy approximation
• Finding a cycle base of a permutation group in polynomial time
• Bases for primitive permutation groups and a conjecture of Babai

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Subgroups of symmetric groups (20B35)

Cited In (5)

• Title not available (Why is that?)
• Derangements in wreath products of permutation groups
• Permutation complexity of the fixed points of some uniform binary morphisms
• Finding fixed point free elements and small bases in permutation groups
• The parameterized complexity of fixing number and vertex individualization in graphs

This page was built for publication: The parameterized complexity of fixpoint free elements and bases in permutation groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867068)