Finite Clones Containing All Permutations

DOI10.4153/CJM-1994-054-1MaRDI QIDQ4313909zbMATH OpenFDO

Authors Lucien Haddad, Ivo G. Rosenberg

Publication date 30 January 1996

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1994-054-1

zbMATH Keywords

permutationsunary operationsfinitary operationsfinite clonesquasilinear operations

Mathematics Subject Classification ID

Relational systems, laws of composition (08A02) Structure theory of algebraic structures (08A05) Operations and polynomials in algebraic structures, primal algebras (08A40) Finitary algebras (08A62)

Recommendations

• Partial clones containing all permutations
• Clones closed with respect to permutation groups or transformation semigroups
• Maximal clones on uncountable sets that include all permutations
• CLONES CLOSED UNDER CONJUGATION I: CLONES WITH CONSTANTS
• The maximal clones on countable sets that include all permutations.

Cited in

(19)

• Unary polynomials in algebras. I
• scientific article; zbMATH DE number 3985299 (Why is no real title available?)
• Collapsing permutation groups.
• Collapsing monoids consisting of permutations and constants
• CLONES CLOSED UNDER CONJUGATION I: CLONES WITH CONSTANTS
• Partial clones containing all permutations
• The number of clone orderings
• C-clones and C-automorphism groups
• scientific article; zbMATH DE number 5037618 (Why is no real title available?)
• Clones determined by alternating monoids
• The minimal clones above the permutations
• The maximal clones on countable sets that include all permutations.
• scientific article; zbMATH DE number 1512756 (Why is no real title available?)
• scientific article; zbMATH DE number 2149940 (Why is no real title available?)
• scientific article; zbMATH DE number 3891359 (Why is no real title available?)
• Maximal clones in monoidal intervals. I
• scientific article; zbMATH DE number 3954990 (Why is no real title available?)
• Oligomorphic clones
• Constraint satisfaction problems for reducts of homogeneous graphs

This page was built for publication: Finite Clones Containing All Permutations

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