A POLYNOMIAL ALGORITHM FOR TESTING CONGRUENCE MODULARITY

DOI10.1142/S0218196796000210MaRDI QIDQ3837506zbMATH OpenFDO

Authors Christian Herrmann, Marcel Wild

Publication date 11 March 1997

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

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

zbMATH Keywords

closure systemcongruence latticecongruence modularityfinite algebrajoin irreduciblesmodular latticepolynomial algorithmsize of an algebra

Mathematics Subject Classification ID

Galois correspondences, closure operators (in relation to ordered sets) (06A15) Modular lattices, Desarguesian lattices (06C05) Congruence modularity, congruence distributivity (08B10)

Recommendations

• On congruence distributivity and modularity
• A polynomial characterization of congruence classes
• ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS
• Computational complexity of some problems involving congruences on algebras
• On the Computational Complexity of Algebra on Lattices

Cited in

(10)

• Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra
• A polynomial characterization of congruence classes
• A compact representation for modular semilattices and its applications
• Algorithm for studying polynomial maps and reductions modulo prime number
• Learning read-constant polynomials of constant degree modulo composites
• Learning Read-Constant Polynomials of Constant Degree Modulo Composites
• Congruence testing for odd subgroups of the modular group
• Computations with finite closure systems and implications
• On implicational bases of closure systems with unique critical sets.
• On congruence distributivity and modularity

This page was built for publication: A POLYNOMIAL ALGORITHM FOR TESTING CONGRUENCE MODULARITY

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