Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra

DOI10.1016/0304-3975(85)90042-8zbMATH Open0568.08002OpenAlexW1999391918MaRDI QIDQ1060232FDOQ1060232

Authors Jiri Demel, Marie Demlová, Václav Koubek

Publication date 1985

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(85)90042-8

zbMATH Keywords

algorithmsidealsfinite algebrasimplesubdirectly irreduciblesubalgebrasminimal nontrivial congruences

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Subalgebras, congruence relations (08A30) Software, source code, etc. for problems pertaining to general algebraic systems (08-04)

Recommendations

• Computing congruences efficiently
• Computational complexity of some problems involving congruences on algebras
• Computing the structure of finite algebras
• Computing generating sets of minimal size in finite algebras
• A POLYNOMIAL ALGORITHM FOR TESTING CONGRUENCE MODULARITY

Cites work

• scientific article; zbMATH DE number 3819799 (Why is no real title available?)
• scientific article; zbMATH DE number 3664354 (Why is no real title available?)
• scientific article; zbMATH DE number 3757710 (Why is no real title available?)
• scientific article; zbMATH DE number 3763999 (Why is no real title available?)
• scientific article; zbMATH DE number 3290336 (Why is no real title available?)
• Depth-First Search and Linear Graph Algorithms
• Group-theoretic algorithms and graph isomorphism
• On the computational power of pushdown automata
• Subdirect unions in universal algebra

Cited in

(15)

• Computing congruences efficiently
• On the disjunctive set problem
• Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes
• Effective subdirect decomposition: A case study
• Computational complexity of some problems involving congruences on algebras
• scientific article; zbMATH DE number 3880117 (Why is no real title available?)
• Refined F5 Algorithms for Ideals of Minors of Square Matrices
• Subquandles of affine quandles
• Congruence lattices of algebras— the signed labelling
• COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES
• An algebraic theory of functional and multivalued dependencies in relational databases
• Computing generating sets of minimal size in finite algebras
• Algorithm to compute abelian subalgebras and ideals in Malcev algebras
• scientific article; zbMATH DE number 3757710 (Why is no real title available?)
• scientific article; zbMATH DE number 3763999 (Why is no real title available?)

This page was built for publication: Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra

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