In this paper we are interested in the class of n-ary operations on an arbitrary chain that are quasitrivial, symmetric, nondecreasing, and associative. We first provide a description of these operations. We then prove that associativity can be replaced with bisymmetry in the definition of this class. Finally we investigate the special situation where the chain is finite
We investigate the class of binary associative and quasitrivial operations on a given finite set. He...
We investigate the class of binary associative and quasitrivial operations on a given finite set. He...
Let $X$ be a nonempty set. Denote by $\mathcal{F}^n_k$ the class of associative operations $F\colon ...
We provide a description of the class of n-ary operations on an arbitrary chain that are quasitrivia...
peer reviewedWe provide a description of the class of n-ary operations on an arbitrary chain that ar...
peer reviewedIn this paper we provide a characterization of the class of idempotent n-ary uninorms o...
In this paper we provide visual characterization of associative quasitrivial nondecreasing operation...
In this paper we provide a characterization of the class of idempotent n-ary uninorms on a given cha...
An n-variable associative function is called reducible if it can be written as a composition of a bi...
We show that every quasitrivial n-ary semigroup is reducible to a binary semigroup, and we provide n...
International audienceWe show that every quasitrivial n-ary semigroup is reducible to a binary semig...
peer reviewedWe show that every quasitrivial n-ary semigroup is reducible to a binary semigroup, an...
An n-variable associative function is called reducible if it can be written as a composition of a bi...
An n-variable associative function is called reducible if it can be written as a composition of a bi...
We investigate the class of binary associative and quasitrivial operations on a given finite set. He...
We investigate the class of binary associative and quasitrivial operations on a given finite set. He...
We investigate the class of binary associative and quasitrivial operations on a given finite set. He...
Let $X$ be a nonempty set. Denote by $\mathcal{F}^n_k$ the class of associative operations $F\colon ...
We provide a description of the class of n-ary operations on an arbitrary chain that are quasitrivia...
peer reviewedWe provide a description of the class of n-ary operations on an arbitrary chain that ar...
peer reviewedIn this paper we provide a characterization of the class of idempotent n-ary uninorms o...
In this paper we provide visual characterization of associative quasitrivial nondecreasing operation...
In this paper we provide a characterization of the class of idempotent n-ary uninorms on a given cha...
An n-variable associative function is called reducible if it can be written as a composition of a bi...
We show that every quasitrivial n-ary semigroup is reducible to a binary semigroup, and we provide n...
International audienceWe show that every quasitrivial n-ary semigroup is reducible to a binary semig...
peer reviewedWe show that every quasitrivial n-ary semigroup is reducible to a binary semigroup, an...
An n-variable associative function is called reducible if it can be written as a composition of a bi...
An n-variable associative function is called reducible if it can be written as a composition of a bi...
We investigate the class of binary associative and quasitrivial operations on a given finite set. He...
We investigate the class of binary associative and quasitrivial operations on a given finite set. He...
We investigate the class of binary associative and quasitrivial operations on a given finite set. He...
Let $X$ be a nonempty set. Denote by $\mathcal{F}^n_k$ the class of associative operations $F\colon ...