SearcharxivSearch

arXiv subjects

Jimmy Devillet

Publications and source records attributed to Jimmy Devillet.

12 recordsLinked to original sources

On the structure of symmetric $n$-ary bands

We study the class of symmetric $n$-ary bands. These are $n$-ary semigroups $(X,F)$ such that $F$ is invariant under the action of permutations and idempotent, i.e., satisfies $F(x,\ldots,x)=x$ for all $x\in X$. We first provide a structure theorem for these symmetric $n$-ary bands that extends the classical (strong) semilattice decomposition of certain classes of bands. We introduce the concept of strong $n$-ary semilattice of $n$-ary semigroups and we show that the symmetric $n$-ary bands are exactly the strong $n$-ary semilattices of $n$-ary extensions of Abelian groups whose exponents divide $n-1$. Finally, we use the structure theorem to obtain necessary and sufficient conditions for a symmetric $n$-ary band to be reducible to a semigroup.

math.RA

Reducibility of $n$-ary semigroups: from quasitriviality towards idempotency

Let $X$ be a nonempty set. Denote by $\mathcal{F}^n_k$ the class of associative operations $F\colon X^n\to X$ satisfying the condition $F(x_1,\ldots,x_n)\in\{x_1,\ldots,x_n\}$ whenever at least $k$ of the elements $x_1,\ldots,x_n$ are equal to each other. The elements of $\mathcal{F}^n_1$ are said to be quasitrivial and those of $\mathcal{F}^n_n$ are said to be idempotent. We show that $\mathcal{F}^n_1=\cdots =\mathcal{F}^n_{n-2}\subseteq\mathcal{F}^n_{n-1}\subseteq\mathcal{F}^n_n$ and we give conditions on the set $X$ for the last inclusions to be strict. The class $\mathcal{F}^n_1$ was recently characterized by Couceiro and Devillet, who showed that its elements are reducible to binary associative operations. However, some elements of $\mathcal{F}^n_n$ are not reducible. In this paper, we characterize the class $\mathcal{F}^n_{n-1}\setminus\mathcal{F}^n_1$ 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$.

math.RA

Every quasitrivial n-ary semigroup is reducible to a semigroup

We show that every quasitrivial n-ary semigroup is reducible to a binary semigroup, and we provide necessary and sufficient conditions for such a reduction to be unique. These results are then refined in the case of symmetric n-ary semigroups. We also explicitly determine the sizes of these classes when the semigroups are defined on finite sets. As a byproduct of these enumerations, we obtain several new integer sequences.

math.RA

Classifications of quasitrivial semigroups

We investigate classifications of quasitrivial semigroups defined by certain equivalence relations. The subclass of quasitrivial semigroups that preserve a given total ordering is also investigated. In the special case of finite semigroups, we address and solve several related enumeration problems.

math.RA

Invariance in a class of operations related to weighted quasi-geometric means

Let $I\subset (0,\infty )$ be an interval that is closed with respect to the multiplication. The operations $C_{f,g}\colon I^{2}\rightarrow I$ of the form \begin{equation*} C_{f,g}\left( x,y\right) =\left( f\circ g\right) ^{-1}\left( f\left( x\right) \cdot g\left( y\right) \right) \text{,} \end{equation*} where $f,g$ are bijections of $I$ are considered. Their connections with generalized weighted quasi-geometric means is presented. It is shown that invariance question within the class of this operations leads to means of iterative type and to a problem on a composite functional equation. An application of the invariance identity to determine effectively the limit of the sequence of iterates of some generalized quasi-geometric mean-type mapping, and the form of all continuous functions which are invariant with respect to this mapping are given. The equality of two considered operations is also discussed.

math.CA

A new invariance identity and means

The invariance identity involving three operations $D_{f,g}:X\times X\rightarrow X$ of the form \begin{equation*} D_{f,g}\left( x,y\right) =\left( f\circ g\right) ^{-1}\left( f\left( x\right) \oplus g\left( y\right) \right) \text{,} \end{equation*} is proposed. The connections of these operations with means is investigated. The question when the invariance equality admits three means leads to a composite functional equation. Problem to determine its continuous solutions is posed.

math.CA

Characterizations of biselective operations

Let $X$ be a nonempty set and let $i,j \in \{1,2,3,4\}$. We say that a binary operation $F:X^2\to X$ is $(i,j)$-selective if $$ F(F(x_1,x_2),F(x_3,x_4))~=~F(x_i,x_j), $$ for all $x_1,x_2,x_3,x_4\in X$. In this paper we provide characterizations of the class of $(i,j)$-selective operations. We also investigate some subclasses by adding algebraic properties such as associativity or bisymmetry.

math.RA

Associative, idempotent, symmetric, and order-preserving operations on chains

We characterize the associative, idempotent, symmetric, and order-preserving operations on (finite) chains in terms of properties of (the Hasse diagram of) their associated semilattice order. In particular, we prove that the number of associative, idempotent, symmetric, and order-preserving operations on an $n$-element chain is the $n^{\text{th}}$ Catalan number.

math.RA

Bisymmetric and quasitrivial operations: characterizations and enumerations

We investigate the class of bisymmetric and quasitrivial binary operations on a given set $X$ and provide various characterizations of this class as well as the subclass of bisymmetric, quasitrivial, and order-preserving binary operations. We also determine explicitly the sizes of these classes when the set $X$ is finite.

math.RA

Quasitrivial semigroups: characterizations and enumerations

We investigate the class of quasitrivial semigroups and provide various characterizations of the subclass of quasitrivial and commutative semigroups as well as the subclass of quasitrivial and order-preserving semigroups. We also determine explicitly the sizes of these classes when the semigroups are defined on finite sets. As a byproduct of these enumerations, we obtain several new integer sequences.

math.RA

Characterizations of idempotent discrete uninorms

In this paper we provide an axiomatic characterization of the idempotent discrete uninorms by means of three conditions only: conservativeness, symmetry, and nondecreasing monotonicity. We also provide an alternative characterization involving the bisymmetry property. Finally, we provide a graphical characterization of these operations in terms of their contour plots, and we mention a few open questions for further research.

math.RA