The structure of polynomial operations associated with smooth digraphs.
DOI10.1007/s00012-014-0309-9zbMath1308.08002OpenAlexW1967250856MaRDI QIDQ485112
László Zádori, Gergő Gyenizse, Miklós Maróti
Publication date: 9 January 2015
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: http://publicatio.bibl.u-szeged.hu/15001/1/publ28.pdf
Applications of universal algebra in computer science (08A70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Operations and polynomials in algebraic structures, primal algebras (08A40) Congruence modularity, congruence distributivity (08B10) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Reflexive digraphs with near unanimity polymorphisms
- A strong Mal'cev condition for locally finite varieties omitting the unary type
- Maltsev digraphs have a majority polymorphism
- Optimal strong Mal'cev conditions for omitting type 1 in locally finite varieties.
- Finite posets and topological spaces in locally finite varieties
- Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
- The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
- The structure of finite algebras
- An Easy Way to Minimal Algebras
- Finitely Related Algebras In Congruence Distributive Varieties Have Near Unanimity Terms
This page was built for publication: The structure of polynomial operations associated with smooth digraphs.
