Reducibility of n-ary semigroups: from quasitriviality towards idempotency

Abstract

Let X be a nonempty set. Denote by Fnk the class of associative operations F Xn X satisfying the condition F(x1,…,xn)∈\x1,…,xn\ whenever at least k of the elements x1,…,xn are equal to each other. The elements of Fn1 are said to be quasitrivial and those of Fnn are said to be idempotent. We show that Fn1=·s =Fnn-2⊂eqFnn-1⊂eqFnn and we give conditions on the set X for the last inclusions to be strict. The class Fn1 was recently characterized by Couceiro and Devillet, who showed that its elements are reducible to binary associative operations. However, some elements of Fnn are not reducible. In this paper, we characterize the class Fnn-1n1 and show that its elements are reducible. We give a full description of the corresponding reductions and show how each of them is built from a quasitrivial semigroup and an Abelian group whose exponent divides n-1.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…