The equation solvability problem over supernilpotent algebras with Mal’cev term

DOI10.1142/S0218196718500443zbMATH Open1454.08001OpenAlexW2808961372MaRDI QIDQ4687481FDOQ4687481

Authors: Michael Kompatscher 

Publication date: 12 October 2018

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196718500443

Recommendations

• SOLVABILITY OF SYSTEMS OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
• Solving systems of equations in supernilpotent algebras
• The complexity of the equation solvability problem over semipattern groups
• The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
• The extended equivalence and equation solvability problems for groups
• The complexity of the equivalence problem for nonsolvable groups
• Expressive power, satisfiability and equivalence of circuits over nilpotent algebras
• The complexity of the equation solvability problem over nilpotent groups
• Evaluation of polynomials over finite rings via additive combinatorics
• Notes on extended equation solvability and identity checking for groups

zbMATH Keywords

Mal'cev termcongruence permutable varietyidentity checkingequation solvabilitysupernilpotency

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Congruence modularity, congruence distributivity (08B10) Operations and polynomials in algebraic structures, primal algebras (08A40) Applications of universal algebra in computer science (08A70) Word problems (aspects of algebraic structures) (08A50)

Cites Work

• The complexity of solving equations over finite groups
• Equivalence and equation solvability problems for the alternating group \(\mathbf A_4\).
• The equivalence problem for finite rings
• THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS
• Title not available (Why is that?)
• The extended equivalence and equation solvability problems for groups
• The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
• Some applications of higher commutators in Mal'cev algebras
• The complexity of the equivalence problem for nonsolvable groups
• THE EQUIVALENCE PROBLEM OVER FINITE RINGS
• The complexity of the equivalence problem over finite rings.
• The complexity of the equation solvability problem over semipattern groups
• The complexity of the equation solvability problem over nilpotent groups
• The complexity of the equivalence and equation solvability problems over meta-abelian groups
• On finite Taylor algebras

Cited In (8)

• Supernilpotence need not imply nilpotence
• Expressive power, satisfiability and equivalence of circuits over nilpotent algebras
• Title not available (Why is that?)
• SOLVABILITY OF SYSTEMS OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
• Complexity and Unsolvability Properties of Nilpotency
• Title not available (Why is that?)
• Even Faster Algorithms for CSAT Over supernilpotent Algebras.
• Supernilpotent Taylor algebras are nilpotent

This page was built for publication: The equation solvability problem over supernilpotent algebras with Mal’cev term

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