Old roots in new equations Christian Marboe Based on [1608.06504] - - PowerPoint PPT Presentation

old roots in new equations
SMART_READER_LITE
LIVE PREVIEW

Old roots in new equations Christian Marboe Based on [1608.06504] - - PowerPoint PPT Presentation

Old roots in new equations Christian Marboe Based on [1608.06504] + [1701.03704] + [17.] with Dmytro Volin [1706.02320] with Rouven Frassek, David Meidinger IGST 2017 1 / 32 The perturbative spectral problem in planar N = 4 SYM D O =


slide-1
SLIDE 1

Old roots in new equations

Christian Marboe

Based on [1608.06504] + [1701.03704] + [17–.—] with Dmytro Volin [1706.02320] with Rouven Frassek, David Meidinger

IGST 2017

1 / 32

slide-2
SLIDE 2

The perturbative spectral problem in planar N = 4 SYM

ˆ D O = ∆ O

2 / 32

slide-3
SLIDE 3

The perturbative spectral problem in planar N = 4 SYM

ˆ D O = ∆ O O(x) = Tr[DZXΨ...] + ...

2 / 32

slide-4
SLIDE 4

The perturbative spectral problem in planar N = 4 SYM

ˆ D O = ∆ O O(x) = Tr[DZXΨ...] + ... ∆ = ∆0 + g 2γ1 + g 4γ2 + . . .

2 / 32

slide-5
SLIDE 5

IGST (spectral problem) highlights

3 / 32

slide-6
SLIDE 6

IGST (spectral problem) highlights

IGST05 Asymptotic Bethe Ansatz [Beisert, Staudacher]

  • x+

j

x−

j

L = x−

j

− x+

k

x+

j − x− k

1 −

g2 x+

j x− k

1 −

g2 x−

j x+ k

e2 i θ(uj ,uk ) 1 x + x = u g

3 / 32

slide-7
SLIDE 7

IGST (spectral problem) highlights

IGST05 Asymptotic Bethe Ansatz [Beisert, Staudacher]

  • x+

j

x−

j

L = x−

j

− x+

k

x+

j − x− k

1 −

g2 x+

j x− k

1 −

g2 x−

j x+ k

e2 i θ(uj ,uk ) 1 x + x = u g

IGST09 Thermodynamic Bethe Ansatz

    Ambjørn, Janik, Kristjansen Arutyunov, Frolov Gromov, Kazakov, Vieira, Kozak Bombardelli, Fioravanti, Tateo    

log (Y a,s(u)) =

  • dv K a′,s′

a,s

(u, v) log(1 + Y a′,s′(v))

3 / 32

slide-8
SLIDE 8

IGST (spectral problem) highlights

IGST05 Asymptotic Bethe Ansatz [Beisert, Staudacher]

  • x+

j

x−

j

L = x−

j

− x+

k

x+

j − x− k

1 −

g2 x+

j x− k

1 −

g2 x−

j x+ k

e2 i θ(uj ,uk ) 1 x + x = u g

IGST09 Thermodynamic Bethe Ansatz

    Ambjørn, Janik, Kristjansen Arutyunov, Frolov Gromov, Kazakov, Vieira, Kozak Bombardelli, Fioravanti, Tateo    

log (Y a,s(u)) =

  • dv K a′,s′

a,s

(u, v) log(1 + Y a′,s′(v))

IGST13 Quantum Spectral Curve [Gromov, Kazakov, Leurent, Volin]

QQ = Q−Q+ − Q+Q−, ˜ Q(u) = Q(u⋆)

3 / 32

slide-9
SLIDE 9

Automatising the perturbative solution

Tr[D4Z2XΨ]

12g2 − 48g4 + 336g6 +g8 − 2496 + 576 ζ3 −1440 ζ5

  • + g10

15168 +6912 ζ3 − 5184 ζ2

3

−8640 ζ5 + 30240 ζ7

  • + ...

→ →

  • 4 / 32
slide-10
SLIDE 10

Automatising the perturbative solution

Tr[D4Z2XΨ]

12g2 − 48g4 + 336g6 +g8 − 2496 + 576 ζ3 −1440 ζ5

  • + g10

15168 +6912 ζ3 − 5184 ζ2

3

−8640 ζ5 + 30240 ζ7

  • + ...

→ →

  • 4 / 32
slide-11
SLIDE 11

Automatising the perturbative solution

Tr[D4Z2XΨ]

12g2 − 48g4 + 336g6 +g8 − 2496 + 576 ζ3 −1440 ζ5

  • + g10

15168 +6912 ζ3 − 5184 ζ2

3

−8640 ζ5 + 30240 ζ7

  • + ...

→ →

  • 4 / 32
slide-12
SLIDE 12

Automatising the perturbative solution

Tr[D4Z2XΨ]

12g2 − 48g4 + 336g6 +g8 − 2496 + 576 ζ3 −1440 ζ5

  • + g10

15168 +6912 ζ3 − 5184 ζ2

3

−8640 ζ5 + 30240 ζ7

  • + ...

→ →

  • 4 / 32
slide-13
SLIDE 13

Automatising the perturbative solution

Tr[D4Z2XΨ]

12g2 − 48g4 + 336g6 +g8 − 2496 + 576 ζ3 −1440 ζ5

  • + g10

15168 +6912 ζ3 − 5184 ζ2

3

−8640 ζ5 + 30240 ζ7

  • + ...

→ →

  • 1. Fuel

Representation theory

4 / 32

slide-14
SLIDE 14

Automatising the perturbative solution

12g2 − 48g4 + 336g6 +g8 − 2496 + 576 ζ3 −1440 ζ5

  • + g10

15168 +6912 ζ3 − 5184 ζ2

3

−8640 ζ5 + 30240 ζ7

  • + ...

→ →

  • 1. Fuel

Representation theory

4 / 32

slide-15
SLIDE 15

Automatising the perturbative solution

12g2 − 48g4 + 336g6 +g8 − 2496 + 576 ζ3 −1440 ζ5

  • + g10

15168 +6912 ζ3 − 5184 ζ2

3

−8640 ζ5 + 30240 ζ7

  • + ...

→ →

  • 1. Fuel

Representation theory

  • 2. Kick-start

Finding Bethe roots

4 / 32

slide-16
SLIDE 16

Automatising the perturbative solution

12g2 − 48g4 + 336g6 +g8 − 2496 + 576 ζ3 −1440 ζ5

  • + g10

15168 +6912 ζ3 − 5184 ζ2

3

−8640 ζ5 + 30240 ζ7

  • + ...

→ →

  • 1. Fuel

Representation theory

  • 2. Kick-start

Finding Bethe roots

✫✪ ✬✩

4 / 32

slide-17
SLIDE 17

Automatising the perturbative solution

12g2 − 48g4 + 336g6 +g8 − 2496 + 576 ζ3 −1440 ζ5

  • + g10

15168 +6912 ζ3 − 5184 ζ2

3

−8640 ζ5 + 30240 ζ7

  • + ...

→ →

  • 1. Fuel

Representation theory

  • 2. Kick-start

Finding Bethe roots

4 / 32

slide-18
SLIDE 18

Automatising the perturbative solution

12g2 − 48g4 + 336g6 +g8 − 2496 + 576 ζ3 −1440 ζ5

  • + g10

15168 +6912 ζ3 − 5184 ζ2

3

−8640 ζ5 + 30240 ζ7

  • + ...

→ →

  • 1. Fuel

Representation theory

  • 2. Kick-start

Finding Bethe roots

  • 3. Engine

Quantum Spectral Curve

4 / 32

slide-19
SLIDE 19

Representation theory

What to put into the machine

5 / 32

slide-20
SLIDE 20

u(N, M|K) and Jordan-Schwinger oscillators

b1, ..., bN a1, ..., aM f1, ..., fK [ai, a†

j ] = [bi, b† j ] = {fi, f† j } = δij

Emn =     −b ˙

αb† ˙ β

−b ˙

αaβ

−b ˙

αfj

a†

αb† ˙ β

a†

αaβ

a†

αfj

f†

i b† ˙ β

f†

i aβ

f†

i fj

    C =

  • n

Enn = −N − nb + na + nf

6 / 32

slide-21
SLIDE 21

Example: u(1|2)

a1 f1 f2 Emn =    a†

1a1

a†

1f1

a†

1f2

f†

1a1

f†

1f1

f†

1f2

f†

2a1

f†

2f1

f†

2f2

   C =

  • n

Enn = na1 + nf1 + nf2

7 / 32

slide-22
SLIDE 22

Example: u(1|2)

Emn =    a†

1a1

a†

1f1

a†

1f2

f†

1a1

f†

1f1

f†

1f2

f†

2a1

f†

2f1

f†

2f2

   C = na1 + nf1 + nf2 = 1

7 / 32

slide-23
SLIDE 23

Example: u(1|2)

Emn =    a†

1a1

a†

1f1

a†

1f2

f†

1a1

f†

1f1

f†

1f2

f†

2a1

f†

2f1

f†

2f2

   C = na1 + nf1 + nf2 = 1 Fock vacuum: a|0 = f|0 = 0

7 / 32

slide-24
SLIDE 24

Example: u(1|2)

Emn =    a†

1a1

a†

1f1

a†

1f2

f†

1a1

f†

1f1

f†

1f2

f†

2a1

f†

2f1

f†

2f2

   C = na1 + nf1 + nf2 = 1 Fock vacuum: a|0 = f|0 = 0 States: f†

1|0 ≡ Z

f†

2|0 ≡ X

a†

1|0 ≡ Ψ

7 / 32

slide-25
SLIDE 25

Example: u(1|2)

Emn =    a†

1a1

a†

1f1

a†

1f2

f†

1a1

f†

1f1

f†

1f2

f†

2a1

f†

2f1

f†

2f2

   C = na1 + nf1 + nf2 = 1 Fock vacuum: a|0 = f|0 = 0 States: f†

1|0 ≡ Z

f†

2|0 ≡ X

a†

1|0 ≡ Ψ

HWS: Emn|0 = 0, m < n

7 / 32

slide-26
SLIDE 26

Example: u(1|2)

Emn =     a†

1a1

a†

1f1

a†

1f2

f†

1a1

f†

1f1

f†

1f2

f†

2a1

f†

2f1

f†

2f2

    C = na1 + nf1 + nf2 = 1 Fock vacuum: a|0 = f|0 = 0 States: f†

1|0 ≡ Z

f†

2|0 ≡ X

a†

1|0 ≡ Ψ

HWS: Emn|0 = 0, m < n

✈ ✈ ❢ ❢

×

7 / 32

slide-27
SLIDE 27

Example: u(1|2)

Emn =     f†

1f1

f†

1a1

f†

1f2

a†

1f1

a†

1a1

a†

1f2

f†

2f1

f†

2a1

f†

2f2

    C = na1 + nf1 + nf2 = 1 Fock vacuum: a|0 = f|0 = 0 States: f†

1|0 ≡ Z

f†

2|0 ≡ X

a†

1|0 ≡ Ψ

HWS: Emn|0 = 0, m < n

✈ ✈ ❢ ❢

× ×

7 / 32

slide-28
SLIDE 28

Example: u(1|2)

Emn =     f†

1f1

f†

1f2

f†

1a1

f†

2f1

f†

2f2

f†

2a1

a†

1f1

a†

1f2

a†

1a1

    C = na1 + nf1 + nf2 = 1 Fock vacuum: a|0 = f|0 = 0 States: f†

1|0 ≡ Z

f†

2|0 ≡ X

a†

1|0 ≡ Ψ

HWS: Emn|0 = 0, m < n

✈ ✈ ❢ ❢

×

7 / 32

slide-29
SLIDE 29

Example: u(1|2)

Tensor product spaces e.g. a†

1|0 ⊗ f1|0 ≡ ΨZ

ZZ, ZΨ, ΨZ, ΨΨ, ZX, XZ, XΨ, ΨX, XX

7 / 32

slide-30
SLIDE 30

Example: u(1|2)

Tensor product spaces e.g. a†

1|0 ⊗ f1|0 ≡ ΨZ

ZZ ZΨ+ΨZ ZX +XZ XΨ+ΨX XX ZΨ−ΨZ ΨΨ ZX −XZ XΨ−ΨX

7 / 32

slide-31
SLIDE 31

Example: u(1|2)

Tensor product spaces e.g. a†

1|0 ⊗ f1|0 ≡ ΨZ

ZZ ZΨ+ΨZ ZX +XZ XΨ+ΨX XX ZΨ−ΨZ ΨΨ ZX −XZ XΨ−ΨX

✈ ✈ ❢ ❢

×

7 / 32

slide-32
SLIDE 32

Example: u(1|2)

Tensor product spaces e.g. a†

1|0 ⊗ f1|0 ≡ ΨZ

ZZ ZΨ+ΨZ ZX +XZ XΨ+ΨX XX ZΨ−ΨZ ΨΨ ZX −XZ XΨ−ΨX

✈ ✈ ❢ ❢

× ×

7 / 32

slide-33
SLIDE 33

Example: u(1|2)

Tensor product spaces e.g. a†

1|0 ⊗ f1|0 ≡ ΨZ

ZZ ZΨ+ΨZ ZX +XZ XΨ+ΨX XX ZΨ−ΨZ ΨΨ ZX −XZ XΨ−ΨX

✈ ✈ ❢ ❢

×

7 / 32

slide-34
SLIDE 34

Example: u(1|2)

Tensor product spaces e.g. a†

1|0 ⊗ f1|0 ≡ ΨZ

ZZ ZΨ+ΨZ ZX +XZ XΨ+ΨX XX ZΨ−ΨZ ΨΨ ZX −XZ XΨ−ΨX

✲ ✛ ✲ ✛ ✻ ❄ ⑦ ⑦ ⑦

na1 nf1 nf2

7 / 32

slide-35
SLIDE 35

Example: u(1|2)

Tensor product spaces e.g. a†

1|0 ⊗ f1|0 ≡ ΨZ

ZZ ZΨ+ΨZ ZX +XZ XΨ+ΨX XX ZΨ−ΨZ ΨΨ ZX −XZ XΨ−ΨX

7 / 32

slide-36
SLIDE 36

Example: u(1|2)

Tensor product spaces e.g. a†

1|0 ⊗ f1|0 ≡ ΨZ

ZZ ZΨ+ΨZ ZX +XZ XΨ+ΨX XX ZΨ−ΨZ ΨΨ ZX −XZ XΨ−ΨX

7 / 32

slide-37
SLIDE 37

Extension of Young diagrams

u(1|2)

8 / 32

slide-38
SLIDE 38

Extension of Young diagrams

u(3|3)

8 / 32

slide-39
SLIDE 39

Extension of Young diagrams

u(4|1)

8 / 32

slide-40
SLIDE 40

Extension of Young diagrams

u(0|3)

8 / 32

slide-41
SLIDE 41

Extension of Young diagrams

u(3) C = 1

← at each site

L = 8

f†

1|0 ⊗ f† 1|0 ⊗ f† 1|0 ⊗ f† 1|0 ⊗ f† 2|0 ⊗ f† 2|0 ⊗ f† 2|0 ⊗ f† 3|0

8 / 32

slide-42
SLIDE 42

Extension of Young diagrams

⊗8 u(3) C = 1

← at each site

L = 8

f†

1|0 ⊗ f† 1|0 ⊗ f† 1|0 ⊗ f† 1|0 ⊗ f† 2|0 ⊗ f† 2|0 ⊗ f† 2|0 ⊗ f† 3|0

8 / 32

slide-43
SLIDE 43

Extension of Young diagrams

u(4) C = 2 L = 8

|0 → f†

0|˜

C → C + 1

f†

1f† 0|˜

0 ⊗ f†

1f† 0|˜

0 ⊗ f†

1f† 0|˜

0 ⊗ f†

1f† 0|˜

0 ⊗ f†

2f† 0|˜

0 ⊗ f†

2f† 0|˜

0 ⊗ f†

2f† 0|˜

0 ⊗ f†

3f† 0|˜

8 / 32

slide-44
SLIDE 44

Extension of Young diagrams

⊗8 u(4) C = 2 L = 8

|0 → f†

0|˜

C → C + 1

f†

1f† 0|˜

0 ⊗ f†

1f† 0|˜

0 ⊗ f†

1f† 0|˜

0 ⊗ f†

1f† 0|˜

0 ⊗ f†

2f† 0|˜

0 ⊗ f†

2f† 0|˜

0 ⊗ f†

2f† 0|˜

0 ⊗ f†

3f† 0|˜

8 / 32

slide-45
SLIDE 45

Extension of Young diagrams

u(5) C = 3 L = 8

|0 → f†

0f†

  • 1|˜

˜ C → C + 2

8 / 32

slide-46
SLIDE 46

pu(2, 2|4)

b1, b2 a1, a2 f1, f2, f3, f4

9 / 32

slide-47
SLIDE 47

pu(2, 2|4)

b1, b2 a1, a2 f1, f2, f3, f4 nf + na − nb = 2

9 / 32

slide-48
SLIDE 48

pu(2, 2|4)

b1, b2 a1, a2 f1, f2, f3, f4 nf + na − nb = 2 Fαβ ≡ a†

αa† β|0

Ψαi ≡ a†

αf† i |0

Φij ≡ f†

i f† j |0

Dα ˙

α ≡ a† αb† ˙ α

¯ Ψ ˙

αi

≡ ǫijklb†

˙ αf† j f† kf† l |0

¯ F ˙

α ˙ β

≡ b†

˙ αb† ˙ βf† 1f† 2f† 3f† 4|0

9 / 32

slide-49
SLIDE 49

Non-compact Young diagrams

✲ ✛ ✲ ✛ ✲ ✛ ✲ ✛ ✻ ❄ ✻ ❄ ✻ ❄ ✻ ❄ ⑥ ⑥ ⑥ ⑥ ⑥ ② ⑥ ⑥

nf4 nf3 nf2 nf1 nb1 nb2 na1 na2 [G¨ unaydin, Volin] pu(2, 2|4)

10 / 32

slide-50
SLIDE 50

Extension and counting

s

11 / 32

slide-51
SLIDE 51

Extension and counting

s

11 / 32

slide-52
SLIDE 52

Extension and counting

s

11 / 32

slide-53
SLIDE 53

Extension and counting

s ✉ ✉

u(2, 3|2) C = −1

11 / 32

slide-54
SLIDE 54

Extension and counting

s ✉ ✉

u(1, 4|12) C = 3

11 / 32

slide-55
SLIDE 55

Extension and counting

s ✉ ✉

u(9) C = 5

11 / 32

slide-56
SLIDE 56

Extension and counting

s ✉ ✉

u(2, 2|4) C = 0

Multiplet counting with so(N) characters (susy, non-compact)

  • Beisert, Bianchi,

Morales, Samtleben ’04

  • 11 / 32
slide-57
SLIDE 57

Extension and counting

s ✉ ✉

u(9) C = 5

Multiplet counting with so(N) characters (susy, non-compact)

  • Beisert, Bianchi,

Morales, Samtleben ’04

  • Simply use

u(N) characters

[CM, Volin ’17] 11 / 32

slide-58
SLIDE 58

The spectrum

∆0 2 3 4

2× 2× 2×

5

. . .

27 multiplets

12 / 32

slide-59
SLIDE 59

The spectrum

∆0 2 3 4

2× 2× 2×

6

. . .

16×

144 multiplets

12 / 32

slide-60
SLIDE 60

The spectrum

∆0 2 3 4

2× 2× 2×

7

. . .

74×

918 multiplets

12 / 32

slide-61
SLIDE 61

The spectrum

∆0 2 3 4

2× 2× 2×

8

. . .

376×

6918 multiplets

12 / 32

slide-62
SLIDE 62

Q-systems The 1-loop problem

Getting the machine started

13 / 32

slide-63
SLIDE 63

4|4 Q-system

256 Q’s

Q = Q(u)

multiplet

  • solution

Q∅|∅ Q∅|i Q∅|ij Q∅|ijk Q∅|1234 Qa|∅ Qa|i Qa|ij Qa|ijk Qa|1234 Qab|∅ Qab|i Qab|ij Qab|ijk Qab|1234 Qabc|∅ Qabc|i Qabc|ij Qabc|ijk Qabc|1234 Q1234|∅ Q1234|i Q1234|ij Q1234|ijk Q1234|1234

14 / 32

slide-64
SLIDE 64

4|4 Q-system

Qa|i Qab|i Qac|i Qabc|i QQ = Q−Q+ − Q+Q−

Q± = Q(u ± i

2)

14 / 32

slide-65
SLIDE 65

4|4 Q-system

Qa|i Qa|ij Qa|ik Qa|ijk QQ = Q−Q+ − Q+Q−

Q± = Q(u ± i

2)

14 / 32

slide-66
SLIDE 66

4|4 Q-system

Qa|i Qa|ij Qab|i Qab|ij QQ = Q−Q+ − Q+Q−

Q± = Q(u ± i

2)

14 / 32

slide-67
SLIDE 67

4|4 Q-system

Boundary conditions g → 0 Q =

weights

  • (u − uk)

up to factors of u±L

14 / 32

slide-68
SLIDE 68

4|4 Q-system

Q0,0 Q0,1 Q0,2 Q0,3 Q0,4 Q1,0 Q1,1 Q1,2 Q1,3 Q1,4 Q2,0 Q2,1 Q2,2 Q2,3 Q2,4 Q3,0 Q3,1 Q3,2 Q3,3 Q3,4 Q4,0 Q4,1 Q4,2 Q4,3 Q4,4 Distinguished Q-functions

polynomials of lowest degree

14 / 32

slide-69
SLIDE 69

How to solve the Q-system?

15 / 32

slide-70
SLIDE 70

How to solve the Q-system?

Q∅|1 Q1|1 Q12|1 Q12|12 Q12|123 Q123|123 Q1234|123 Bethe/Baxter equations

15 / 32

slide-71
SLIDE 71

How to solve the Q-system?

Q∅|1 Q1|1 Q12|1 Q12|12 Q12|123 Q123|123 Q1234|123 Bethe/Baxter equations

Q1|1(u1,k + i

2 ) = Q1|1(u1,k − i 2 )

Q∅|1(u2,j+ i

2 )Q12(u2,j+ i 2 )

Q∅(u2,j− i

2 )Q12(u2,j− i 2 ) = − Q1(u2,j−i)

Q1(u2,j+i)

. . .

15 / 32

slide-72
SLIDE 72

How to solve the Q-system?

Q∅|1 Q1|1 Q12|1 Q12|12 Q12|123 Q123|123 Q1234|123 Bethe/Baxter equations

Q1|1(u1,k + i

2 ) = Q1|1(u1,k − i 2 )

Q∅|1(u2,j+ i

2 )Q12(u2,j+ i 2 )

Q∅(u2,j− i

2 )Q12(u2,j− i 2 ) = − Q1(u2,j−i)

Q1(u2,j+i)

. . . SLOW

15 / 32

slide-73
SLIDE 73

How to solve the Q-system?

Q∅|1 Q1|1 Q12|1 Q12|12 Q12|123 Q123|123 Q1234|123 Bethe/Baxter equations

Q1|1(u1,k + i

2 ) = Q1|1(u1,k − i 2 )

Q∅|1(u2,j+ i

2 )Q12(u2,j+ i 2 )

Q∅(u2,j− i

2 )Q12(u2,j− i 2 ) = − Q1(u2,j−i)

Q1(u2,j+i)

. . . SLOW TOO MANY SOLUTIONS

15 / 32

slide-74
SLIDE 74

What’s the problem?

s s s s s s

Q∅|∅ Q∅|1 Q2|∅ Q1|∅ Q12|∅ Q2|1 Q1|1 Q12|1 u(1|2) again

16 / 32

slide-75
SLIDE 75

What’s the problem?

s s s s s s

Q∅|∅ Q∅|1 Q2|∅ Q1|∅ Q12|∅ Q2|1 Q1|1 Q12|1 Bethe/Baxter equations

  • nly guarantee polynomiality on path

16 / 32

slide-76
SLIDE 76

What’s the problem?

s s s s s s

Q∅|∅ Q∅|1 Q2|∅ Q1|∅ Q12|∅ Q2|1 Q1|1 Q12|1 Bethe/Baxter equations

  • nly guarantee polynomiality on path

How to impose polynomiality

  • f full Q-system efficiently?

16 / 32

slide-77
SLIDE 77

Q-systems on Young diagrams

s s s s s s

Q∅|∅ Q∅|1 Q2|∅ Q1|∅ Q12|∅ Q2|1 Q1|1 Q12|1 u(1|2)

17 / 32

slide-78
SLIDE 78

Q-systems on Young diagrams

s s s s s s

Q∅|∅ Q∅|1 Q2|∅ Q1|∅ Q12|∅ Q2|1 Q1|1 Q12|1

17 / 32

slide-79
SLIDE 79

Q-systems on Young diagrams

s s s s s s s s s s s s s s s

Q∅|∅ Q∅|i Q∅|ij Q∅|ijk Q∅|1234 Qa|∅ Qa|i Qa|ij Q1|ijk Q1|1234 Qab|∅ Qab|i Q12|12 Q123|∅ Q123|1

17 / 32

slide-80
SLIDE 80

Q-systems on Young diagrams

s s s s s s s s s s s s s s s

Q0,0 Q0,1 Q0,2 Q0,3 Q0,4 Q1,0 Q1,1 Q1,2 Q1,3 Q1,4 Q2,0 Q2,1 Q2,2 Q3,0 Q3,1 All distinguished Q’s polynomial ⇓ All Q’s polynomial

[CM, Volin ’16] 17 / 32

slide-81
SLIDE 81

Q-systems on Young diagrams

② ② ②

1

② ② ②

3

1

② ② ② ②

7

4

2

1

#roots = #boxes right/above

17 / 32

slide-82
SLIDE 82

Q-systems on Young diagrams

② ② ②

1

② ② ②

3

1

② ② ② ②

7

4

2

1

RECIPE (1) Make poly. ansatz on path u + c u3 + d2u2 + d1u + d0 u7

✟ ✟ ✟ ✟ ✟ ✟ ✟ ✟ ✟ ✟ ✟ ✟ ✟ ✟ ✟ ✙ ❅ ■ ✏ ✏ ✏ ✏ ✏ ✏ ✏ ✏ ✏ ✏ ✏ ✏ ✏ ✏ ✏ ✏ ✏ ✏ ✏ ✏ ✏ ✏ ✮

17 / 32

slide-83
SLIDE 83

Q-systems on Young diagrams

❅ ❅ ❘ ❅ ❅ ❘ ❅ ❅ ❘ ❅ ❅ ❘ ❅ ❅ ❘ ❅ ❅ ■ ❅ ❅ ■ ② ② ②

1

② ② ②

3

1

② ② ② ②

7

4

2

1

RECIPE (1) Make poly. ansatz on path u + c u3 + d2u2 + d1u + d0 (2) Generate rest by polynomial division Q ∝ Quotient

  • Q+Q−−Q−Q+

Q

  • 17 / 32
slide-84
SLIDE 84

Q-systems on Young diagrams

❅ ❅ ❘ ❅ ❅ ❘ ❅ ❅ ❘ ❅ ❅ ❘ ❅ ❅ ❘ ❅ ❅ ■ ❅ ❅ ■ ② ② ②

1

② ② ②

3

1

② ② ② ②

7

4

2

1

RECIPE (1) Make poly. ansatz on path u + c u3 + d2u2 + d1u + d0 (2) Generate rest by polynomial division Q ∝ Quotient

  • Q+Q−−Q−Q+

Q

  • (3) Impose vanishing remainders

Remainder

  • Q+Q−−Q−Q+

Q

  • = 0

17 / 32

slide-85
SLIDE 85

Non-compact case

✇ ✇

2

4

11

✇ ✇ ✇

1

2

8

✇ ✇ ✇ ✇ ✇

5

✇ ✇ ✇ ✇ ✇

1

2

4

✇ ✇ ✇

2

4

3

✇ ✇ ✇

3

6

2

✇ ✇ ✇

4

4

1

✇ ✇ ✇ ✇

5

2

✇ ✇ ✇ ✇

1

7

1

✇ ✇ ✇ ✇

2

9

✇ ✇ ✇ ✇

1

4

12

✇ ✇ ✇

2

6

15

same idea ∼ factors of u±L

18 / 32

slide-86
SLIDE 86

Non-compact case

✇ ✇

2

4

11

✇ ✇ ✇

1

2

8

✇ ✇ ✇ ✇ ✇

5

✇ ✇ ✇ ✇ ✇

1

2

4

✇ ✇ ✇

2

4

3

✇ ✇ ✇

3

6

2

✇ ✇ ✇

4

4

1

✇ ✇ ✇ ✇

5

2

✇ ✇ ✇ ✇

1

7

1

✇ ✇ ✇ ✇

2

9

✇ ✇ ✇ ✇

1

4

12

✇ ✇ ✇

2

6

15

same idea ∼ factors of u±L

18 / 32

slide-87
SLIDE 87

Performance

Give generic code 15 minutes to solve per diagram

(on a worn-out MacBook Air)

∆0 # diagrams solved total # solutions found 2 1 / 1 1 / 1 3 1 / 1 1 / 1 4 7 / 7 10 / 10 5 13 / 13 27 / 27 5.5 12 / 12 36 / 36 6 39 / 39 144 / 144 6.5 36 / 36 276 / 276 7 68 / 77 600 / 918 7.5 54 / 84 694 / 2204 8 107 / 180 1395 / 6918

19 / 32

slide-88
SLIDE 88

Perturbative corrections Perturbative corrections

Engine architecture

20 / 32

slide-89
SLIDE 89

Quantum Spectral Curve

256 Q’s Q∅|∅ Q∅|i Q∅|ij Q∅|ijk Q∅|1234 Qa|∅ Qa|i Qa|ij Qa|ijk Qa|1234 Qab|∅ Qab|i Qab|ij Qab|ijk Qab|1234 Qabc|∅ Qabc|i Qabc|ij Qabc|ijk Qabc|1234 Q1234|∅ Q1234|i Q1234|ij Q1234|ijk Q1234|1234

[Gromov, Kazakov, Leurent, Volin ’13,’14]

21 / 32

slide-90
SLIDE 90

Quantum Spectral Curve

Cut structure

Qa|∅ Qabc|1234

u u −2g 2g

r r ✁ ✁ ✁ ✁ ✁ ✁ ✁ ✁ ✁ ✁ ✁ ✁ ✁ ✁ ✁ ✁ r r r r r r r r r r

21 / 32

slide-91
SLIDE 91

Quantum Spectral Curve

Cut structure

Q∅|i Q∅|ij Q∅|ijk Qa|i Qa|ij Qa|ijk Qab|i Qab|ij Qab|ijk Qabc|i Qabc|ij Qabc|ijk Q1234|i Q1234|ij Q1234|ijk

u u

r r r r r r ✁ ✁ ✁ ✁ ✁ ✁ ✁ ✁ ✁ ✁ ✁ ✁ ✁ ✁ ✁ ✁ r r r r r r

21 / 32

slide-92
SLIDE 92

Quantum Spectral Curve

Analytic continuation

Qa|∅ Qabc|1234

s s

u

21 / 32

slide-93
SLIDE 93

Quantum Spectral Curve

Analytic continuation

Pa Pa

s s

u

21 / 32

slide-94
SLIDE 94

Quantum Spectral Curve

Analytic continuation

Pa Pa

s s s s s s s s s s

˜ Pa = µabPb u

21 / 32

slide-95
SLIDE 95

Quantum Spectral Curve

Analytic continuation

Pa Pa

s s s s s s s s s s

˜ Pa = µabPb µab = ωijQ−

ab|ij

u

21 / 32

slide-96
SLIDE 96

Perturbative strategies

22 / 32

slide-97
SLIDE 97

Perturbative strategies

Pµ, sl(2)

[CM,Volin ’14] 22 / 32

slide-98
SLIDE 98

Perturbative strategies

Pµ, sl(2)

[CM,Volin ’14]

Q-system, general

Gromov, Sizov Levkovich-Maslyuk’15

[ ]

22 / 32

slide-99
SLIDE 99

Perturbative strategies

Pµ, sl(2)

[CM,Volin ’14]

Q-system, general

Gromov, Sizov Levkovich-Maslyuk’15

[ ]

Pµ, general

[CM,Volin ’17] 22 / 32

slide-100
SLIDE 100

Key property: structure of P

Pa ˜ Pa

r r r r r r r r r r r r

  • u

u

23 / 32

slide-101
SLIDE 101

Key property: structure of P

Pa ˜ Pa

r r r r r r r r r r r r

  • u

u

r r ✫✪ ✬✩

x Pa ˜ Pa

r r rr r r r r r r r r r r r r r

x + 1

x = u g

P(x) =

  • k=#

ck xk

23 / 32

slide-102
SLIDE 102

Key property: structure of P

Pa ˜ Pa

r r r r r r r r r r r r

  • u

u

r r ✫✪ ✬✩

x Pa ˜ Pa

r r rr r r r r r r r r r r r r r

x + 1

x = u g

P(x) =

  • k=#

ck xk

P(u) = − 1

u + g2

− 1

u3 − c u2 − γ1 2u

  • + ...

finite # of constants at each loop

23 / 32

slide-103
SLIDE 103

Perturbative solution

1 Pa Pa 1

24 / 32

slide-104
SLIDE 104

Perturbative solution

solve Q−

a|i − Q+ a|i = PaPaQ+ b|i

Q-system based [Gromov, Levkovich-Maslyuk, Sizov ’15] 1 Pa Qa|i Pa 1

24 / 32

slide-105
SLIDE 105

Perturbative solution

solve Q−

a|i − Q+ a|i = PaPaQ+ b|i

Q-system based [Gromov, Levkovich-Maslyuk, Sizov ’15] 1 Qi Pa Qa|i Pa 1

24 / 32

slide-106
SLIDE 106

Perturbative solution

1 Qi Pa Qa|i Qa|i Pa Qi 1 Q-system based [Gromov, Levkovich-Maslyuk, Sizov ’15] Gluing ˜ Q• = ¯ Q•

  • r

r r

  • r

r r

24 / 32

slide-107
SLIDE 107

Perturbative solution

1 Qi Pa Qa|i Qa|i Pa Qi 1 Gluing ˜ Q• = ¯ Q• Q-system based [Gromov, Levkovich-Maslyuk, Sizov ’15]

  • r

r r

  • r

r r ❅ ❅ ❅ ❅ ❅ ❅ ❅ ❅ ❅ ❅ ❅ ❅ ❅ ❅ ❅ ❅ ❅ ❅ ❅ ❅ ❅ ❅

24 / 32

slide-108
SLIDE 108

Perturbative solution

1 Pa Pa 1 Pµ-system based [CM, Volin ’17]

24 / 32

slide-109
SLIDE 109

Perturbative solution

1 Pa Qab|ij Pa 1 solve

Q−

ab|ij − Q+ ab|ij = P[aQ− b]c|ijPc

Pµ-system based [CM, Volin ’17]

24 / 32

slide-110
SLIDE 110

Perturbative solution

1 Pa

µab

Pa 1 solve

µab − µ++

ab = P[aµb]cPc

Pµ-system based [CM, Volin ’17]

24 / 32

slide-111
SLIDE 111

Perturbative solution

1 Pa

µab

Pa 1 Gluing ˜ P• = µ•P•

  • r
  • r

r r r r

24 / 32

slide-112
SLIDE 112

Sample results

25 / 32

slide-113
SLIDE 113

Sample results

Exceptional solution

Q = u(u − i

2)(u + i 2)

su(2) sector Z3X 3

r

γ = 12g2 25 / 32

slide-114
SLIDE 114

Sample results

Exceptional solution

Q = u(u − i

2)(u + i 2)

su(2) sector Z3X 3

r

γ = 12g2 − 36g4 25 / 32

slide-115
SLIDE 115

Sample results

Exceptional solution

Q = u(u − i

2)(u + i 2)

su(2) sector Z3X 3

r

γ = 12g2 − 36g4 + 252g6 25 / 32

slide-116
SLIDE 116

Sample results

Exceptional solution

Q = u(u − i

2)(u + i 2)

su(2) sector Z3X 3

r

γ = 12g2 − 36g4 + 252g6 − 2484g8 25 / 32

slide-117
SLIDE 117

Sample results

Exceptional solution

Q = u(u − i

2)(u + i 2)

su(2) sector Z3X 3

r

γ = 12g2 − 36g4 + 252g6 − 2484g8 + g10 28188 − 288ζ3

  • 25 / 32
slide-118
SLIDE 118

Sample results

Exceptional solution

Q = u(u − i

2)(u + i 2)

su(2) sector Z3X 3

r

γ = 12g2 − 36g4 + 252g6 − 2484g8 + g10 28188 − 288ζ3

  • + g12

− 339012 + 7776ζ3 + 12096ζ5 − 18144ζ9

  • [Arutyunov, Frolov, Sfondrini ’12]

25 / 32

slide-119
SLIDE 119

Sample results

Exceptional solution

Q = u(u − i

2)(u + i 2)

su(2) sector Z3X 3

r

γ = 12g2 − 36g4 + 252g6 − 2484g8 + g10 28188 − 288ζ3

  • + g12

− 339012 + 7776ζ3 + 12096ζ5 − 18144ζ9

  • + g14

4214268 − 39744ζ3 − 181440ζ5 + 57024ζ2

3 − 260064ζ7 − 34560ζ3ζ5 − 60480ζ9 − 8640ζ2 5 − 96768ζ3ζ7

+665280ζ11

  • 25 / 32
slide-120
SLIDE 120

Sample results

Exceptional solution

Q = u(u − i

2)(u + i 2)

su(2) sector Z3X 3

r

γ = 12g2 − 36g4 + 252g6 − 2484g8 + g10 28188 − 288ζ3

  • + g12

− 339012 + 7776ζ3 + 12096ζ5 − 18144ζ9

  • + g14

4214268 − 39744ζ3 − 181440ζ5 + 57024ζ2

3 − 260064ζ7 − 34560ζ3ζ5 − 60480ζ9 − 8640ζ2 5 − 96768ζ3ζ7

+665280ζ11

  • +g16
  • − 53785620 − 820800 ζ3 − 699840 ζ2

3 − 82944 ζ3 3 + 1664064 ζ5 − 1510272 ζ3 ζ5

−290304 ζ2

3 ζ5 + 250560 ζ2 5 + 4257792 ζ7 + 628992 ζ3 ζ7 + 1451520 ζ5 ζ7 + 4711968 ζ9 + 2903040 ζ3 ζ9

+ 11144736 5 ζ11 − 16061760 ζ13 − 124416 5 Z(2)

11

  • 25 / 32
slide-121
SLIDE 121

Sample results

Exceptional solution

Q = u(u − i

2)(u + i 2)

su(2) sector Z3X 3

r

γ = 12g2 − 36g4 + 252g6 − 2484g8 + g10 28188 − 288ζ3

  • + g12

− 339012 + 7776ζ3 + 12096ζ5 − 18144ζ9

  • + g14

4214268 − 39744ζ3 − 181440ζ5 + 57024ζ2

3 − 260064ζ7 − 34560ζ3ζ5 − 60480ζ9 − 8640ζ2 5 − 96768ζ3ζ7

+665280ζ11

  • +g16
  • − 53785620 − 820800 ζ3 − 699840 ζ2

3 − 82944 ζ3 3 + 1664064 ζ5 − 1510272 ζ3 ζ5

−290304 ζ2

3 ζ5 + 250560 ζ2 5 + 4257792 ζ7 + 628992 ζ3 ζ7 + 1451520 ζ5 ζ7 + 4711968 ζ9 + 2903040 ζ3 ζ9

+ 11144736 5 ζ11 − 16061760 ζ13 − 124416 5 Z(2)

11

  • +g18
  • 702413532 + 25507872 ζ3 − 2282688 ζ2

3 − 1119744 ζ3 3 − 248832 ζ4 3 − 502848 ζ5 + 25653888 ζ3 ζ5

+3836160 ζ2

3 ζ5 + 5987520 ζ2 5 + 6635520 ζ3 ζ2 5 − 45170784 ζ7 + 22037184 ζ3 ζ7 + 6676992 ζ2 3 ζ7

−5766336 ζ5 ζ7 − 16027200 ζ2

7 − 75035808 ζ9 + 10018944 ζ3 ζ9 − 38361600 ζ5 ζ9 − 79511328 ζ11

−58848768 ζ3 ζ11 − 273255552 5 ζ13 + 324324000 ζ15 + 311040 Z(2)

11 −

601344 5 Z(2)

13 + 145152 Z(3) 13

  • + . . .

e.g. Z (2)

13

= −ζ5,3,5 + 11 ζ5 ζ3,5 + 5 ζ5 ζ8

appearance of Z conjectured in [Broadhurst, Kreimer ’95]

25 / 32

slide-122
SLIDE 122

Degenerate solutions

✇ ✇

1

3

5

✇ ✇ ✇

2

5

4

✇ ✇ ✇

3

7

3

✇ ✇ ✇

4

5

2

✇ ✇ ✇

5

3

1

✇ ✇ ✇

1

3

8

4

✇ ✇

2

5

6

3

✇ ✇

3

7

4

2

✇ ✇

4

4

2

1

✇ ✇

5

1

✇ ✇

26 / 32

slide-123
SLIDE 123

Degenerate solutions

✇ ✇

1

3

5

✇ ✇ ✇

2

5

4

✇ ✇ ✇

3

7

3

✇ ✇ ✇

4

5

2

✇ ✇ ✇

5

3

1

✇ ✇ ✇

1

3

8

4

✇ ✇

2

5

6

3

✇ ✇

3

7

4

2

✇ ✇

4

4

2

1

✇ ✇

5

1

✇ ✇

Q = (u + i

2)L(u − i 2)L 3 j=1(u − uj)

Q = (u + i

2)L(u − i 2)L 1 j=1(u − uj)

❥ ✐ ❤ ❥ ✐ ❤

26 / 32

slide-124
SLIDE 124

Degenerate solutions

✇ ✇

1

3

5

✇ ✇ ✇

2

5

4

✇ ✇ ✇

3

7

3

✇ ✇ ✇

4

5

2

✇ ✇ ✇

5

3

1

✇ ✇ ✇

1

3

8

4

✇ ✇

2

5

6

3

✇ ✇

3

7

4

2

✇ ✇

4

4

2

1

✇ ✇

5

1

✇ ✇

Q = (u + i

2)4(u − i 2)4(u + i 2)(u − i 2)(u − u•)

Q = (u + i

2)5(u − i 2)5(u − u•)

❥ ✐ ❤ ❥ ✐ ❤

26 / 32

slide-125
SLIDE 125

Degenerate solutions

✇ ✇

1

3

5

✇ ✇ ✇

2

5

4

✇ ✇ ✇

3

7

3

✇ ✇ ✇

4

5

2

✇ ✇ ✇

5

3

1

✇ ✇ ✇

1

3

8

4

✇ ✇

2

5

6

3

✇ ✇

3

7

4

2

✇ ✇

4

4

2

1

✇ ✇

5

1

✇ ✇

Q = (u + i

2)4(u − i 2)4(u + i 2)(u − i 2)(u − u•)

Q = (u + i

2)5(u − i 2)5(u − u•)

❥ ✐ ❤ ❥ ✐ ❤

?

26 / 32

slide-126
SLIDE 126

Coming soon: Spectral database

27 / 32

slide-127
SLIDE 127

Coming soon: Spectral database Patterns in the data?

27 / 32

slide-128
SLIDE 128

Perturbative corrections

The real Ferrari:

QSC with Q-operators

28 / 32

slide-129
SLIDE 129

Q-functions → Q-operators

For fixed quantum numbers Q = {Q(1), Q(2), Q(3)} solution ⇔ primary operator (HWS)

29 / 32

slide-130
SLIDE 130

Q-functions → Q-operators

Q =   Q(1) Q(2) Q(3)  

29 / 32

slide-131
SLIDE 131

Q-functions → Q-operators

Q =              Q(1) Q(2) Q(3) ∞ ∞ ∞ ∞ ∞             

29 / 32

slide-132
SLIDE 132

Q-functions → Q-operators

Q =              Q(1) Q(2) Q(3) Q(4) Q(5) Q(6) Q(7) Q(8)             

TWIST

29 / 32

slide-133
SLIDE 133

Q-functions → Q-operators

Q =              Q(1,1) Q(1,2) Q(1,3) Q(1,4) Q(1,5) Q(1,6) Q(1,7) Q(1,8) Q(2,1) Q(2,2) Q(2,3) Q(2,4) Q(2,5) Q(2,6) Q(2,7) Q(2,8) Q(3,1) Q(3,2) Q(3,3) Q(3,4) Q(3,5) Q(3,6) Q(3,7) Q(3,8) Q(4,1) Q(4,2) Q(4,3) Q(4,4) Q(4,5) Q(4,6) Q(4,7) Q(4,8) Q(5,1) Q(5,2) Q(5,3) Q(5,4) Q(5,5) Q(5,6) Q(5,7) Q(5,8) Q(6,1) Q(6,2) Q(6,3) Q(6,4) Q(6,5) Q(6,6) Q(6,7) Q(6,8) Q(7,1) Q(7,2) Q(7,3) Q(7,4) Q(7,5) Q(7,6) Q(7,7) Q(7,8) Q(8,1) Q(8,2) Q(8,3) Q(8,4) Q(8,5) Q(8,6) Q(8,7) Q(8,8)             

TWIST CHANGE BASIS

29 / 32

slide-134
SLIDE 134

Turning the key: evaluating u(N, M|K) Q-operators

Q(m,n)

ab...|ij... = ZX...X|Qab...|ij...|XΨ...Z

30 / 32

slide-135
SLIDE 135

Turning the key: evaluating u(N, M|K) Q-operators

Q(m,n)

A|J

= ZX...X|QA|J|XΨ...Z

30 / 32

slide-136
SLIDE 136

Turning the key: evaluating u(N, M|K) Q-operators

Q(m,n)

A|J

= ZX...X|TrA

  • τ¯

ξξ R{1} A|J R{2} A|J · · · R{L} A|J

  • |XΨ...Z

Bazhanov, Frassek, Lukowski, Meneghelli, Staudacher ’09-’15

twist phase

R-matrix

acts on one physical site + auxiliary space

auxiliary space oscillators

30 / 32

slide-137
SLIDE 137

Turning the key: evaluating u(N, M|K) Q-operators

Q(m,n)

A|J

= TrA

  • τ¯

ξξ Z|R{1} A|J |X X|R{2} A|J |Ψ · · · X|R{L} A|J |Z

  • 30 / 32
slide-138
SLIDE 138

Turning the key: evaluating u(N, M|K) Q-operators

Z|RA|J|X

30 / 32

slide-139
SLIDE 139

Turning the key: evaluating u(N, M|K) Q-operators

Z|RA|J|X RA|J(u) ∼ eξE n¯

n Γ(u+iE ¯ n¯ n)

Γ(u)

ξE ¯

nn

n ∈ A|J E mn =              

  • b1b†

1

  • b1b†

2

  • b1f1
  • b1f2
  • b1f3
  • b1f4
  • b1a1
  • b1a2
  • b2b†

1

  • b2b†

2

  • b2f1
  • b2f2
  • b2f3
  • b2f4
  • b2a1
  • b2a2

f†

1b† 1

f†

1b† 2

f†

1f1

f†

1f2

f†

1f3

f†

1f4

f†

1a1

f†

1a2

f†

2b† 1

f†

2b† 2

f†

2f1

f†

2f2

f†

2f3

f†

2f4

f†

2a1

f†

2a2

f†

3b† 1

f†

3b† 2

f†

3f1

f†

3f2

f†

3f3

f†

3f4

f†

3a1

f†

3a2

f†

4b† 1

f†

4b† 2

f†

4f1

f†

4f2

f†

4f3

f†

4f4

f†

4a1

f†

4a2

a†

1b† 1

a†

1b† 2

a†

1f1

a†

1f2

a†

1f3

a†

1f4

a†

1a1

a†

1a2

a†

2b† 1

a†

2b† 2

a†

2f1

a†

2f2

a†

2f3

a†

2f4

a†

2a1

a†

2a2

             

30 / 32

slide-140
SLIDE 140

Turning the key: evaluating u(N, M|K) Q-operators

Z|RA|J|X RA|J(u) ∼ eξE n¯

n Γ(u+iE ¯ n¯ n)

Γ(u)

e

¯ ξE ¯

nn

n ∈ A|J E mn =                

  • b1b†

1

  • b1b†

2

  • b1f1
  • b1f2
  • b1f3
  • b1f4
  • b1a1
  • b1a2
  • b2b†

1

  • b2b†

2

  • b2f1
  • b2f2
  • b2f3
  • b2f4
  • b2a1
  • b2a2

f†

1b† 1

f†

1b† 2

f†

1f1

f†

1f2

f†

1f3

f†

1f4

f†

1a1

f†

1a2

f†

2b† 1

f†

2b† 2

f†

2f1

f†

2f2

f†

2f3

f†

2f4

f†

2a1

f†

2a2

f†

3b† 1

f†

3b† 2

f†

3f1

f†

3f2

f†

3f3

f†

3f4

f†

3a1

f†

3a2

f†

4b† 1

f†

4b† 2

f†

4f1

f†

4f2

f†

4f3

f†

4f4

f†

4a1

f†

4a2

a†

1b† 1

a†

1b† 2

a†

1f1

a†

1f2

a†

1f3

a†

1f4

a†

1a1

a†

1a2

a†

2b† 1

a†

2b† 2

a†

2f1

a†

2f2

a†

2f3

a†

2f4

a†

2a1

a†

2a2

               

30 / 32

slide-141
SLIDE 141

Turning the key: evaluating u(N, M|K) Q-operators

  • . . . + D2Z| + DZ| + Z|
  • · · ·
  • |Z + |DZ + |D2Z + . . .
  • RA|J(u) ∼ eξE n¯

n Γ(u+iE ¯ n¯ n)

Γ(u)

e

¯ ξE ¯

nn

n ∈ A|J E mn =                

  • b1b†

1

  • b1b†

2

  • b1f1
  • b1f2
  • b1f3
  • b1f4
  • b1a1
  • b1a2
  • b2b†

1

  • b2b†

2

  • b2f1
  • b2f2
  • b2f3
  • b2f4
  • b2a1
  • b2a2

f†

1b† 1

f†

1b† 2

f†

1f1

f†

1f2

f†

1f3

f†

1f4

f†

1a1

f†

1a2

f†

2b† 1

f†

2b† 2

f†

2f1

f†

2f2

f†

2f3

f†

2f4

f†

2a1

f†

2a2

f†

3b† 1

f†

3b† 2

f†

3f1

f†

3f2

f†

3f3

f†

3f4

f†

3a1

f†

3a2

f†

4b† 1

f†

4b† 2

f†

4f1

f†

4f2

f†

4f3

f†

4f4

f†

4a1

f†

4a2

a†

1b† 1

a†

1b† 2

a†

1f1

a†

1f2

a†

1f3

a†

1f4

a†

1a1

a†

1a2

a†

2b† 1

a†

2b† 2

a†

2f1

a†

2f2

a†

2f3

a†

2f4

a†

2a1

a†

2a2

               

30 / 32

slide-142
SLIDE 142

Turning the key: evaluating u(N, M|K) Q-operators

[Frassek, Meidinger, CM ’17]

R’s with one index: R∅|j(u) ∼ eξE n¯

n Γ(u+iE ¯ n¯ n)

Γ(u)

ξE ¯

nn 30 / 32

slide-143
SLIDE 143

Turning the key: evaluating u(N, M|K) Q-operators

[Frassek, Meidinger, CM ’17]

R’s with one index: R∅|j ∼

  • k=−∞

(ξE n¯

n)θ(k)k · · · · · · · · · (¯

ξE ¯

nn)θ(−k)k

30 / 32

slide-144
SLIDE 144

Turning the key: evaluating u(N, M|K) Q-operators

[Frassek, Meidinger, CM ’17]

R’s with one index: R∅|j ∼

  • k=−∞

(ξE n¯

n)θ(k)k · · · · · · · · · (¯

ξE ¯

nn)θ(−k)k

3F2(N, N, k, u, ...)

30 / 32

slide-145
SLIDE 145

Turning the key: evaluating u(N, M|K) Q-operators

[Frassek, Meidinger, CM ’17]

R’s with one index: R∅|j ∼

  • k=−∞

(ξE n¯

n)θ(k)k · · · · · · · · · (¯

ξE ¯

nn)θ(−k)k

3F2(N, N, k, u, ...) = Γ(...) Γ(...)Γ(...)

  • 2F1

30 / 32

slide-146
SLIDE 146

Turning the key: evaluating u(N, M|K) Q-operators

[Frassek, Meidinger, CM ’17]

R’s with one index: R∅|j ∼

  • k=−∞

(ξE n¯

n)θ(k)k · · · · · · · · · (¯

ξE ¯

nn)θ(−k)k

3F2(N, N, k, u, ...) = explicitly truncating sums

30 / 32

slide-147
SLIDE 147

Turning the key: evaluating u(N, M|K) Q-operators

[Frassek, Meidinger, CM ’17]

R’s with one index: R∅|j ∼

  • k=−∞

(ξE n¯

n)θ(k)k · · · · · · · · · (¯

ξE ¯

nn)θ(−k)k

3F2(N, N, k, u, ...) = explicitly truncating sums

Z|R∅|j|X = u + N + N2 + ... u + N + ...

30 / 32

slide-148
SLIDE 148

Turning the key: evaluating u(N, M|K) Q-operators

[Frassek, Meidinger, CM ’17]

R’s with one index: R∅|j ∼

  • k=−∞

(ξE n¯

n)θ(k)k · · · · · · · · · (¯

ξE ¯

nn)θ(−k)k

3F2(N, N, k, u, ...) = explicitly truncating sums

Z|R∅|j|X = u + N + N2 + ... u + N + ...

trace over auxiliary space Qa|∅, Q∅|j

s s s

30 / 32

slide-149
SLIDE 149

Turning the key: evaluating u(N, M|K) Q-operators

[Frassek, Meidinger, CM ’17]

R’s with one index: R∅|j ∼

  • k=−∞

(ξE n¯

n)θ(k)k · · · · · · · · · (¯

ξE ¯

nn)θ(−k)k

3F2(N, N, k, u, ...) = explicitly truncating sums

Z|R∅|j|X = u + N + N2 + ... u + N + ...

trace over auxiliary space Qa|∅, Q∅|j

→ generate others

from QQ-relations Qabc...|ijk...

s s s s s s s s s s s s s s s s s s s s s s s s s

ր ր ր ր ր ր ր ր ր ր ր ր ր ր ր ր

30 / 32

slide-150
SLIDE 150

Turning the key: evaluating u(N, M|K) Q-operators

[Frassek, Meidinger, CM ’17]

R’s with one index: R∅|j ∼

  • k=−∞

(ξE n¯

n)θ(k)k · · · · · · · · · (¯

ξE ¯

nn)θ(−k)k

3F2(N, N, k, u, ...) = explicitly truncating sums

Z|R∅|j|X = u + N + N2 + ... u + N + ...

trace over auxiliary space Qa|∅, Q∅|j

→ generate others

from QQ-relations Qabc...|ijk...

→ Plug into fully

twisted QSC δQabc...|ijk...

[Volin, Kazakov, Leurent ’15] 30 / 32

slide-151
SLIDE 151

Conclusions / outlook

◮ Automatic perturbative solution of the spectral problem

Analytic 8-10 loop results for the first thousands of states

31 / 32

slide-152
SLIDE 152

Conclusions / outlook

◮ Automatic perturbative solution of the spectral problem

Analytic 8-10 loop results for the first thousands of states

◮ Patterns in the spectrum?

31 / 32

slide-153
SLIDE 153

Conclusions / outlook

◮ Automatic perturbative solution of the spectral problem

Analytic 8-10 loop results for the first thousands of states

◮ Patterns in the spectrum? ◮ Perturbative Q-operators might tell us more about nature of

AdS/CFT integrability

31 / 32

slide-154
SLIDE 154

Thank you!

32 / 32