Abstract
We study the parameterized complexity of computing nontrivial automorphisms of weight k for a given hypergraph \(X=(V,E)\), with k as fixed parameter, where the weight of a permutation \(\pi \in S_n\) is the number of points moved by \(\pi\). Building on the earlier work of Schweitzer (in: Proceedings of 19th ESA, Springer, Berlin, 2011. https://doi.org/10.1007/978-3-642-23719-5_32), we show the following results: (1) Computing nontrivial automorphisms of weight at most k for d-hypergraphs (that is, with edge-size bounded by d) remains fixed parameter tractable, with d treated as a second fixed parameter. Likewise, finding isomorphisms of weight k between d-hypergraphs X and Y (both defined on vertex set [n]) remains fixed parameter tractable. (2) For dealing with the exact weight k version of the problem, we introduce a more general algorithmic problem PermCode: given a permutation group G by a generating set and a fixed parameter k, is there is a nontrivial element of G with support at most (or exactly) k? We give a method for shrinking large orbits of the given group G to obtain subgroups while maintaining existence of weight at most k elements in it. An application of this yields an FPT algorithm for finding exact weight k nontrivial automorphisms in d-hypergraphs, d as second fixed parameter. (3) For hypergraphs with edges of unbounded size, we show that the problem is in \(\textsf {FPT } ^{\textsc {GI}}\). (4) Computing d-hypergraph isomorphisms of weight exactly k is fixed parameter tractable. This requires a more complicated orbit shrinking technique.
Similar content being viewed by others
References
Arvind, V., Köbler, J., Kuhnert, S., Torán, J.: Parameterized complexity of small weight automorphisms. In: Proceedings of 34th STACS, Dagstuhl, pp. 7:1–7:13 (2017). Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2017.7
Arvind, V., Köbler, J., Kuhnert, S., Torán, J.: Finding small weight isomorphisms with additional constraints is fixed parameter tractable. In: Proceedings of 12 IPEC Symposium, pp. 2:1–2:13. LIPIcs 89 (2017)
Vardy, A.: The intractability of computing the minimum distance of a code. IEEE Trans. Inf. Theory 43(6), 1757–1766 (1997). https://doi.org/10.1109/18.641542
Dumer, I., Micciancio, D., Sudan, M.: Hardness of approximating the minimum distance of a linear code. IEEE Trans. Inf. Theory 49(1), 22–37 (2003). https://doi.org/10.1109/TIT.2002.806118
Downey, R.G., Fellows, M.R., Vardy, A., Whittle, G.: The parametrized complexity of some fundamental problems in coding theory. SIAM J. Comput. 29(2), 545–570 (1999). https://doi.org/10.1137/S0097539797323571
Arvind, V., Köbler, J., Kuhnert, S., Torán, J.: Solving linear equations parameterized by Hamming weight. Algorithmica 75(2), 322–338 (2016). https://doi.org/10.1007/s00453-015-0098-3
Bhattacharyya, A., Ghoshal, S., Karthik, C.S., Manurangsi, P.: Parameterized intractability of even set and shortest vector problem from gap-ETH. In: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) Leibniz International Proceedings in Informatics (LIPIcs), vol. 107, pp. 17:1–17:15 (2018)
Bhattacharyya, A., Bonnet, E., Egri, L., Ghoshal, S., Karthik, C.S., Lin, B., Manurangsi, P., Marx, D.: Parameterized intractability of even set and shortest vector problem. J. ACM 68(3), 1–40 (2021)
Schweitzer, P.: Isomorphism of (mis)labeled graphs. In: Proceedings of 19th ESA, pp. 370–381. Springer, Berlin (2011). https://doi.org/10.1007/978-3-642-23719-5_32
Dixon, J.D., Mortimer, B.: Permutation Groups. Springer, Berlin (1996)
Deza, M., Huang, T.: Metrics on permutations, a survey. J. Combin. Inform. Syst. Sci. 23, 173–185 (1998)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006). https://doi.org/10.1007/3-540-29953-X
Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42, 844–856 (1995). https://doi.org/10.1145/210332.210337
Fredman, M.L., Komlós, J., Szemerédi, E.: Storing a sparse table with \(O(1)\) worst case access time. J. ACM 31(3), 538–544 (1984). https://doi.org/10.1145/828.1884
Mathon, R.: A note on the Graph Isomorphism counting problem. Inf. Process. Lett. 8(3), 131–132 (1979)
Köbler, J., Schöning, U., Torán, J.: The Graph Isomorphism Problem: Its Structural Complexity. Progress in Theoretical Computer Science. Birkhäuser/Springer, Berlin (1993)
Sims, C.C.: Computational methods in the study of permutation groups. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 169–183. Pergamon Press, Oxford (1970)
Acknowledgements
We are grateful to the anonymous referees for their insightful comments and suggestions. We also thank the referees of the previous conference papers [1, 2] for their valuable comments that helped improve the presentation. This work was supported by the Alexander von Humboldt Foundation in its research group linkage program. The second and third authors are supported by DFG Grant KO 1053/7-2. The fourth author is supported by DFG Grant TO 200/3-2.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Arvind, V., Köbler, J., Kuhnert, S. et al. Parameterized Complexity of Small Weight Automorphisms and Isomorphisms. Algorithmica 83, 3567–3601 (2021). https://doi.org/10.1007/s00453-021-00867-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-021-00867-y