• Aucun résultat trouvé

On bisymmetric and quasitrivial operations 56th ISFE Jimmy Devillet

N/A
N/A
Protected

Academic year: 2021

Partager "On bisymmetric and quasitrivial operations 56th ISFE Jimmy Devillet"

Copied!
22
0
0

Texte intégral

(1)

On bisymmetric and quasitrivial operations

56th ISFE

Jimmy Devillet

University of Luxembourg

(2)

Connectedness and Contour Plots

LetX be a nonempty set and letF:X2 →X Definition

The points (x,y),(u,v)∈X2 are F-connected if F(x,y) = F(u,v)

The point (x,y)∈X2 is F-isolatedif it is notF-connected to another point in X2

(3)

Connectedness and Contour Plots

For any integern≥1, let Xn={1, ...,n} endowed with ≤ Example. F(x,y) = max{x,y} on (X4,≤)

r r r r

r r r r

r r r r

r r r r

- 6

1 2 3 4

1 2 3 4

1 2

3 4

(4)

Bisymmetry and quasitriviality

Definition

F:X2 →X is said to be bisymmetric if

F(F(x,y),F(u,v)) = F(F(x,u),F(y,v)) x,y,u,v ∈X quasitrivialif

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

Lemma(Kepka, 1981)

IfF is bisymmetric and quasitrivial then it is associative

(5)

Weak orderings

Recall that a binary relationR on X is said to be totalif ∀x,y: xRy or yRx

transitiveif ∀x,y,z: xRy andyRz impliesxRz

Aweak ordering on X is a binary relation -onX that is total and transitive.

symmetric part: ∼ asymmetric part: ≺

Recall that∼is an equivalence relation on X and that≺induces a linear ordering on the quotient setX/∼

(6)

Motivation

Theorem(L¨anger, 1980)

F is associative and quasitrivial iff there exists a weak ordering - onX such that

F|A×B =

(max-|A×B, if A6=B,

π1|A×B or π2|A×B, if A=B, ∀A,B ∈X/∼ IfX =Xn={1, . . . ,n}, then

x - y ⇐⇒ |F−1({x})| ≤ |F−1({y})|

(7)

Motivation

F|A×B =

(max-|A×B, if A6=B,

π1|A×B or π2|A×B, if A=B, ∀A,B ∈X/∼

x - y ⇐⇒ |F−1({x})| ≤ |F−1({y})|

r r r

r r r

r r r

1 2

3

1 < 2 < 3

r r r

r r r

r r r

2 1

3

2 1 3

(8)

Motivation

s s s

s s s

s s s

1 2

3

1 < 2 < 3

s s s

s s s

s s s

2 1

3

2 1 3

F(F(2,3),F(1,2)) = 3 6= 1 = F(F(2,1),F(3,2))

=⇒ F is not bisymmetric

(9)

Quasilinearity

Let -be a weak ordering onX

Definition

-isquasilinear if there exist no pairwise distinct a,b,c ∈X such thata≺b∼c

Example. OnX ={1,2,3,4}, consider the- 2∼3≺1≺4

(10)

Quasilinearity

F|A×B =

(max-|A×B, if A6=B,

π1|A×B or π2|A×B, if A=B, ∀A,B ∈X/∼

s s s

s s s

s s s

1 2

3

1 < 2 < 3

s s s

s s s

s s s

2 1

3

2 1 3

-is not quasilinear and F is not bisymmetric

(11)

Quasilinearity

x - y ⇐⇒ |F−1({x})| ≤ |F−1({y})|

s s s

s s s

s s s

1 2

3

1 < 2 < 3

s s s

s s s

s s s

1 3

2

1 3 2

-is quasilinear and F is bisymmetric

(12)

A characterization

F|A×B =

(max-|A×B, ifA6=B,

π1|A×B orπ2|A×B, ifA=B, ∀A,B ∈X/∼ (∗)

Theorem

For anyF:X2 →X, the following are equivalent.

(i) F is bisymmetric and quasitrivial

(ii) F is of the form (∗) for some quasilinear -

(13)

A characterization

We denote theset of minimal elements of X for -by min-X

π1 orπ2

max-

min-X X\min-X min-X

X \min-X

(14)

Bisymmetric and quasitrivial operations

r r r r r r r r r

r r r r r r r r r

r r r r r r r r r

r r r r r r r r r

r r r r r r r r r

r r r r r r r r r

r r r r r r r r r

r r r r r r r r r

r r r r r r r r r

r r r r r r r r r

r r r r r r r r r

r r r

r r r r r r

r r r r r r r r r

r r r r r r r r r

(15)

The nondecreasing case

Let≤ be a linear ordering onX

Definition. F:X2 →X is nondecreasing for ≤if

F(x,y)≤F(x0,y0) whenever x≤x0 and y≤y0

(16)

The nondecreasing case

F|A×B =

(max-|A×B, if A6=B,

π1|A×B or π2|A×B, if A=B, ∀A,B ∈X/∼

s s s

s s s

s s s

1 2

3

1 < 2 < 3

s s s

s s s

s s s

2 1

3

2 1 3

(17)

Weakly single-peaked weak orderings

Definition(Couceiro et al., 2018)

-is said to beweakly single-peaked for ≤if for any a,b,c ∈X, a<b<c =⇒ b≺a or b ≺c or a∼b∼c Example. The weak ordering-on

X4={1<2<3<4}

defined by

2≺1∼3≺4 is weakly single-peaked for≤

(18)

Weakly single-peaked weak orderings

x - y ⇐⇒ |F−1({x})| ≤ |F−1({y})|

s s s s

s s s s

s s s s

s s s s

1 2

3 4

1 < 2 < 3 < 4

s s s s

s s s s

s s s s

s s s s

1 2

3 4

2 1 3 4

(19)

Associative quasitrivial and nondecreasing operations

F|A×B =

(max-|A×B, ifA6=B,

π1|A×B orπ2|A×B, ifA=B, ∀A,B ∈X/∼ (∗)

Theorem(Couceiro et al., 2018)

For anyF:X2 →X, the following are equivalent.

(i) F is associative, quasitrivial, and nondecreasing

(ii) F is of the form (∗) for some -that is weakly single-peaked for ≤

(20)

Bisymmetric quasitrivial and nondecreasing operations

F|A×B =

(max-|A×B, ifA6=B,

π1|A×B orπ2|A×B, ifA=B, ∀A,B ∈X/∼ (∗)

Theorem

For anyF:X2 →X, the following are equivalent.

(i) F is bisymmetric, quasitrivial, and nondecreasing

(ii) F is of the form (∗) for some -that is quasilinear and weakly single-peaked for≤

(21)

Final remarks

In arXiv: 1712.07856

1 Characterizations of the class of bisymmetric and quasitrivial operations as well as the subclass of those operations that are nondecreasing

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

Number of bisymmetric and quasitrivial operations: A296943 Number of bisymmetric, quasitrivial, and nondecreasing operations: A296953

. . .

(22)

Selected references

N. L. Ackerman.

A characterization of quasitrivialn-semigroups.

To appear inAlgebra Universalis.

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

Quasitrivial semigroups: characterizations and enumerations.

Semigroup forum, In press. arXiv:1709.09162.

J. Devillet.

Bisymmetric and quasitrivial operations: characterizations and enumerations.

arXiv: 1712.07856.

Z. Fitzsimmons.

Single-peaked consistency for weak orders is easy.

In Proc. of the 15th Conf. on Theoretical Aspects of Rationality and Knowledge (TARK 2015), pages 127–140, June 2015. arXiv:1406.4829.

T. Kepka.

Quasitrivial groupoids and balanced identities.

Acta Univ. Carolin. - Math. Phys., 22(2):49–64, 1981.

H. L¨anger.

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

Semigroup forum, 20:151–156, 1980.

Références

Documents relatifs

By a binary tree we mean an unordered rooted tree in which every vertex has at most two

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

Number of associative and quasitrivial operations: A292932 Number of associative, quasitrivial, and ≤-preserving operations: A293005.. Number of weak orderings on X n that

The join of two arithmetic IASI graphs admits an arithmetic IASI if and only if the deterministic index of every vertex of one graph is an integral multiple or divisor of

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

in collaboration with Miguel Couceiro and Jean-Luc Marichal University of Luxembourg... Graphical interpretation of the

As we will see, quasitrivial, associative, and nondecreasing operations are characterized in terms of weak orderings through the so-called single-peakedness property introduced

2 In arXiv: 1805.11936, we provided an alternative characterization of the class of associative, idempotent, symmetric, and nondecreasing operations on X n