A POLYNOMIAL ALGORITHM FOR TESTING CONGRUENCE MODULARITY

DOI10.1142/S0218196796000210zbMATH Open0857.08006MaRDI QIDQ3837506FDOQ3837506

Christian Herrmann, Marcel Wild

Publication date: 11 March 1997

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

zbMATH Keywords

closure systempolynomial algorithmcongruence latticefinite algebramodular latticecongruence modularityjoin irreduciblessize of an algebra

Mathematics Subject Classification ID

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

Cited In (7)

• Algorithm for studying polynomial maps and reductions modulo prime number
• Computations with finite closure systems and implications
• A compact representation for modular semilattices and its applications
• Learning read-constant polynomials of constant degree modulo composites
• Congruence testing for odd subgroups of the modular group
• Learning Read-Constant Polynomials of Constant Degree Modulo Composites
• On implicational bases of closure systems with unique critical sets.

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)