Maximal TC-clones, graphs and relations

DOI10.1016/0012-365X(92)00523-TMaRDI QIDQ1331966zbMATH OpenOpenAlexFDO

Authors Simone Hazan, Ivo G. Rosenberg

Publication date 9 January 1995

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(92)00523-t

zbMATH Keywords

\(n\)-ary operationsclonecomponentsprojections

Mathematics Subject Classification ID

Graph theory (05C99) Relational systems, laws of composition (08A02)

Review text

If \(A\) is a nonempty set, a set of operations on \(A\) that is closed relatively to composition and contains all the projections is called a clone on \(A\). A clone \(C\) is said to be a TC-clone (Term Condition clone) if all \(n\)-ary operations \(f\) in \(C\) are TC, i.e., for every \(i \in \{0, \dots, n - 1\}\) and \[ x,y,a_ 0, \dots, a_{i - 1}, a_{i + 1}, \dots, a_{n - 1}, b_ 0, \dots, b_{i - 1}, b_{i + 1}, \dots, b_{n - 1} \in A, \] \[ f(a_ 0, \dots, a_{i - 1}, x, a_{i + 1}, \dots, a_{n - 1}) = f(b_ 0, \dots, b_{i - 1}, x, b_{i + 1}, \dots, b_{n - 1}) \] implies \[ f(a_ 0, \dots, a_{i - 1}, y, a_{i + 1}, \dots, a_{n - 1}) = f(b_ 0, \dots, b_{i - 1}, y, b_{i + 1}, \dots, b_{n - 1}). \] \textit{J. Berman} and \textit{R. McKenzie} [Discrete Math. 52, 7-29 (1984; Zbl 0547.08003)] characterized TC-clones on \(A\) in terms of a quaternary relation on \(A\) verifying three conditions. In this paper the authors characterize maximal TC-clones on \(A\) in terms of graphs whose components satisfy some properties defined in the paper, thus extending the Berman-McKenzie results.

Recommendations

• scientific article; zbMATH DE number 3972931
• scientific article; zbMATH DE number 2211839
• Clausal relations and {C}-clones
• Clones satisfying the term condition
• Unique inclusions of maximal C-clones in maximal clones
• scientific article; zbMATH DE number 3902623
• Relative completeness with respect to two unary functions
• The clone of operations preserving a cycle with loops
• scientific article; zbMATH DE number 4087735
• Counting the maximal partial clones on a finite set

Cites work

• Clones satisfying the term condition

Cited in

(5)

• scientific article; zbMATH DE number 3902623 (Why is no real title available?)
• scientific article; zbMATH DE number 3972931 (Why is no real title available?)
• scientific article; zbMATH DE number 2211839 (Why is no real title available?)
• Clones satisfying the term condition
• TC operations and Latin bricks

This page was built for publication: Maximal TC-clones, graphs and relations

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