Abstract
An equation over a finite group G is an expression of form w 1 w 2...w k = 1g, where each w i is a variable, an inverted variable, or a constant from G; such an equation is satisfiable if there is a setting of the variables to values in G so that the equality is realized. We study the problem of simultaneously satisfying a family of equations over a finite group G and show that it is NP-hard to approximate the number of simultaneously satisfiable equations to within |G| − ∈ for any ∈ > 0. This generalizes results of Håstad, who established similar bounds under the added condition that the group G is Abelian.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Márió Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501–555, May 1998.
Sanjeev Arora and Shmuel Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70–122, January 1998.
David Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, and Denis Thérien. Equation satisfiability and program satisfiability for finite monoids. In Proceedings of the 25th Annual Symposium on Mathematical Foundations of Computer Science, 2000.
David A. Mix Barrington, Howard Straubing, Denis Thérien. Non-uniform automata over groups. Information and Computation, 89(2): 109–132, 1990
François Bédard and Alain Goupil. The poset of conjugacy classes and decomposition of products in the symmetric group. Canad. Math. Bull., 35(2):152–160, 1992.
Harry Dym and Henry P. McKean. Fourier Series and Integrals, volume 14 of Probability and Mathematical Statistics. Academic Press, 1972.
Uriel Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4):634–652, July 1998.
Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, and Márió Szegedy. Interactive proofs and the hardness of approximating cliques. Journal of the ACM, 43(2):268–292, March 1996.
Harold Finkelstein and K. I. Mandelberg. On solutions of “equations in symmetric groups”. Jornal of Combinatorial Theory, Series A, 25(2):142–152, 1978.
Mikael Goldmann and Alexander Russell. The computational complexity of solving systems of equations over finite groups. In Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity, Atlanta, GA, May 1999.
Johan Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798–859, July 2001.
Christos H. Papadimitriou and Mihalis Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43(3):425–440, December 1991.
Ran Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763–803, June 1998.
Jean-Pierre Serre. Linear Representations of Finite Groups, volume 42 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1977.
Arnold Schönhage and Volker Strassen. Schnelle Multiplikation großer Zahlen. Computing, 7:281–292, 1971.
Richard P. Stanley. Enumerative Combinatorics, Volume 2, volume 62 of Cambridge Studies in Advances Mathematics. Cambridge University Press, 1999.
Sergej P. Strunkov. On the theory of equations on finite groups. Izvestija Rossijskoj Akademii Nauk, Serija Matematičeskaja, 59(6):171–180, 1995.
Audrey Terras. Fourier Analysis on Finite Groups and Applications, volume 43 of London Mathematical Society student texts. Cambridge University Press, Cambridge, 1999.
Uri Zwick. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 201–210, San Francisco, California, 25–27 January 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Engebretsen, L., Holmerin, J., Russell, A. (2002). Inapproximability Results for Equations over Finite Groups. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_8
Download citation
DOI: https://doi.org/10.1007/3-540-45465-9_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43864-9
Online ISBN: 978-3-540-45465-6
eBook Packages: Springer Book Archive