The lattice of quasiorder lattices of algebras on a finite set. (Q271695)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The lattice of quasiorder lattices of algebras on a finite set. |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The lattice of quasiorder lattices of algebras on a finite set. |
scientific article |
Statements
The lattice of quasiorder lattices of algebras on a finite set. (English)
0 references
7 April 2016
0 references
It is well known that quasiorders of an algebra \(A\) compatible with operations of \(A\) form an algebraic lattice \(L\). Since these quasiorders are completely determined by the unary polynomials of \(A\), one can restrict to unary operations and monounary algebras only. The aim of the paper is to investigate the lattice \(L\). The tool for this investigation are Galois connections. Since the building blocks of every lattice are completely meet- and join-irreducible elements, the authors determine these elements and atoms of \(L\). In particular, meet-irreducible elements of \(L\) are determined by the unary polynomials \(f\) of \(A\). Here are described all such elements for which \(f\) is a permutation or an acyclic mapping. It is proved that the lattice \(L\) is tolerance simple and it has none of the properties like being 0-modular, 1-modular, upper semi-modular or lower semi-modular.
0 references
quasiorder lattices
0 references
unary operations
0 references
monounary algebras
0 references
join-irreducible elements
0 references
meet-irreducible elements
0 references
tolerance simple lattices
0 references
unary polynomials
0 references
congruences
0 references
compatible partial orders
0 references