TC operations and Latin bricks

DOI10.1016/0166-218X(92)90282-FMaRDI QIDQ909688zbMATH OpenFDO

Authors Simone Hazan

Publication date 1989

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(92)90282-F

zbMATH Keywords

Latin brickterm condition

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Operations and polynomials in algebraic structures, primal algebras (08A40)

Review text

The term condition for an operation generalizes a cancellation property of linear functions on a module. Operations satisfying the term condition are called TC operations. In this paper the notion of a Latin brick is introduced and it is shown that counting TC operations on a certain set A is equivalent to counting TC Latin bricks defined on some sets depending on A. In particular the cardinality of the set of all 2-ary operations for a set of four elements is computed. Finally the author characterizes TC Latin bricks on certain types of product sets induced by Abelian groups.

Recommendations

• Clones satisfying the term condition
• scientific article; zbMATH DE number 3902623
• Maximal TC-clones, graphs and relations
• scientific article; zbMATH DE number 3977287
• scientific article; zbMATH DE number 3972931

Cites work

• Clones satisfying the term condition
• Counting Latin rectangles
• Some applications of the term condition
• The structure of finite algebras

Cited in

(1)

• Clones satisfying the term condition

This page was built for publication: TC operations and Latin bricks

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