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

DOI10.1142/S0218196718500443MaRDI QIDQ4687481zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

congruence permutable varietyequation solvabilityidentity checkingMal'cev termsupernilpotency

Mathematics Subject Classification ID

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

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

Cites work

• Equivalence and equation solvability problems for the alternating group A₄.
• scientific article; zbMATH DE number 4035895 (Why is no real title available?)
• On finite Taylor algebras
• Some applications of higher commutators in Mal'cev algebras
• THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS
• The complexity of solving equations over finite groups
• The complexity of the equation solvability problem over nilpotent groups
• The complexity of the equation solvability problem over semipattern groups
• The complexity of the equivalence and equation solvability problems over meta-abelian groups
• The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
• The complexity of the equivalence problem for nonsolvable groups
• The complexity of the equivalence problem over finite rings.
• The equivalence problem for finite rings
• THE EQUIVALENCE PROBLEM OVER FINITE RINGS
• The extended equivalence and equation solvability problems for groups

Cited in

(10)

• Supernilpotence need not imply nilpotence
• Complexity and Unsolvability Properties of Nilpotency
• Expressive power, satisfiability and equivalence of circuits over nilpotent algebras
• Even Faster Algorithms for CSAT Over supernilpotent Algebras.
• Solving systems of equations in supernilpotent algebras
• CC-circuits and the expressive power of nilpotent algebras
• Supernilpotent Taylor algebras are nilpotent
• SOLVABILITY OF SYSTEMS OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
• Solving promise equations over monoids and groups
• Solving promise equations over monoids and groups

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)