Clones with finitely many relative \({\mathcal R}\)-classes (Q535115): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
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

Revision as of 08:50, 1 July 2023

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
    0 references
    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

    Identifiers