• Aucun résultat trouvé

Characterizations and enumerations of classes of quasitrivial n-ary semigroups

N/A
N/A
Protected

Academic year: 2021

Partager "Characterizations and enumerations of classes of quasitrivial n-ary semigroups"

Copied!
35
0
0

Texte intégral

(1)

Characterizations and enumerations of classes of

quasitrivial n-ary semigroups

Jimmy Devillet

University of Luxembourg Luxembourg

(2)
(3)

Quasitriviality

Definition

G : X2→ X is said to be quasitrivial(orconservative) if

G (x , y ) ∈ {x , y } x , y ∈ X

Example. G = max≤ on X = {1, 2, 3} endowed with the usual ≤

(4)

Quasitriviality

Definition

G : X2→ X is said to be quasitrivial(orconservative) if

G (x , y ) ∈ {x , y } x , y ∈ X

Example. G = max≤ on X = {1, 2, 3} endowed with the usual ≤

(5)

Quasitriviality

Definition

G : X2→ X is said to be quasitrivial(orconservative) if

G (x , y ) ∈ {x , y } x , y ∈ X

Example. G = max≤ on X = {1, 2, 3} endowed with the usual ≤

(6)

Projections

Definition.

Theprojection operationsπ1: X2→ X and π2: X2→ X are respectively

defined by

π1(x , y ) = x , x , y ∈ X

(7)

Quasitrivial semigroups

Theorem (L¨anger, 1980)

Let G : X2→ X .

(8)

-Quasitrivial semigroups

Theorem (L¨anger, 1980)

Let G : X2→ X .

(9)
(10)
(11)

Enumeration of associative and quasitrivial operations

k ∈ N

q(k) : number of associative and quasitrivial operations on {1, . . . , k} (OEIS : A292932)

For any integers 0 ≤ m ≤ k theStirling number of the second kind

(12)

Enumeration of associative and quasitrivial operations

Theorem (C.,D.,Marichal, 2019)

We have the closed-form expression

(13)

Enumeration of associative and quasitrivial operations

Theorem (C.,D.,Marichal, 2019)

We have the closed-form expression

(14)
(15)
(16)

Associativity and Quasitriviality

n ∈ N≥2 Definition F : Xn→ X is said to be quasitrivialif F (x1, . . . , xn) ∈ {x1, . . . , xn} x1, . . . , xn∈ X associative if F (x1, . . . , xi −1, F (xi, . . . , xi +n−1), xi +n, . . . , x2n−1) = F (x1, . . . , xi, F (xi +1, . . . , xi +n), xi +n+1, . . . , x2n−1)

for all x1, . . . , x2n−1∈ X and all 1 ≤ i ≤ n − 1.

(17)

Associativity and Quasitriviality

n ∈ N≥2 Definition F : Xn→ X is said to be quasitrivialif F (x1, . . . , xn) ∈ {x1, . . . , xn} x1, . . . , xn∈ X associative if F (x1, . . . , xi −1, F (xi, . . . , xi +n−1), xi +n, . . . , x2n−1) = F (x1, . . . , xi, F (xi +1, . . . , xi +n), xi +n+1, . . . , x2n−1) for all x1, . . . , x2n−1∈ X and all 1 ≤ i ≤ n − 1.

(18)

Associativity and Quasitriviality

n ∈ N≥2 Definition F : Xn→ X is said to be quasitrivialif F (x1, . . . , xn) ∈ {x1, . . . , xn} x1, . . . , xn∈ X associative if F (x1, . . . , xi −1, F (xi, . . . , xi +n−1), xi +n, . . . , x2n−1) = F (x1, . . . , xi, F (xi +1, . . . , xi +n), xi +n+1, . . . , x2n−1)

for all x1, . . . , x2n−1∈ X and all 1 ≤ i ≤ n − 1.

(19)

Associativity and Quasitriviality

n ∈ N≥2 Definition F : Xn→ X is said to be quasitrivialif F (x1, . . . , xn) ∈ {x1, . . . , xn} x1, . . . , xn∈ X associative if F (x1, . . . , xi −1, F (xi, . . . , xi +n−1), xi +n, . . . , x2n−1) = F (x1, . . . , xi, F (xi +1, . . . , xi +n), xi +n+1, . . . , x2n−1)

for all x1, . . . , x2n−1∈ X and all 1 ≤ i ≤ n − 1.

(20)

Reducibility

Definition

F : Xn→ X and G : X2 → X associative operations.

F is said to bereducible to G if

F (x1, . . . , xn) = G (x1, G (x2, G (. . . , G (xn−1, xn) . . .)))

Example.

F (x , y , z) = x + y + z (mod 2) ,

(21)

Reducibility

Definition

F : Xn→ X and G : X2 → X associative operations.

F is said to bereducible to G if

F (x1, . . . , xn) = G (x1, G (x2, G (. . . , G (xn−1, xn) . . .)))

Example.

F (x , y , z) = x + y + z (mod 2) ,

(22)

Reducibility

Definition

F : Xn→ X and G : X2 → X associative operations.

F is said to bereducible to G if

F (x1, . . . , xn) = G (x1, G (x2, G (. . . , G (xn−1, xn) . . .)))

Example.

F (x , y , z) = x + y + z (mod 2) ,

(23)

Quasitrivial n-ary semigroups

Theorem (Ackerman 2011, Dudek and Mukhin 2006)

Every quasitrivial n-ary semigroup is reducible to a semigroup.

But the binary reduction is not necessarily quasitrivial nor unique.

Example.

F (x , y , z) = x + y + z (mod 2)

(24)

Quasitrivial n-ary semigroups

Theorem (Ackerman 2011, Dudek and Mukhin 2006)

Every quasitrivial n-ary semigroup is reducible to a semigroup.

But the binary reduction is not necessarily quasitrivial nor unique. Example.

F (x , y , z) = x + y + z (mod 2)

(25)

Quasitrivial n-ary semigroups

Theorem (Ackerman 2011, Dudek and Mukhin 2006)

Every quasitrivial n-ary semigroup is reducible to a semigroup.

But the binary reduction is not necessarily quasitrivial nor unique. Example.

F (x , y , z) = x + y + z (mod 2)

(26)

Neutral elements

Definition

e ∈ X is said to be aneutral element for F if

F (x , e, . . . , e) = F (e, x , e, . . . , e) = . . . = F (e, . . . , e, x ) = x , for all x ∈ X

Example. F (x1, . . . , xn) =Pni =1xi (mod n − 1)

Proposition

(27)

Neutral elements

Definition

e ∈ X is said to be aneutral element for F if

F (x , e, . . . , e) = F (e, x , e, . . . , e) = . . . = F (e, . . . , e, x ) = x , for all x ∈ X

Example. F (x1, . . . , xn) =Pni =1xi (mod n − 1)

Proposition

(28)

Neutral elements

Definition

e ∈ X is said to be aneutral element for F if

F (x , e, . . . , e) = F (e, x , e, . . . , e) = . . . = F (e, . . . , e, x ) = x , for all x ∈ X

Example. F (x1, . . . , xn) =Pni =1xi (mod n − 1)

Proposition

(29)

Uniqueness of a reduction

Proposition

Every quasitrivial n-ary semigroup has at most two neutral elements.

Theorem

(30)

Uniqueness of a reduction

Proposition

Every quasitrivial n-ary semigroup has at most two neutral elements.

Theorem

(31)

Characterization of quasitrivial n-ary semigroups

Theorem

Let F : Xn→ X .

F is associative, quasitrivial, and has at most one neutral element m

∃ a binary reduction G : X2 → X of F and

(32)

Enumeration of quasitrivial n-ary semigroups

q(k) = k X i =0 2i k−i X m=0 (−1)m k m k − m i  (i + m)! , k ≥ 0.

qn(k) : number of associative and quasitrivial n-ary operations

that have at most one neutral element on {1, . . . , k}

Corollary

We have

(33)

Enumeration of quasitrivial n-ary semigroups

q(k) = k X i =0 2i k−i X m=0 (−1)m k m k − m i  (i + m)! , k ≥ 0.

qn(k) : number of associative and quasitrivial n-ary operations

that have at most one neutral element on {1, . . . , k}

Corollary

We have

(34)

Final remarks

In http://orbilu.uni.lu/handle/10993/39337

1 Characterization of the class of quasitrivial n-ary semigroups that have exactly two neutral elements

2 New integer sequences (http://www.oeis.org)

Number of quasitrivial n-ary semigroups that have no neutral element: A308352

Number of quasitrivial n-ary semigroups that have exactly two neutral elements: A308354

(35)

Some references

N. L. Ackerman.

A characterization of quasitrivial n-semigroups.

To appear in Algebra Universalis.

M. Couceiro, J. Devillet, and J.-L. Marichal.

Quasitrivial semigroups: characterizations and enumerations.

Semigroup Forum, 98(3):472–498, 2019. M. Couceiro and J. Devillet.

Every quasitrivial n-ary semigroup is reducible to a semigroup.

http://orbilu.uni.lu/handle/10993/39337. W. A. Dudek and V. V. Mukhin.

On n-ary semigroups with adjoint neutral element.

Quasigroups and Related Systems, 14:163–168, 2006. H. L¨anger.

The free algebra in the variety generated by quasi-trivial semigroups.

Semigroup Forum, 20:151–156, 1980. N. J. A. Sloane (editor).

The On-Line Encyclopedia of Integer Sequences.

Références

Documents relatifs

In arXiv: 1811.11113 and Quasitrivial semigroups: characterizations and enumerations (Semigroup Forum, 2018).. 1 Characterizations and classifications of quasitrival semigroups by

In this section we provide a characterization of the n-ary operations on a given chain that are quasitrivial, symmetric, nondecreasing, and associa- tive, and we show that

55th International Symposium of Functional Equations and Inequalities Chengdu, China, June 11-18, 2017.. n-ary semigroups Definition.. Let X be an arbitrary set.. n-ary

When X is endowed with a total ordering we also characterize the subclass of quasitrivial, commutative, and order-preserving semigroups (Theorem 3.7) by means of the

Hence, the exponent of an Abelian group divides n − 1 if and only if the Abelian group is isomorphic to a direct sum of cyclic groups whose orders divide n −1.. Theorem 1.3

Note : If we assume further that F is commutative and has a neutral element then it is an idempotent uninorm.... on X that is total

Abstract. We show that every quasitrivial n-ary semigroup is reducible to a binary semigroup, and we provide necessary and sufficient condi- tions for such a reduction to be

We provide in Section 2 a characterization of these operations and show that they are nothing other than idempo- tent binary uninorms (Proposition 1).. We also provide a description