LIPIcs.MFCS.2019.72.pdf
- Filesize: 0.54 MB
- 9 pages
Document
Solving Systems of Equations in Supernilpotent Algebras
Author
Erhard Aichinger 
-
Part of:
Volume:
44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Mathematical Foundations of Computer Science (MFCS) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2019-08-20
File
Document Identifiers
Author Details
Acknowledgements
The author thanks G. Horváth and M. Kompatscher for dicussions on solving equations over nilpotent algebras. Several of these discussions took place during a workshop organized by P. Aglianò at the University of Siena in June 2018. The author also thanks A. Földvári, C. Szabó, M. Kompatscher, and S. Kreinecker for their comments on preliminary versions of the manuscript, and the anonymous referees for several useful suggestions.
Cite AsGet BibTex
Erhard Aichinger. Solving Systems of Equations in Supernilpotent Algebras. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 72:1-72:9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.MFCS.2019.72
https://doi.org/10.4230/LIPIcs.MFCS.2019.72
Abstract
Recently, M. Kompatscher proved that for each finite supernilpotent algebra A in a congruence modular variety, there is a polynomial time algorithm to solve polynomial equations over this algebra. Let mu be the maximal arity of the fundamental operations of A, and let d := |A|^{log_2 mu + log_2 |A| + 1}. Applying a method that G. Károlyi and C. Szabó had used to solve equations over finite nilpotent rings, we show that for A, there is c in N such that a solution of every system of s equations in n variables can be found by testing at most c n^{sd} (instead of all |A|^n possible) assignments to the variables. This also yields new information on some circuit satisfiability problems.
Subject Classification
ACM Subject Classification
- Mathematics of computing → Combinatorial algorithms
- Theory of computation → Complexity classes
Keywords
- Supernilpotent algebras
- polynomial equations
- polynomial mappings
- circuit satisfiability
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads