Clones with finitely many relative \({\mathcal R}\)-classes (Q535115): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / review text | |||
Equivalence of (finitary) operations with respect to clones generalizes Green's relation on transformation monoids. A previous paper of the authors [Discrete Math. 309, No. 4, 673--685 (2009; Zbl 1168.08003)] was dedicated to the case of so-called discriminator clones. The present effort concerns the question as to what clones admit only finitely many nonequivalent operations (property F). Since equivalent operations have the same range, only finite universes need to be considered. If \(E\) is a collection of equivalence relations on a finite set \(A\), then the clone of all operations on \(A\) that are compatible with each relation from \(E\) has property F if and only if \(E\) is a chain with respect to inclusion. Maximal clones are distinguished with regard to property F and it is determined when the intersection of two maximal clones having poperty F also has property F. | |||
Property / review text: Equivalence of (finitary) operations with respect to clones generalizes Green's relation on transformation monoids. A previous paper of the authors [Discrete Math. 309, No. 4, 673--685 (2009; Zbl 1168.08003)] was dedicated to the case of so-called discriminator clones. The present effort concerns the question as to what clones admit only finitely many nonequivalent operations (property F). Since equivalent operations have the same range, only finite universes need to be considered. If \(E\) is a collection of equivalence relations on a finite set \(A\), then the clone of all operations on \(A\) that are compatible with each relation from \(E\) has property F if and only if \(E\) is a chain with respect to inclusion. Maximal clones are distinguished with regard to property F and it is determined when the intersection of two maximal clones having poperty F also has property F. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Manfred Armbrust / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 08A40 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5886753 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Green's relation | |||
Property / zbMATH Keywords: Green's relation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
clone lattice | |||
Property / zbMATH Keywords: clone lattice / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
maximal clone | |||
Property / zbMATH Keywords: maximal clone / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3122019236 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 0905.1611 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5525349 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a quasi-ordering on Boolean functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equational characterizations of Boolean function classes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The forbidden projections of unate functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Closed systems of functions and predicates / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lattice Theoretic Properties of Frontal Switching Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Classification of Boolean Functions by the General Linear and Affine Groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4085783 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Function Algebras on Finite Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Descending chains and antichains of the unary, linear, and monotone subfunction relations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equivalence of operations with respect to discriminator clones / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Galois theory for minors of finite functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3322162 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Boolean minors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The threshold order of a Boolean function / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 01:36, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Clones with finitely many relative \({\mathcal R}\)-classes |
scientific article |
Statements
Clones with finitely many relative \({\mathcal R}\)-classes (English)
0 references
11 May 2011
0 references
Equivalence of (finitary) operations with respect to clones generalizes Green's relation on transformation monoids. A previous paper of the authors [Discrete Math. 309, No. 4, 673--685 (2009; Zbl 1168.08003)] was dedicated to the case of so-called discriminator clones. The present effort concerns the question as to what clones admit only finitely many nonequivalent operations (property F). Since equivalent operations have the same range, only finite universes need to be considered. If \(E\) is a collection of equivalence relations on a finite set \(A\), then the clone of all operations on \(A\) that are compatible with each relation from \(E\) has property F if and only if \(E\) is a chain with respect to inclusion. Maximal clones are distinguished with regard to property F and it is determined when the intersection of two maximal clones having poperty F also has property F.
0 references
Green's relation
0 references
clone lattice
0 references
maximal clone
0 references
0 references