Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that...
Transcript of Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that...
![Page 1: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/1.jpg)
Infinity: Relevant or Irrelevant?
Kristina Asimi
Department of Algebra, Charles University, Prague
AAA99, Siena, 22 Feb 2019
CoCoSym: Symmetry in Computational Complexity
This project has received funding from the European Research Council(ERC) under the European Union’s Horizon 2020 research andinnovation programme (grant agreement No 771005)
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 1 / 12
![Page 2: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/2.jpg)
CSP - Constraint Satisfaction Problem
E = (E;S1, S2, . . . , Sn)
D = (D;R1, R2, . . . , Rn)
}similar relational structures
h : E → D is a homomorphism from E to D if(a1, a2, . . . , ak) ∈ Si ⇒ (h(a1), h(a2), . . . , h(ak)) ∈ Ri
CSP(D)Search: Given E find E → D.
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 2 / 12
![Page 3: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/3.jpg)
CSP - Constraint Satisfaction Problem
E = (E;S1, S2, . . . , Sn)
D = (D;R1, R2, . . . , Rn)
}similar relational structures
h : E → D is a homomorphism from E to D if(a1, a2, . . . , ak) ∈ Si ⇒ (h(a1), h(a2), . . . , h(ak)) ∈ Ri
CSP(D)Search: Given E find E → D.
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 2 / 12
![Page 4: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/4.jpg)
CSP - Constraint Satisfaction Problem
E = (E;S1, S2, . . . , Sn)
D = (D;R1, R2, . . . , Rn)
}similar relational structures
h : E → D is a homomorphism from E to D if(a1, a2, . . . , ak) ∈ Si ⇒ (h(a1), h(a2), . . . , h(ak)) ∈ Ri
CSP(D)Search: Given E find E → D.
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 2 / 12
![Page 5: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/5.jpg)
Examples:1-in-3-SAT (NP-complete)1-in-3 = ({0, 1}; {(1, 0, 0), (0, 1, 0), (0, 0, 1)})NAE-3-SAT (NP-complete)NAE-3 = ({0, 1}; {0, 1}3\{(0, 0, 0), (1, 1, 1)})
Theorem ([Bulatov ’17];[Zhuk ’17])CSP(A), A - finite, is in P or NP -complete
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 3 / 12
![Page 6: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/6.jpg)
Examples:1-in-3-SAT (NP-complete)1-in-3 = ({0, 1}; {(1, 0, 0), (0, 1, 0), (0, 0, 1)})NAE-3-SAT (NP-complete)NAE-3 = ({0, 1}; {0, 1}3\{(0, 0, 0), (1, 1, 1)})
Theorem ([Bulatov ’17];[Zhuk ’17])CSP(A), A - finite, is in P or NP -complete
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 3 / 12
![Page 7: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/7.jpg)
Examples:1-in-3-SAT (NP-complete)1-in-3 = ({0, 1}; {(1, 0, 0), (0, 1, 0), (0, 0, 1)})NAE-3-SAT (NP-complete)NAE-3 = ({0, 1}; {0, 1}3\{(0, 0, 0), (1, 1, 1)})
Theorem ([Bulatov ’17];[Zhuk ’17])CSP(A), A - finite, is in P or NP -complete
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 3 / 12
![Page 8: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/8.jpg)
PCSP (Promise CSP)
PCSP(A,B)
A,B - relational structures, A → BSearch: Given X such that X → A find X → B.PCSP(A,A) = CSP(A)
examples:PCSP(1-in-3,NAE-3) (P)5-coloring of a 3-colorable graph (NP-complete)6-coloring of a 3-colorable graph
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 4 / 12
![Page 9: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/9.jpg)
PCSP (Promise CSP)
PCSP(A,B)
A,B - relational structures, A → BSearch: Given X such that X → A find X → B.PCSP(A,A) = CSP(A)
examples:PCSP(1-in-3,NAE-3) (P)5-coloring of a 3-colorable graph (NP-complete)6-coloring of a 3-colorable graph
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 4 / 12
![Page 10: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/10.jpg)
PCSP (Promise CSP)
PCSP(A,B)
A,B - relational structures, A → BSearch: Given X such that X → A find X → B.PCSP(A,A) = CSP(A)
examples:PCSP(1-in-3,NAE-3) (P)5-coloring of a 3-colorable graph (NP-complete)6-coloring of a 3-colorable graph
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 4 / 12
![Page 11: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/11.jpg)
PCSP (Promise CSP)
PCSP(A,B)
A,B - relational structures, A → BSearch: Given X such that X → A find X → B.PCSP(A,A) = CSP(A)
examples:PCSP(1-in-3,NAE-3) (P)5-coloring of a 3-colorable graph (NP-complete)6-coloring of a 3-colorable graph
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 4 / 12
![Page 12: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/12.jpg)
PCSP (Promise CSP)
PCSP(A,B)
A,B - relational structures, A → BSearch: Given X such that X → A find X → B.PCSP(A,A) = CSP(A)
examples:PCSP(1-in-3,NAE-3) (P)5-coloring of a 3-colorable graph (NP-complete)6-coloring of a 3-colorable graph
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 4 / 12
![Page 13: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/13.jpg)
PCSP dichotomy?
Dichotomy for PCSP?Yes for symmetric Boolean PCSPs (allowing negations)allows negations:A = ({0, 1}; 6=, . . . )B = ({0, 1}; 6=, . . . )where 6= = {(0, 1), (1, 0)}
Theorem (Brakensiek, Guruswami ’17)Symmetric Boolean PCSP that allows negations is in P or NP-hard.
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 5 / 12
![Page 14: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/14.jpg)
PCSP dichotomy?
Dichotomy for PCSP?Yes for symmetric Boolean PCSPs (allowing negations)allows negations:A = ({0, 1}; 6=, . . . )B = ({0, 1}; 6=, . . . )where 6= = {(0, 1), (1, 0)}
Theorem (Brakensiek, Guruswami ’17)Symmetric Boolean PCSP that allows negations is in P or NP-hard.
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 5 / 12
![Page 15: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/15.jpg)
PCSP dichotomy?
Dichotomy for PCSP?Yes for symmetric Boolean PCSPs (allowing negations)allows negations:A = ({0, 1}; 6=, . . . )B = ({0, 1}; 6=, . . . )where 6= = {(0, 1), (1, 0)}
Theorem (Brakensiek, Guruswami ’17)Symmetric Boolean PCSP that allows negations is in P or NP-hard.
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 5 / 12
![Page 16: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/16.jpg)
PCSP dichotomy?
Dichotomy for PCSP?Yes for symmetric Boolean PCSPs (allowing negations)allows negations:A = ({0, 1}; 6=, . . . )B = ({0, 1}; 6=, . . . )where 6= = {(0, 1), (1, 0)}
Theorem (Brakensiek, Guruswami ’17)Symmetric Boolean PCSP that allows negations is in P or NP-hard.
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 5 / 12
![Page 17: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/17.jpg)
Classification
j-in-k = {(x1, x2, . . . , xk) : Σxi = j}NAE-k = {0, 1}k\{(0, 0, . . . , 0), (1, 1, . . . , 1)}
Theorem (Brakensiek, Guruswami ’17)If (P,Q) =a) (•, •)b) (•, •)c) (j-in-k,NAE-k)then PCSP(({0, 1};P, 6=), ({0, 1};Q, 6=)) is tractable.
All tractable cases: relaxations and modifications of the cases above
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 6 / 12
![Page 18: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/18.jpg)
Classification
j-in-k = {(x1, x2, . . . , xk) : Σxi = j}NAE-k = {0, 1}k\{(0, 0, . . . , 0), (1, 1, . . . , 1)}
Theorem (Brakensiek, Guruswami ’17)If (P,Q) =a) (•, •)b) (•, •)c) (j-in-k,NAE-k)then PCSP(({0, 1};P, 6=), ({0, 1};Q, 6=)) is tractable.
All tractable cases: relaxations and modifications of the cases above
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 6 / 12
![Page 19: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/19.jpg)
Classification
j-in-k = {(x1, x2, . . . , xk) : Σxi = j}NAE-k = {0, 1}k\{(0, 0, . . . , 0), (1, 1, . . . , 1)}
Theorem (Brakensiek, Guruswami ’17)If (P,Q) =a) (•, •)b) (•, •)c) (j-in-k,NAE-k)then PCSP(({0, 1};P, 6=), ({0, 1};Q, 6=)) is tractable.
All tractable cases: relaxations and modifications of the cases above
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 6 / 12
![Page 20: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/20.jpg)
PCSP(1-in-3,NAE-3)
If A → C → B, thenCSP(C) is in P⇒ PCSP(A,B) is in P(A,B) = (1-in-3,NAE-3)
∃ such a C infinitenecessarily so [Barto]
If C has to be infinite, we say that the PCSP is infinitary.
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 7 / 12
![Page 21: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/21.jpg)
PCSP(1-in-3,NAE-3)
If A → C → B, thenCSP(C) is in P⇒ PCSP(A,B) is in P(A,B) = (1-in-3,NAE-3)
∃ such a C infinitenecessarily so [Barto]
If C has to be infinite, we say that the PCSP is infinitary.
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 7 / 12
![Page 22: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/22.jpg)
Infinity is relevant
c) (j-in-k,NAE-k)
j - odd, k - odd: infinitaryj - even, k - even, j 6= k
2 : infinitaryj - odd, k - even: reducible to finite CSP
j - even, k - odd: probably infinitary(j = 2, k = 5: infinitary)
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 8 / 12
![Page 23: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/23.jpg)
Preliminaries
DefinitionLet C be a CSP template. c : Cn → C is a polymorphism of C if foreach relation R in Ca11...
am1
∈ R, . . . ,
a1n...amn
∈ R⇒
c(a11, . . . , a1n)...
c(am1, . . . , amn)
∈ R.
Definitionc : Cn → C is cyclic if
c(a1, a2, . . . , an) = c(a2, . . . , an, a1)
Theorem (Barto, Kozik ’12)Let C be a finite CSP template. If CSP(C) is not NP-complete, then Chas a cyclic polymorphism of arity p for every prime number p > |C|.
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 9 / 12
![Page 24: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/24.jpg)
Preliminaries
DefinitionLet C be a CSP template. c : Cn → C is a polymorphism of C if foreach relation R in Ca11...
am1
∈ R, . . . ,
a1n...amn
∈ R⇒
c(a11, . . . , a1n)...
c(am1, . . . , amn)
∈ R.
Definitionc : Cn → C is cyclic if
c(a1, a2, . . . , an) = c(a2, . . . , an, a1)
Theorem (Barto, Kozik ’12)Let C be a finite CSP template. If CSP(C) is not NP-complete, then Chas a cyclic polymorphism of arity p for every prime number p > |C|.
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 9 / 12
![Page 25: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/25.jpg)
Preliminaries
DefinitionLet C be a CSP template. c : Cn → C is a polymorphism of C if foreach relation R in Ca11...
am1
∈ R, . . . ,
a1n...amn
∈ R⇒
c(a11, . . . , a1n)...
c(am1, . . . , amn)
∈ R.
Definitionc : Cn → C is cyclic if
c(a1, a2, . . . , an) = c(a2, . . . , an, a1)
Theorem (Barto, Kozik ’12)Let C be a finite CSP template. If CSP(C) is not NP-complete, then Chas a cyclic polymorphism of arity p for every prime number p > |C|.
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 9 / 12
![Page 26: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/26.jpg)
PCSP(2-in-5,NAE-5) that allows negations is infinitary
TheoremLet C = (C;R,N) be a finite relational structure such that({0, 1}; 2-in-5, 6=)→ C → ({0, 1}; NAE-5, 6=). Then CSP(C) isNP-complete.
assume CSP(C) is not NP-completef : ({0, 1}; 2-in-5, 6=)→ Cg : C → ({0, 1}; NAE-5, 6=)
gf is a homomorphismgf(1, 1, 0, 0, 0) ∈ NAE-5, gf(0, 1) ∈ 6=f(0) 6= f(1)We rename the elements of C so that {0, 1} ⊆ C and f is theinclusion2-in-5 ⊆ R; (a, b, c, d, e) ∈ R⇒ (g(a), g(b), g(c), g(d), g(e)) ∈ NAE-56= ⊆ N ; (a, b) ∈ N ⇒ (g(a), g(b)) ∈ 6=
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 10 / 12
![Page 27: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/27.jpg)
PCSP(2-in-5,NAE-5) that allows negations is infinitary
TheoremLet C = (C;R,N) be a finite relational structure such that({0, 1}; 2-in-5, 6=)→ C → ({0, 1}; NAE-5, 6=). Then CSP(C) isNP-complete.
assume CSP(C) is not NP-completef : ({0, 1}; 2-in-5, 6=)→ Cg : C → ({0, 1}; NAE-5, 6=)
gf is a homomorphismgf(1, 1, 0, 0, 0) ∈ NAE-5, gf(0, 1) ∈ 6=f(0) 6= f(1)We rename the elements of C so that {0, 1} ⊆ C and f is theinclusion2-in-5 ⊆ R; (a, b, c, d, e) ∈ R⇒ (g(a), g(b), g(c), g(d), g(e)) ∈ NAE-56= ⊆ N ; (a, b) ∈ N ⇒ (g(a), g(b)) ∈ 6=
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 10 / 12
![Page 28: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/28.jpg)
C has a cyclic polymorphism of arity p for every prime numberp > |C|For every cyclic polymorphism cg(c0) = g(c1) = · · · = g(c⌊ 2
5n⌋) 6= g(c⌊ 2
5n⌋+1
) = · · · = g(cn),
where n = 5l + 1 ≥ 11 is the arity of c and cm = c(1, . . . , 1︸ ︷︷ ︸m
, 0, . . . , 0)
But there exist i, j ∈ {⌊25n⌋
+ 1, . . . , n}, i 6= j, such that i + j = n.Since c is polymorphism, g(ci) 6= g(cj)
Contradiction!
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 11 / 12
![Page 29: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/29.jpg)
C has a cyclic polymorphism of arity p for every prime numberp > |C|For every cyclic polymorphism cg(c0) = g(c1) = · · · = g(c⌊ 2
5n⌋) 6= g(c⌊ 2
5n⌋+1
) = · · · = g(cn),
where n = 5l + 1 ≥ 11 is the arity of c and cm = c(1, . . . , 1︸ ︷︷ ︸m
, 0, . . . , 0)
But there exist i, j ∈ {⌊25n⌋
+ 1, . . . , n}, i 6= j, such that i + j = n.Since c is polymorphism, g(ci) 6= g(cj)
Contradiction!
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 11 / 12
![Page 30: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/30.jpg)
C has a cyclic polymorphism of arity p for every prime numberp > |C|For every cyclic polymorphism cg(c0) = g(c1) = · · · = g(c⌊ 2
5n⌋) 6= g(c⌊ 2
5n⌋+1
) = · · · = g(cn),
where n = 5l + 1 ≥ 11 is the arity of c and cm = c(1, . . . , 1︸ ︷︷ ︸m
, 0, . . . , 0)
But there exist i, j ∈ {⌊25n⌋
+ 1, . . . , n}, i 6= j, such that i + j = n.Since c is polymorphism, g(ci) 6= g(cj)
Contradiction!
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 11 / 12
![Page 31: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/31.jpg)
C has a cyclic polymorphism of arity p for every prime numberp > |C|For every cyclic polymorphism cg(c0) = g(c1) = · · · = g(c⌊ 2
5n⌋) 6= g(c⌊ 2
5n⌋+1
) = · · · = g(cn),
where n = 5l + 1 ≥ 11 is the arity of c and cm = c(1, . . . , 1︸ ︷︷ ︸m
, 0, . . . , 0)
But there exist i, j ∈ {⌊25n⌋
+ 1, . . . , n}, i 6= j, such that i + j = n.Since c is polymorphism, g(ci) 6= g(cj)
Contradiction!
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 11 / 12
![Page 32: Infinity: Relevant or Irrelevant?barto/Articles/2020_Asimi_AAA99.pdf · Search: Given Xsuch that X!Afind X!B. PCSP(A;A) = CSP(A) examples: PCSP(1-in-3;NAE-3) (P) 5-coloring of a](https://reader034.fdocuments.us/reader034/viewer/2022042219/5ec573fc75aebe15262d3ff6/html5/thumbnails/32.jpg)
Thanks for your attention!
Kristina Asimi (MFF) Infinity: Relevant or Irrelevant? AAA99, Siena, 22 Feb 2019 12 / 12