TC operations and Latin bricks (Q909688)

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.