absorption in semigroups and n-ary semigroups · example, bulatov’s dichotomy theorem for...

72
Absorption in semigroups and n-ary semigroups Bojan Baˇ si´ c Department of Mathematics and Informatics University of Novi Sad Serbia June 6, 2015 Bojan Baˇ si´ c Absorption in (n-ary) semigroups 1/ 13

Upload: others

Post on 03-Jan-2020

6 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Absorption in semigroups and n-ary semigroups

Bojan Basic

Department of Mathematics and InformaticsUniversity of Novi Sad

Serbia

June 6, 2015

Bojan Basic Absorption in (n-ary) semigroups 1/ 13

Page 2: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Introduction

Definition (Barto & Kozik)

Let A be an algebra and B 6 A. We say that B absorbs A,denoted by B E A, iff there exists an idempotent term t in A suchthat for each a ∈ A and b1, b2, . . . , bm ∈ B we have

t(a, b2, b3, . . . , bm) ∈ B;

t(b1, a, b3, . . . , bm) ∈ B;...

t(b1, b2, b3, . . . , a) ∈ B.

Bojan Basic Absorption in (n-ary) semigroups 2/ 13

Page 3: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Introduction

Definition (Barto & Kozik)

Let A be an algebra and B 6 A. We say that B absorbs A,denoted by B E A, iff there exists an idempotent term t in A suchthat for each a ∈ A and b1, b2, . . . , bm ∈ B we have

t(a, b2, b3, . . . , bm) ∈ B;

t(b1, a, b3, . . . , bm) ∈ B;...

t(b1, b2, b3, . . . , a) ∈ B.

Bojan Basic Absorption in (n-ary) semigroups 2/ 13

Page 4: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Introduction

A generalization of the near-unanimity (an idempotent finitealgebra A has a near-unanimity term iff every singletonabsorbs A).

A very useful notion with many applications so far. Forexample, Bulatov’s dichotomy theorem for conservative CSPs,with a deep and complicated proof (nearly 70 pages long),was reproved [Barto, 2010] using these techniques on merely10 pages.

Loosely speaking, the main idea of absorption is that, whenB E A where B is a proper subalgebra of A, then someinduction-like step can often be applied.

Bojan Basic Absorption in (n-ary) semigroups 3/ 13

Page 5: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Introduction

A generalization of the near-unanimity

(an idempotent finitealgebra A has a near-unanimity term iff every singletonabsorbs A).

A very useful notion with many applications so far. Forexample, Bulatov’s dichotomy theorem for conservative CSPs,with a deep and complicated proof (nearly 70 pages long),was reproved [Barto, 2010] using these techniques on merely10 pages.

Loosely speaking, the main idea of absorption is that, whenB E A where B is a proper subalgebra of A, then someinduction-like step can often be applied.

Bojan Basic Absorption in (n-ary) semigroups 3/ 13

Page 6: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Introduction

A generalization of the near-unanimity (an idempotent finitealgebra A has a near-unanimity term iff every singletonabsorbs A).

A very useful notion with many applications so far. Forexample, Bulatov’s dichotomy theorem for conservative CSPs,with a deep and complicated proof (nearly 70 pages long),was reproved [Barto, 2010] using these techniques on merely10 pages.

Loosely speaking, the main idea of absorption is that, whenB E A where B is a proper subalgebra of A, then someinduction-like step can often be applied.

Bojan Basic Absorption in (n-ary) semigroups 3/ 13

Page 7: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Introduction

A generalization of the near-unanimity (an idempotent finitealgebra A has a near-unanimity term iff every singletonabsorbs A).

A very useful notion with many applications so far.

Forexample, Bulatov’s dichotomy theorem for conservative CSPs,with a deep and complicated proof (nearly 70 pages long),was reproved [Barto, 2010] using these techniques on merely10 pages.

Loosely speaking, the main idea of absorption is that, whenB E A where B is a proper subalgebra of A, then someinduction-like step can often be applied.

Bojan Basic Absorption in (n-ary) semigroups 3/ 13

Page 8: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Introduction

A generalization of the near-unanimity (an idempotent finitealgebra A has a near-unanimity term iff every singletonabsorbs A).

A very useful notion with many applications so far. Forexample, Bulatov’s dichotomy theorem for conservative CSPs,with a deep and complicated proof (nearly 70 pages long),was reproved [Barto, 2010] using these techniques on merely10 pages.

Loosely speaking, the main idea of absorption is that, whenB E A where B is a proper subalgebra of A, then someinduction-like step can often be applied.

Bojan Basic Absorption in (n-ary) semigroups 3/ 13

Page 9: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Introduction

A generalization of the near-unanimity (an idempotent finitealgebra A has a near-unanimity term iff every singletonabsorbs A).

A very useful notion with many applications so far. Forexample, Bulatov’s dichotomy theorem for conservative CSPs,with a deep and complicated proof (nearly 70 pages long),was reproved [Barto, 2010] using these techniques on merely10 pages.

Loosely speaking, the main idea of absorption is that, whenB E A where B is a proper subalgebra of A, then someinduction-like step can often be applied.

Bojan Basic Absorption in (n-ary) semigroups 3/ 13

Page 10: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Introduction

Question

Given a finite algebra A and its subalgebra B, is it decidablewhether B E A?

This is hard.

Maroti, 2009: The existence of a near-unanimity term in afinite algebra is decidable.

Bulın, 2014: The absorption is decidable if A is finitely related.

Barto & Kazda & Bulın, 2013 (announced): The absorption isdecidable (a very complex algorithm).

Bojan Basic Absorption in (n-ary) semigroups 4/ 13

Page 11: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Introduction

Question

Given a finite algebra A and its subalgebra B, is it decidablewhether B E A?

This is hard.

Maroti, 2009: The existence of a near-unanimity term in afinite algebra is decidable.

Bulın, 2014: The absorption is decidable if A is finitely related.

Barto & Kazda & Bulın, 2013 (announced): The absorption isdecidable (a very complex algorithm).

Bojan Basic Absorption in (n-ary) semigroups 4/ 13

Page 12: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Introduction

Question

Given a finite algebra A and its subalgebra B, is it decidablewhether B E A?

This is hard.

Maroti, 2009: The existence of a near-unanimity term in afinite algebra is decidable.

Bulın, 2014: The absorption is decidable if A is finitely related.

Barto & Kazda & Bulın, 2013 (announced): The absorption isdecidable (a very complex algorithm).

Bojan Basic Absorption in (n-ary) semigroups 4/ 13

Page 13: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Introduction

Question

Given a finite algebra A and its subalgebra B, is it decidablewhether B E A?

This is hard.

Maroti, 2009: The existence of a near-unanimity term in afinite algebra is decidable.

Bulın, 2014: The absorption is decidable if A is finitely related.

Barto & Kazda & Bulın, 2013 (announced): The absorption isdecidable (a very complex algorithm).

Bojan Basic Absorption in (n-ary) semigroups 4/ 13

Page 14: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Introduction

Question

Given a finite algebra A and its subalgebra B, is it decidablewhether B E A?

This is hard.

Maroti, 2009: The existence of a near-unanimity term in afinite algebra is decidable.

Bulın, 2014: The absorption is decidable if A is finitely related.

Barto & Kazda & Bulın, 2013 (announced): The absorption isdecidable (a very complex algorithm).

Bojan Basic Absorption in (n-ary) semigroups 4/ 13

Page 15: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Introduction

Question

Given a finite algebra A and its subalgebra B, is it decidablewhether B E A?

This is hard.

Maroti, 2009: The existence of a near-unanimity term in afinite algebra is decidable.

Bulın, 2014: The absorption is decidable if A is finitely related.

Barto & Kazda & Bulın, 2013 (announced): The absorption isdecidable (a very complex algorithm).

Bojan Basic Absorption in (n-ary) semigroups 4/ 13

Page 16: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

In semigroups everything becomes easier

Theorem

Let A = (A, ·) be a semigroup, and let B 6 A. Then B E A if andonly if ab ∈ B and ba ∈ B for each a ∈ A, b ∈ B, and there existsa positive integer k > 1 such that ak ≈ a for each a ∈ A.

Proof (sketch). (⇐) : Easy.(⇒) :

t(x1, x2, . . . , xm)—an absorbing term; xi appears di times;

B 3 t(ab, bk−1, bk−1, . . . , bk−1) ≈ (ab)d1 ;

choose r ≡ 1 (mod k − 1), r > (m − 1)d1;

B 3 ti = t((ab)d1 , bk−1, . . . , bk−1, (ab)r , bk−1, . . . , bk−1);

B 3 (ab)d1(r−(m−1)d1)t2t3 · · · tm ≈ ab.

Bojan Basic Absorption in (n-ary) semigroups 5/ 13

Page 17: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

In semigroups everything becomes easier

Theorem

Let A = (A, ·) be a semigroup, and let B 6 A. Then B E A if andonly if ab ∈ B and ba ∈ B for each a ∈ A, b ∈ B, and there existsa positive integer k > 1 such that ak ≈ a for each a ∈ A.

Proof (sketch). (⇐) : Easy.(⇒) :

t(x1, x2, . . . , xm)—an absorbing term; xi appears di times;

B 3 t(ab, bk−1, bk−1, . . . , bk−1) ≈ (ab)d1 ;

choose r ≡ 1 (mod k − 1), r > (m − 1)d1;

B 3 ti = t((ab)d1 , bk−1, . . . , bk−1, (ab)r , bk−1, . . . , bk−1);

B 3 (ab)d1(r−(m−1)d1)t2t3 · · · tm ≈ ab.

Bojan Basic Absorption in (n-ary) semigroups 5/ 13

Page 18: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

In semigroups everything becomes easier

Theorem

Let A = (A, ·) be a semigroup, and let B 6 A. Then B E A if andonly if ab ∈ B and ba ∈ B for each a ∈ A, b ∈ B, and there existsa positive integer k > 1 such that ak ≈ a for each a ∈ A.

Proof (sketch).

(⇐) : Easy.(⇒) :

t(x1, x2, . . . , xm)—an absorbing term; xi appears di times;

B 3 t(ab, bk−1, bk−1, . . . , bk−1) ≈ (ab)d1 ;

choose r ≡ 1 (mod k − 1), r > (m − 1)d1;

B 3 ti = t((ab)d1 , bk−1, . . . , bk−1, (ab)r , bk−1, . . . , bk−1);

B 3 (ab)d1(r−(m−1)d1)t2t3 · · · tm ≈ ab.

Bojan Basic Absorption in (n-ary) semigroups 5/ 13

Page 19: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

In semigroups everything becomes easier

Theorem

Let A = (A, ·) be a semigroup, and let B 6 A. Then B E A if andonly if ab ∈ B and ba ∈ B for each a ∈ A, b ∈ B, and there existsa positive integer k > 1 such that ak ≈ a for each a ∈ A.

Proof (sketch). (⇐) : Easy.

(⇒) :

t(x1, x2, . . . , xm)—an absorbing term; xi appears di times;

B 3 t(ab, bk−1, bk−1, . . . , bk−1) ≈ (ab)d1 ;

choose r ≡ 1 (mod k − 1), r > (m − 1)d1;

B 3 ti = t((ab)d1 , bk−1, . . . , bk−1, (ab)r , bk−1, . . . , bk−1);

B 3 (ab)d1(r−(m−1)d1)t2t3 · · · tm ≈ ab.

Bojan Basic Absorption in (n-ary) semigroups 5/ 13

Page 20: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

In semigroups everything becomes easier

Theorem

Let A = (A, ·) be a semigroup, and let B 6 A. Then B E A if andonly if ab ∈ B and ba ∈ B for each a ∈ A, b ∈ B, and there existsa positive integer k > 1 such that ak ≈ a for each a ∈ A.

Proof (sketch). (⇐) : Easy.(⇒) :

t(x1, x2, . . . , xm)—an absorbing term; xi appears di times;

B 3 t(ab, bk−1, bk−1, . . . , bk−1) ≈ (ab)d1 ;

choose r ≡ 1 (mod k − 1), r > (m − 1)d1;

B 3 ti = t((ab)d1 , bk−1, . . . , bk−1, (ab)r , bk−1, . . . , bk−1);

B 3 (ab)d1(r−(m−1)d1)t2t3 · · · tm ≈ ab.

Bojan Basic Absorption in (n-ary) semigroups 5/ 13

Page 21: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

In semigroups everything becomes easier

Theorem

Let A = (A, ·) be a semigroup, and let B 6 A. Then B E A if andonly if ab ∈ B and ba ∈ B for each a ∈ A, b ∈ B, and there existsa positive integer k > 1 such that ak ≈ a for each a ∈ A.

Proof (sketch). (⇐) : Easy.(⇒) :

t(x1, x2, . . . , xm)—an absorbing term;

xi appears di times;

B 3 t(ab, bk−1, bk−1, . . . , bk−1) ≈ (ab)d1 ;

choose r ≡ 1 (mod k − 1), r > (m − 1)d1;

B 3 ti = t((ab)d1 , bk−1, . . . , bk−1, (ab)r , bk−1, . . . , bk−1);

B 3 (ab)d1(r−(m−1)d1)t2t3 · · · tm ≈ ab.

Bojan Basic Absorption in (n-ary) semigroups 5/ 13

Page 22: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

In semigroups everything becomes easier

Theorem

Let A = (A, ·) be a semigroup, and let B 6 A. Then B E A if andonly if ab ∈ B and ba ∈ B for each a ∈ A, b ∈ B, and there existsa positive integer k > 1 such that ak ≈ a for each a ∈ A.

Proof (sketch). (⇐) : Easy.(⇒) :

t(x1, x2, . . . , xm)—an absorbing term; xi appears di times;

B 3 t(ab, bk−1, bk−1, . . . , bk−1) ≈ (ab)d1 ;

choose r ≡ 1 (mod k − 1), r > (m − 1)d1;

B 3 ti = t((ab)d1 , bk−1, . . . , bk−1, (ab)r , bk−1, . . . , bk−1);

B 3 (ab)d1(r−(m−1)d1)t2t3 · · · tm ≈ ab.

Bojan Basic Absorption in (n-ary) semigroups 5/ 13

Page 23: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

In semigroups everything becomes easier

Theorem

Let A = (A, ·) be a semigroup, and let B 6 A. Then B E A if andonly if ab ∈ B and ba ∈ B for each a ∈ A, b ∈ B, and there existsa positive integer k > 1 such that ak ≈ a for each a ∈ A.

Proof (sketch). (⇐) : Easy.(⇒) :

t(x1, x2, . . . , xm)—an absorbing term; xi appears di times;

B 3 t(ab, bk−1, bk−1, . . . , bk−1) ≈ (ab)d1 ;

choose r ≡ 1 (mod k − 1), r > (m − 1)d1;

B 3 ti = t((ab)d1 , bk−1, . . . , bk−1, (ab)r , bk−1, . . . , bk−1);

B 3 (ab)d1(r−(m−1)d1)t2t3 · · · tm ≈ ab.

Bojan Basic Absorption in (n-ary) semigroups 5/ 13

Page 24: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

In semigroups everything becomes easier

Theorem

Let A = (A, ·) be a semigroup, and let B 6 A. Then B E A if andonly if ab ∈ B and ba ∈ B for each a ∈ A, b ∈ B, and there existsa positive integer k > 1 such that ak ≈ a for each a ∈ A.

Proof (sketch). (⇐) : Easy.(⇒) :

t(x1, x2, . . . , xm)—an absorbing term; xi appears di times;

B 3 t(ab, bk−1, bk−1, . . . , bk−1) ≈ (ab)d1 ;

choose r ≡ 1 (mod k − 1), r > (m − 1)d1;

B 3 ti = t((ab)d1 , bk−1, . . . , bk−1, (ab)r , bk−1, . . . , bk−1);

B 3 (ab)d1(r−(m−1)d1)t2t3 · · · tm ≈ ab.

Bojan Basic Absorption in (n-ary) semigroups 5/ 13

Page 25: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

In semigroups everything becomes easier

Theorem

Let A = (A, ·) be a semigroup, and let B 6 A. Then B E A if andonly if ab ∈ B and ba ∈ B for each a ∈ A, b ∈ B, and there existsa positive integer k > 1 such that ak ≈ a for each a ∈ A.

Proof (sketch). (⇐) : Easy.(⇒) :

t(x1, x2, . . . , xm)—an absorbing term; xi appears di times;

B 3 t(ab, bk−1, bk−1, . . . , bk−1) ≈ (ab)d1 ;

choose r ≡ 1 (mod k − 1), r > (m − 1)d1;

B 3 ti = t((ab)d1 , bk−1, . . . , bk−1, (ab)r , bk−1, . . . , bk−1);

B 3 (ab)d1(r−(m−1)d1)t2t3 · · · tm ≈ ab.

Bojan Basic Absorption in (n-ary) semigroups 5/ 13

Page 26: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

In semigroups everything becomes easier

Theorem

Let A = (A, ·) be a semigroup, and let B 6 A. Then B E A if andonly if ab ∈ B and ba ∈ B for each a ∈ A, b ∈ B, and there existsa positive integer k > 1 such that ak ≈ a for each a ∈ A.

Proof (sketch). (⇐) : Easy.(⇒) :

t(x1, x2, . . . , xm)—an absorbing term; xi appears di times;

B 3 t(ab, bk−1, bk−1, . . . , bk−1) ≈ (ab)d1 ;

choose r ≡ 1 (mod k − 1), r > (m − 1)d1;

B 3 ti = t((ab)d1 , bk−1, . . . , bk−1, (ab)r , bk−1, . . . , bk−1);

B 3 (ab)d1(r−(m−1)d1)t2t3 · · · tm ≈ ab.

Bojan Basic Absorption in (n-ary) semigroups 5/ 13

Page 27: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Why are semigroups interesting?

Algebraic Dichotomy Conjecture (Bulatov, Jeavons & Krokhin): CSP(Γ)is NP-complete ⇐⇒ Γ does not admit any wnu polymorphism

Absorption was the key ingredient in many special cases proved so far

Jeavons, Cohen & Gyssens, 1997: Γ admits a semilattice polymorphism(idempotent, commutative, associative)⇒ CSP(Γ) ∈ P

We now have a very simple description of the behavior of absorption insemigroups, which might possibly lead to something more general thanthe result above

Another motivation: given the very chaotic behavior of absorption ingeneral, it is nice to have a natural class of algebras in which theabsorption behaves in a very predictable (but still nontrivial) way. Itmight be a very useful research direction to discover whether there is adeeper reason for this nice behavior of absorption in semigroups and n-arysemigroups, and whether this reason may help to describe the behavior ofabsorption in other classes of algebras.

Bojan Basic Absorption in (n-ary) semigroups 6/ 13

Page 28: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Why are semigroups interesting?

Algebraic Dichotomy Conjecture (Bulatov, Jeavons & Krokhin): CSP(Γ)is NP-complete ⇐⇒ Γ does not admit any wnu polymorphism

Absorption was the key ingredient in many special cases proved so far

Jeavons, Cohen & Gyssens, 1997: Γ admits a semilattice polymorphism(idempotent, commutative, associative)⇒ CSP(Γ) ∈ P

We now have a very simple description of the behavior of absorption insemigroups, which might possibly lead to something more general thanthe result above

Another motivation: given the very chaotic behavior of absorption ingeneral, it is nice to have a natural class of algebras in which theabsorption behaves in a very predictable (but still nontrivial) way. Itmight be a very useful research direction to discover whether there is adeeper reason for this nice behavior of absorption in semigroups and n-arysemigroups, and whether this reason may help to describe the behavior ofabsorption in other classes of algebras.

Bojan Basic Absorption in (n-ary) semigroups 6/ 13

Page 29: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Why are semigroups interesting?

Algebraic Dichotomy Conjecture (Bulatov, Jeavons & Krokhin): CSP(Γ)is NP-complete ⇐⇒ Γ does not admit any wnu polymorphism

Absorption was the key ingredient in many special cases proved so far

Jeavons, Cohen & Gyssens, 1997: Γ admits a semilattice polymorphism(idempotent, commutative, associative)⇒ CSP(Γ) ∈ P

We now have a very simple description of the behavior of absorption insemigroups, which might possibly lead to something more general thanthe result above

Another motivation: given the very chaotic behavior of absorption ingeneral, it is nice to have a natural class of algebras in which theabsorption behaves in a very predictable (but still nontrivial) way. Itmight be a very useful research direction to discover whether there is adeeper reason for this nice behavior of absorption in semigroups and n-arysemigroups, and whether this reason may help to describe the behavior ofabsorption in other classes of algebras.

Bojan Basic Absorption in (n-ary) semigroups 6/ 13

Page 30: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Why are semigroups interesting?

Algebraic Dichotomy Conjecture (Bulatov, Jeavons & Krokhin): CSP(Γ)is NP-complete ⇐⇒ Γ does not admit any wnu polymorphism

Absorption was the key ingredient in many special cases proved so far

Jeavons, Cohen & Gyssens, 1997: Γ admits a semilattice polymorphism(idempotent, commutative, associative)⇒ CSP(Γ) ∈ P

We now have a very simple description of the behavior of absorption insemigroups, which might possibly lead to something more general thanthe result above

Another motivation: given the very chaotic behavior of absorption ingeneral, it is nice to have a natural class of algebras in which theabsorption behaves in a very predictable (but still nontrivial) way. Itmight be a very useful research direction to discover whether there is adeeper reason for this nice behavior of absorption in semigroups and n-arysemigroups, and whether this reason may help to describe the behavior ofabsorption in other classes of algebras.

Bojan Basic Absorption in (n-ary) semigroups 6/ 13

Page 31: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Why are semigroups interesting?

Algebraic Dichotomy Conjecture (Bulatov, Jeavons & Krokhin): CSP(Γ)is NP-complete ⇐⇒ Γ does not admit any wnu polymorphism

Absorption was the key ingredient in many special cases proved so far

Jeavons, Cohen & Gyssens, 1997: Γ admits a semilattice polymorphism(idempotent, commutative, associative)⇒ CSP(Γ) ∈ P

We now have a very simple description of the behavior of absorption insemigroups, which might possibly lead to something more general thanthe result above

Another motivation: given the very chaotic behavior of absorption ingeneral, it is nice to have a natural class of algebras in which theabsorption behaves in a very predictable (but still nontrivial) way. Itmight be a very useful research direction to discover whether there is adeeper reason for this nice behavior of absorption in semigroups and n-arysemigroups, and whether this reason may help to describe the behavior ofabsorption in other classes of algebras.

Bojan Basic Absorption in (n-ary) semigroups 6/ 13

Page 32: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Why are semigroups interesting?

Algebraic Dichotomy Conjecture (Bulatov, Jeavons & Krokhin): CSP(Γ)is NP-complete ⇐⇒ Γ does not admit any wnu polymorphism

Absorption was the key ingredient in many special cases proved so far

Jeavons, Cohen & Gyssens, 1997: Γ admits a semilattice polymorphism(idempotent, commutative, associative)⇒ CSP(Γ) ∈ P

We now have a very simple description of the behavior of absorption insemigroups, which might possibly lead to something more general thanthe result above

Another motivation: given the very chaotic behavior of absorption ingeneral, it is nice to have a natural class of algebras in which theabsorption behaves in a very predictable (but still nontrivial) way. Itmight be a very useful research direction to discover whether there is adeeper reason for this nice behavior of absorption in semigroups and n-arysemigroups, and whether this reason may help to describe the behavior ofabsorption in other classes of algebras.

Bojan Basic Absorption in (n-ary) semigroups 6/ 13

Page 33: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

A definition of n-ary semigroup

Definition

We say that an n-ary operation f : An → A is associative iff

f (f (a1, a2, . . . , an), an+1, . . . , a2n−1) = f (a1, f (a2, . . . , an, an+1), . . . , a2n−1)

= · · ·

= f (a1, a2, . . . , f (an, an+1, . . . , a2n−1))

for every a1, a2, . . . , a2n−1 ∈ A.

Definition

An algebra A = (A, f ), where f is an n-ary associative operation, is called ann-ary semigroup.

Instead of f (a1, a2, . . . , an) we write a1a2 · · · an etc.

Bojan Basic Absorption in (n-ary) semigroups 7/ 13

Page 34: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

A definition of n-ary semigroup

Definition

We say that an n-ary operation f : An → A is associative iff

f (f (a1, a2, . . . , an), an+1, . . . , a2n−1) = f (a1, f (a2, . . . , an, an+1), . . . , a2n−1)

= · · ·

= f (a1, a2, . . . , f (an, an+1, . . . , a2n−1))

for every a1, a2, . . . , a2n−1 ∈ A.

Definition

An algebra A = (A, f ), where f is an n-ary associative operation, is called ann-ary semigroup.

Instead of f (a1, a2, . . . , an) we write a1a2 · · · an etc.

Bojan Basic Absorption in (n-ary) semigroups 7/ 13

Page 35: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

A definition of n-ary semigroup

Definition

We say that an n-ary operation f : An → A is associative iff

f (f (a1, a2, . . . , an), an+1, . . . , a2n−1) = f (a1, f (a2, . . . , an, an+1), . . . , a2n−1)

= · · ·

= f (a1, a2, . . . , f (an, an+1, . . . , a2n−1))

for every a1, a2, . . . , a2n−1 ∈ A.

Definition

An algebra A = (A, f ), where f is an n-ary associative operation, is called ann-ary semigroup.

Instead of f (a1, a2, . . . , an) we write a1a2 · · · an etc.

Bojan Basic Absorption in (n-ary) semigroups 7/ 13

Page 36: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

A definition of n-ary semigroup

Definition

We say that an n-ary operation f : An → A is associative iff

f (f (a1, a2, . . . , an), an+1, . . . , a2n−1) = f (a1, f (a2, . . . , an, an+1), . . . , a2n−1)

= · · ·

= f (a1, a2, . . . , f (an, an+1, . . . , a2n−1))

for every a1, a2, . . . , a2n−1 ∈ A.

Definition

An algebra A = (A, f ), where f is an n-ary associative operation, is called ann-ary semigroup.

Instead of f (a1, a2, . . . , an) we write a1a2 · · · an etc.

Bojan Basic Absorption in (n-ary) semigroups 7/ 13

Page 37: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

A possible generalization of the semigroup case

Conjecture

Let A = (A, f ) be an n-ary semigroup, and let B 6 A. Then thefollowing conditions are equivalent:

(1) B E A;

(2) abn−1 ∈ B and bn−1a ∈ B for each a ∈ A, b ∈ B, and thereexists a positive integer k > 1 such that ak ≈ a for eacha ∈ A;

(3) a1a2 · · · an ∈ B whenever at least one of a1, a2, . . . , an belongsto B, and there exists a positive integer k > 1 such thatak ≈ a for each a ∈ A.

The implications (2)⇒ (3) and (3)⇒ (1) are easy.

Bojan Basic Absorption in (n-ary) semigroups 8/ 13

Page 38: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

A possible generalization of the semigroup case

Conjecture

Let A = (A, f ) be an n-ary semigroup, and let B 6 A. Then thefollowing conditions are equivalent:

(1) B E A;

(2) abn−1 ∈ B and bn−1a ∈ B for each a ∈ A, b ∈ B, and thereexists a positive integer k > 1 such that ak ≈ a for eacha ∈ A;

(3) a1a2 · · · an ∈ B whenever at least one of a1, a2, . . . , an belongsto B, and there exists a positive integer k > 1 such thatak ≈ a for each a ∈ A.

The implications (2)⇒ (3) and (3)⇒ (1) are easy.

Bojan Basic Absorption in (n-ary) semigroups 8/ 13

Page 39: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

A possible generalization of the semigroup case

Conjecture

Let A = (A, f ) be an n-ary semigroup, and let B 6 A. Then thefollowing conditions are equivalent:

(1) B E A;

(2) abn−1 ∈ B and bn−1a ∈ B for each a ∈ A, b ∈ B, and thereexists a positive integer k > 1 such that ak ≈ a for eacha ∈ A;

(3) a1a2 · · · an ∈ B whenever at least one of a1, a2, . . . , an belongsto B, and there exists a positive integer k > 1 such thatak ≈ a for each a ∈ A.

The implications (2)⇒ (3) and (3)⇒ (1) are easy.

Bojan Basic Absorption in (n-ary) semigroups 8/ 13

Page 40: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

A possible generalization of the semigroup case

Conjecture

Let A = (A, f ) be an n-ary semigroup, and let B 6 A. Then thefollowing conditions are equivalent:

(1) B E A;

(2) abn−1 ∈ B and bn−1a ∈ B for each a ∈ A, b ∈ B, and thereexists a positive integer k > 1 such that ak ≈ a for eacha ∈ A;

(3) a1a2 · · · an ∈ B whenever at least one of a1, a2, . . . , an belongsto B, and there exists a positive integer k > 1 such thatak ≈ a for each a ∈ A.

The implications (2)⇒ (3) and (3)⇒ (1) are easy.

Bojan Basic Absorption in (n-ary) semigroups 8/ 13

Page 41: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

A possible generalization of the semigroup case

Conjecture

Let A = (A, f ) be an n-ary semigroup, and let B 6 A. Then thefollowing conditions are equivalent:

(1) B E A;

(2) abn−1 ∈ B and bn−1a ∈ B for each a ∈ A, b ∈ B, and thereexists a positive integer k > 1 such that ak ≈ a for eacha ∈ A;

(3) a1a2 · · · an ∈ B whenever at least one of a1, a2, . . . , an belongsto B, and there exists a positive integer k > 1 such thatak ≈ a for each a ∈ A.

The implications (2)⇒ (3) and (3)⇒ (1) are easy.

Bojan Basic Absorption in (n-ary) semigroups 8/ 13

Page 42: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

A possible generalization of the semigroup case

Conjecture

Let A = (A, f ) be an n-ary semigroup, and let B 6 A. Then thefollowing conditions are equivalent:

(1) B E A;

(2) abn−1 ∈ B and bn−1a ∈ B for each a ∈ A, b ∈ B, and thereexists a positive integer k > 1 such that ak ≈ a for eacha ∈ A;

(3) a1a2 · · · an ∈ B whenever at least one of a1, a2, . . . , an belongsto B, and there exists a positive integer k > 1 such thatak ≈ a for each a ∈ A.

The implications (2)⇒ (3) and (3)⇒ (1) are easy.

Bojan Basic Absorption in (n-ary) semigroups 8/ 13

Page 43: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Two nice cases

Theorem

The conjecture holds when |A \ B| = 1.

Definition

We say that an n-ary operation f is commutative iff

f (a1, a2, . . . , an) = f (aπ(1), aπ(2), . . . , aπ(n))

for any a1, a2, . . . , an and any permutation π of the set{1, 2, . . . , n}.

Theorem

The conjecture holds when f is commutative.

Bojan Basic Absorption in (n-ary) semigroups 9/ 13

Page 44: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Two nice cases

Theorem

The conjecture holds when |A \ B| = 1.

Definition

We say that an n-ary operation f is commutative iff

f (a1, a2, . . . , an) = f (aπ(1), aπ(2), . . . , aπ(n))

for any a1, a2, . . . , an and any permutation π of the set{1, 2, . . . , n}.

Theorem

The conjecture holds when f is commutative.

Bojan Basic Absorption in (n-ary) semigroups 9/ 13

Page 45: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Two nice cases

Theorem

The conjecture holds when |A \ B| = 1.

Definition

We say that an n-ary operation f is commutative iff

f (a1, a2, . . . , an) = f (aπ(1), aπ(2), . . . , aπ(n))

for any a1, a2, . . . , an and any permutation π of the set{1, 2, . . . , n}.

Theorem

The conjecture holds when f is commutative.

Bojan Basic Absorption in (n-ary) semigroups 9/ 13

Page 46: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Two nice cases

Theorem

The conjecture holds when |A \ B| = 1.

Definition

We say that an n-ary operation f is commutative iff

f (a1, a2, . . . , an) = f (aπ(1), aπ(2), . . . , aπ(n))

for any a1, a2, . . . , an and any permutation π of the set{1, 2, . . . , n}.

Theorem

The conjecture holds when f is commutative.

Bojan Basic Absorption in (n-ary) semigroups 9/ 13

Page 47: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

Theorem

The conjecture holds when A is an idempotent ternary semigroup.

Proof (sketch). We need to prove that, assuming B E A, for anya ∈ A, b ∈ B we have ab2 ∈ B and b2a ∈ B. The proof consists ofnine steps.

(1) u2vu ∈ B, 2 - |u|, 2 | |v | ⇒ vu ∈ B; uvu2 ∈ B ⇒ uv ∈ B

(2) ub ∈ B, 2 | |u|, b ∈ B ⇒ bu ∈ B and vice versa

Bojan Basic Absorption in (n-ary) semigroups 10/ 13

Page 48: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

Theorem

The conjecture holds when A is an idempotent ternary semigroup.

Proof (sketch). We need to prove that, assuming B E A, for anya ∈ A, b ∈ B we have ab2 ∈ B and b2a ∈ B. The proof consists ofnine steps.

(1) u2vu ∈ B, 2 - |u|, 2 | |v | ⇒ vu ∈ B; uvu2 ∈ B ⇒ uv ∈ B

(2) ub ∈ B, 2 | |u|, b ∈ B ⇒ bu ∈ B and vice versa

Bojan Basic Absorption in (n-ary) semigroups 10/ 13

Page 49: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

Theorem

The conjecture holds when A is an idempotent ternary semigroup.

Proof (sketch).

We need to prove that, assuming B E A, for anya ∈ A, b ∈ B we have ab2 ∈ B and b2a ∈ B. The proof consists ofnine steps.

(1) u2vu ∈ B, 2 - |u|, 2 | |v | ⇒ vu ∈ B; uvu2 ∈ B ⇒ uv ∈ B

(2) ub ∈ B, 2 | |u|, b ∈ B ⇒ bu ∈ B and vice versa

Bojan Basic Absorption in (n-ary) semigroups 10/ 13

Page 50: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

Theorem

The conjecture holds when A is an idempotent ternary semigroup.

Proof (sketch). We need to prove that, assuming B E A, for anya ∈ A, b ∈ B we have ab2 ∈ B and b2a ∈ B.

The proof consists ofnine steps.

(1) u2vu ∈ B, 2 - |u|, 2 | |v | ⇒ vu ∈ B; uvu2 ∈ B ⇒ uv ∈ B

(2) ub ∈ B, 2 | |u|, b ∈ B ⇒ bu ∈ B and vice versa

Bojan Basic Absorption in (n-ary) semigroups 10/ 13

Page 51: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

Theorem

The conjecture holds when A is an idempotent ternary semigroup.

Proof (sketch). We need to prove that, assuming B E A, for anya ∈ A, b ∈ B we have ab2 ∈ B and b2a ∈ B. The proof consists ofnine steps.

(1) u2vu ∈ B, 2 - |u|, 2 | |v | ⇒ vu ∈ B; uvu2 ∈ B ⇒ uv ∈ B

(2) ub ∈ B, 2 | |u|, b ∈ B ⇒ bu ∈ B and vice versa

Bojan Basic Absorption in (n-ary) semigroups 10/ 13

Page 52: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

Theorem

The conjecture holds when A is an idempotent ternary semigroup.

Proof (sketch). We need to prove that, assuming B E A, for anya ∈ A, b ∈ B we have ab2 ∈ B and b2a ∈ B. The proof consists ofnine steps.

(1) u2vu ∈ B, 2 - |u|, 2 | |v | ⇒ vu ∈ B

; uvu2 ∈ B ⇒ uv ∈ B

(2) ub ∈ B, 2 | |u|, b ∈ B ⇒ bu ∈ B and vice versa

Bojan Basic Absorption in (n-ary) semigroups 10/ 13

Page 53: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

Theorem

The conjecture holds when A is an idempotent ternary semigroup.

Proof (sketch). We need to prove that, assuming B E A, for anya ∈ A, b ∈ B we have ab2 ∈ B and b2a ∈ B. The proof consists ofnine steps.

(1) u2vu ∈ B, 2 - |u|, 2 | |v | ⇒ vu ∈ B; uvu2 ∈ B ⇒ uv ∈ B

(2) ub ∈ B, 2 | |u|, b ∈ B ⇒ bu ∈ B and vice versa

Bojan Basic Absorption in (n-ary) semigroups 10/ 13

Page 54: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

Theorem

The conjecture holds when A is an idempotent ternary semigroup.

Proof (sketch). We need to prove that, assuming B E A, for anya ∈ A, b ∈ B we have ab2 ∈ B and b2a ∈ B. The proof consists ofnine steps.

(1) u2vu ∈ B, 2 - |u|, 2 | |v | ⇒ vu ∈ B; uvu2 ∈ B ⇒ uv ∈ B

(2) ub ∈ B, 2 | |u|, b ∈ B ⇒ bu ∈ B and vice versa

Bojan Basic Absorption in (n-ary) semigroups 10/ 13

Page 55: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

(3) abbab ∈ B, babba ∈ B for any a ∈ A, b ∈ B

a′ = abbabt(a′bb, b, b, . . . , b) ∈ Ba′ba′ = (abbab)b(abbab) = (abb)3ab ≈ abbab = a′

t ≈ (a′bb)l ≈ a′bb or t ≈ (a′bb)la′b ≈ a′bba′ba′bb = (abbab)bb = abbab3 ≈ abbaba′bba′b = abbab3abbabb ≈ abbababbabb(abb)ab(abb)2 = abbababbabb ∈ B ⇒ abbab ∈ B

Bojan Basic Absorption in (n-ary) semigroups 11/ 13

Page 56: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

(3) abbab ∈ B, babba ∈ B for any a ∈ A, b ∈ B

a′ = abbabt(a′bb, b, b, . . . , b) ∈ Ba′ba′ = (abbab)b(abbab) = (abb)3ab ≈ abbab = a′

t ≈ (a′bb)l ≈ a′bb or t ≈ (a′bb)la′b ≈ a′bba′ba′bb = (abbab)bb = abbab3 ≈ abbaba′bba′b = abbab3abbabb ≈ abbababbabb(abb)ab(abb)2 = abbababbabb ∈ B ⇒ abbab ∈ B

Bojan Basic Absorption in (n-ary) semigroups 11/ 13

Page 57: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

(3) abbab ∈ B, babba ∈ B for any a ∈ A, b ∈ B

a′ = abbab

t(a′bb, b, b, . . . , b) ∈ Ba′ba′ = (abbab)b(abbab) = (abb)3ab ≈ abbab = a′

t ≈ (a′bb)l ≈ a′bb or t ≈ (a′bb)la′b ≈ a′bba′ba′bb = (abbab)bb = abbab3 ≈ abbaba′bba′b = abbab3abbabb ≈ abbababbabb(abb)ab(abb)2 = abbababbabb ∈ B ⇒ abbab ∈ B

Bojan Basic Absorption in (n-ary) semigroups 11/ 13

Page 58: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

(3) abbab ∈ B, babba ∈ B for any a ∈ A, b ∈ B

a′ = abbabt(a′bb, b, b, . . . , b) ∈ B

a′ba′ = (abbab)b(abbab) = (abb)3ab ≈ abbab = a′

t ≈ (a′bb)l ≈ a′bb or t ≈ (a′bb)la′b ≈ a′bba′ba′bb = (abbab)bb = abbab3 ≈ abbaba′bba′b = abbab3abbabb ≈ abbababbabb(abb)ab(abb)2 = abbababbabb ∈ B ⇒ abbab ∈ B

Bojan Basic Absorption in (n-ary) semigroups 11/ 13

Page 59: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

(3) abbab ∈ B, babba ∈ B for any a ∈ A, b ∈ B

a′ = abbabt(a′bb, b, b, . . . , b) ∈ Ba′ba′ = (abbab)b(abbab) = (abb)3ab ≈ abbab = a′

t ≈ (a′bb)l ≈ a′bb or t ≈ (a′bb)la′b ≈ a′bba′ba′bb = (abbab)bb = abbab3 ≈ abbaba′bba′b = abbab3abbabb ≈ abbababbabb(abb)ab(abb)2 = abbababbabb ∈ B ⇒ abbab ∈ B

Bojan Basic Absorption in (n-ary) semigroups 11/ 13

Page 60: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

(3) abbab ∈ B, babba ∈ B for any a ∈ A, b ∈ B

a′ = abbabt(a′bb, b, b, . . . , b) ∈ Ba′ba′ = (abbab)b(abbab) = (abb)3ab ≈ abbab = a′

t ≈ (a′bb)l ≈ a′bb or t ≈ (a′bb)la′b ≈ a′bba′b

a′bb = (abbab)bb = abbab3 ≈ abbaba′bba′b = abbab3abbabb ≈ abbababbabb(abb)ab(abb)2 = abbababbabb ∈ B ⇒ abbab ∈ B

Bojan Basic Absorption in (n-ary) semigroups 11/ 13

Page 61: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

(3) abbab ∈ B, babba ∈ B for any a ∈ A, b ∈ B

a′ = abbabt(a′bb, b, b, . . . , b) ∈ Ba′ba′ = (abbab)b(abbab) = (abb)3ab ≈ abbab = a′

t ≈ (a′bb)l ≈ a′bb or t ≈ (a′bb)la′b ≈ a′bba′ba′bb = (abbab)bb = abbab3 ≈ abbab

a′bba′b = abbab3abbabb ≈ abbababbabb(abb)ab(abb)2 = abbababbabb ∈ B ⇒ abbab ∈ B

Bojan Basic Absorption in (n-ary) semigroups 11/ 13

Page 62: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

(3) abbab ∈ B, babba ∈ B for any a ∈ A, b ∈ B

a′ = abbabt(a′bb, b, b, . . . , b) ∈ Ba′ba′ = (abbab)b(abbab) = (abb)3ab ≈ abbab = a′

t ≈ (a′bb)l ≈ a′bb or t ≈ (a′bb)la′b ≈ a′bba′ba′bb = (abbab)bb = abbab3 ≈ abbaba′bba′b = abbab3abbabb ≈ abbababbabb

(abb)ab(abb)2 = abbababbabb ∈ B ⇒ abbab ∈ B

Bojan Basic Absorption in (n-ary) semigroups 11/ 13

Page 63: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

(3) abbab ∈ B, babba ∈ B for any a ∈ A, b ∈ B

a′ = abbabt(a′bb, b, b, . . . , b) ∈ Ba′ba′ = (abbab)b(abbab) = (abb)3ab ≈ abbab = a′

t ≈ (a′bb)l ≈ a′bb or t ≈ (a′bb)la′b ≈ a′bba′ba′bb = (abbab)bb = abbab3 ≈ abbaba′bba′b = abbab3abbabb ≈ abbababbabb(abb)ab(abb)2 = abbababbabb ∈ B ⇒ abbab ∈ B

Bojan Basic Absorption in (n-ary) semigroups 11/ 13

Page 64: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

(4) aab ∈ B, baa ∈ B, aabaa ∈ B for any a ∈ A, b ∈ B

(5) whenever t ′(x , y) is a term such that t ′(a, b) ∈ B for alla ∈ A, b ∈ B, then b(ab)l ∈ B, where l is the absolute valueof the difference of the number of occurrences of the letter aat the odd, respectively even positions in the word t ′(a, b)

(6) whenever b(ab)l ∈ B for an integer l > 1 and some a ∈ A,b ∈ B, then (ab)l−1a ∈ B

(7) ∃l such that b(ab)l ∈ B and b(ab)l+1 ∈ B for any a ∈ A,b ∈ B

(8) bab ∈ B for any a ∈ A, b ∈ B

(9) ab2 ∈ B, b2a ∈ B for any a ∈ A, b ∈ B

Bojan Basic Absorption in (n-ary) semigroups 12/ 13

Page 65: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

(4) aab ∈ B, baa ∈ B, aabaa ∈ B for any a ∈ A, b ∈ B

(5) whenever t ′(x , y) is a term such that t ′(a, b) ∈ B for alla ∈ A, b ∈ B, then b(ab)l ∈ B, where l is the absolute valueof the difference of the number of occurrences of the letter aat the odd, respectively even positions in the word t ′(a, b)

(6) whenever b(ab)l ∈ B for an integer l > 1 and some a ∈ A,b ∈ B, then (ab)l−1a ∈ B

(7) ∃l such that b(ab)l ∈ B and b(ab)l+1 ∈ B for any a ∈ A,b ∈ B

(8) bab ∈ B for any a ∈ A, b ∈ B

(9) ab2 ∈ B, b2a ∈ B for any a ∈ A, b ∈ B

Bojan Basic Absorption in (n-ary) semigroups 12/ 13

Page 66: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

(4) aab ∈ B, baa ∈ B, aabaa ∈ B for any a ∈ A, b ∈ B

(5) whenever t ′(x , y) is a term such that t ′(a, b) ∈ B for alla ∈ A, b ∈ B, then b(ab)l ∈ B, where l is the absolute valueof the difference of the number of occurrences of the letter aat the odd, respectively even positions in the word t ′(a, b)

(6) whenever b(ab)l ∈ B for an integer l > 1 and some a ∈ A,b ∈ B, then (ab)l−1a ∈ B

(7) ∃l such that b(ab)l ∈ B and b(ab)l+1 ∈ B for any a ∈ A,b ∈ B

(8) bab ∈ B for any a ∈ A, b ∈ B

(9) ab2 ∈ B, b2a ∈ B for any a ∈ A, b ∈ B

Bojan Basic Absorption in (n-ary) semigroups 12/ 13

Page 67: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

(4) aab ∈ B, baa ∈ B, aabaa ∈ B for any a ∈ A, b ∈ B

(5) whenever t ′(x , y) is a term such that t ′(a, b) ∈ B for alla ∈ A, b ∈ B, then b(ab)l ∈ B, where l is the absolute valueof the difference of the number of occurrences of the letter aat the odd, respectively even positions in the word t ′(a, b)

(6) whenever b(ab)l ∈ B for an integer l > 1 and some a ∈ A,b ∈ B, then (ab)l−1a ∈ B

(7) ∃l such that b(ab)l ∈ B and b(ab)l+1 ∈ B for any a ∈ A,b ∈ B

(8) bab ∈ B for any a ∈ A, b ∈ B

(9) ab2 ∈ B, b2a ∈ B for any a ∈ A, b ∈ B

Bojan Basic Absorption in (n-ary) semigroups 12/ 13

Page 68: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

(4) aab ∈ B, baa ∈ B, aabaa ∈ B for any a ∈ A, b ∈ B

(5) whenever t ′(x , y) is a term such that t ′(a, b) ∈ B for alla ∈ A, b ∈ B, then b(ab)l ∈ B, where l is the absolute valueof the difference of the number of occurrences of the letter aat the odd, respectively even positions in the word t ′(a, b)

(6) whenever b(ab)l ∈ B for an integer l > 1 and some a ∈ A,b ∈ B, then (ab)l−1a ∈ B

(7) ∃l such that b(ab)l ∈ B and b(ab)l+1 ∈ B for any a ∈ A,b ∈ B

(8) bab ∈ B for any a ∈ A, b ∈ B

(9) ab2 ∈ B, b2a ∈ B for any a ∈ A, b ∈ B

Bojan Basic Absorption in (n-ary) semigroups 12/ 13

Page 69: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

(4) aab ∈ B, baa ∈ B, aabaa ∈ B for any a ∈ A, b ∈ B

(5) whenever t ′(x , y) is a term such that t ′(a, b) ∈ B for alla ∈ A, b ∈ B, then b(ab)l ∈ B, where l is the absolute valueof the difference of the number of occurrences of the letter aat the odd, respectively even positions in the word t ′(a, b)

(6) whenever b(ab)l ∈ B for an integer l > 1 and some a ∈ A,b ∈ B, then (ab)l−1a ∈ B

(7) ∃l such that b(ab)l ∈ B and b(ab)l+1 ∈ B for any a ∈ A,b ∈ B

(8) bab ∈ B for any a ∈ A, b ∈ B

(9) ab2 ∈ B, b2a ∈ B for any a ∈ A, b ∈ B

Bojan Basic Absorption in (n-ary) semigroups 12/ 13

Page 70: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotent ternary semigroups

(4) aab ∈ B, baa ∈ B, aabaa ∈ B for any a ∈ A, b ∈ B

(5) whenever t ′(x , y) is a term such that t ′(a, b) ∈ B for alla ∈ A, b ∈ B, then b(ab)l ∈ B, where l is the absolute valueof the difference of the number of occurrences of the letter aat the odd, respectively even positions in the word t ′(a, b)

(6) whenever b(ab)l ∈ B for an integer l > 1 and some a ∈ A,b ∈ B, then (ab)l−1a ∈ B

(7) ∃l such that b(ab)l ∈ B and b(ab)l+1 ∈ B for any a ∈ A,b ∈ B

(8) bab ∈ B for any a ∈ A, b ∈ B

(9) ab2 ∈ B, b2a ∈ B for any a ∈ A, b ∈ B

Bojan Basic Absorption in (n-ary) semigroups 12/ 13

Page 71: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotence is not a real restriction

Theorem

Assume that the conjecture holds for all idempotent n-arysemigroups. Then the conjecture holds in general.

Bojan Basic Absorption in (n-ary) semigroups 13/ 13

Page 72: Absorption in semigroups and n-ary semigroups · example, Bulatov’s dichotomy theorem for conservative CSPs, with a deep and complicated proof (nearly 70 pages long), was reproved

Idempotence is not a real restriction

Theorem

Assume that the conjecture holds for all idempotent n-arysemigroups. Then the conjecture holds in general.

Bojan Basic Absorption in (n-ary) semigroups 13/ 13