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=\angle{S}\le S_n\) and a parameter k, find a permutation π ∈ G such that |{i ∈ [n]|π(i) ≠ i}| ≥ k. This generalizes the NP-complete problem of finding a fixed-point free permutation in G [7,14] (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 [8,7].
-
2
A base for G is a subset B ⊆ [n] such that the subgroup of G that fixes B pointwise is trivial. We consider the parameterized complexity of checking if a given permutation group \(G=\angle{S}\le S_n\) has a base of size k, where k is the parameter for the problem. This problem is known to be NP-complete [4]. We show that it is fixed-parameter tractable for 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Babai, L.: Monte-Carlo algorithms in graph isomorphism testing. Technical Report 79–10, Universit de Montral (1979)
Babai, L., Kantor, W.M., Luks, E.M.: Computational complexity and the classification of finite simple groups. In: Proc. 24th IEEE Symposium on Foundations of Computer Science, pp. 162–171 (1983)
Babai, L., Luks, E.M.: Canonical labeling of graphs. In: 15th Annual ACM Symposium on Theory of Computing, pp. 171–183 (1983)
Blaha, K.D.: Minimal bases for permutation groups: the greedy approximation algorithm. Journal of Algorithms 13, 297–306 (1992)
Cameron, P.J.: Permutation Groups. London Mathematical Society, Student Texts 45. Cambridge Univ. Press, Cambridge (1999)
Cameron, P.J., Cohen, A.M.: On the number of fixed point free elements of a permutation group. Discrete Mathematics 106/107, 135–138 (1992)
Cameron, P.J., Wu, T.: The complexity of the weight problem for permutation and matrix groups. Discrete Mathematics 310, 408–416 (2010)
Cameron, P.J.: Lectures on derangements. In: Pretty Structures Conference in Paris (2011), http://www.lix.polytechnique.fr/Labo/Leo.Liberti/pretty-structures/pdf/pcameron-ps11.pdf
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)
Erdös, P., Selfridge, J.L.: On a combinatorial game. Journal of Combinatorial Theory, Series A 14(3), 298–301 (1973)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)
Furst, M., Hopcroft, J.E., Luks, E.M.: Polynomial-time algorithms for permutation groups. Technical report, Cornell University, 10 (1980)
Jordan, C.: Recherches sur les substitutions. J. Math. Pures Appl. (Liouille) 17, 351–387 (1872)
Lubiw, A.: Some NP-Complete Problems Similar to Graph Isomorphism. SIAM J. Comput. 10(1), 11–21 (1981)
Luks, E.M.: Permutation groups and polynomial-time computation. In: Finkelstein, L., Kantor, W.M. (eds.) Groups and Computation. DIMACS series, vol. 11, pp. 139–175. AMS (1993)
Raghavan, P.: Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences 37(2), 130–143 (1988)
Seress, A.: Permutation Group Algorithms. Cambridge University Press (2003)
Serre, J.P.: On a theorem of Jordan. Bull. Amer. Math. Soc. 40, 429–440 (2003)
Sims, C.C.: Computational methods in the study of permutation groups. In: Leech, J. (ed.) Proc. Conf. on Computational Problems in Abstract Algebra, pp. 169–183. Pergamon Press, Oxford (1967, 1970)
Sims, C.C.: Some group theoretic algorithms. In: Newman, M.F., Richardson, J.S. (eds.) Topics in Algebra. Lecture Notes in Mathematics, vol. 697, pp. 108–124. Springer, Heidelberg (1978)
Zemlyachenko, V.N., Kornienko, N.M., Tyshkevich, R.I.: Graph isomorphism problem. Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta 118, 83–158 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Arvind, V. (2013). The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups. In: Gutin, G., Szeider, S. (eds) Parameterized and Exact Computation. IPEC 2013. Lecture Notes in Computer Science, vol 8246. Springer, Cham. https://doi.org/10.1007/978-3-319-03898-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-03898-8_2
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03897-1
Online ISBN: 978-3-319-03898-8
eBook Packages: Computer ScienceComputer Science (R0)