Ising model and total positivity Pavel Galashin MIT - - PowerPoint PPT Presentation

ising model and total positivity
SMART_READER_LITE
LIVE PREVIEW

Ising model and total positivity Pavel Galashin MIT - - PowerPoint PPT Presentation

Ising model and total positivity Pavel Galashin MIT galashin@mit.edu University of Toronto Colloquium, January 7, 2019 Joint work with Pavlo Pylyavskyy arXiv:1807.03282 Pavel Galashin (MIT) Ising model and total positivity U of Toronto,


slide-1
SLIDE 1

Ising model and total positivity

Pavel Galashin

MIT galashin@mit.edu

University of Toronto Colloquium, January 7, 2019 Joint work with Pavlo Pylyavskyy arXiv:1807.03282

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 1 / 29

slide-2
SLIDE 2

Part 1: Ising model

slide-3
SLIDE 3

Ising model: definition

Definition

A planar Ising network is a pair (G, J) where:

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 3 / 29

slide-4
SLIDE 4

Ising model: definition

Definition

A planar Ising network is a pair (G, J) where: G= (V , E) is a planar graph embedded in a disk

b1 b2 b3 b4 b5 b6 Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 3 / 29

slide-5
SLIDE 5

Ising model: definition

Definition

A planar Ising network is a pair (G, J) where: G= (V , E) is a planar graph embedded in a disk J: E → R>0 is a function

b1 b2 b3 b4 b5 b6

Je1 Je2 Je3 Je4 Je5 Je6 Je7 Je8 Je9

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 3 / 29

slide-6
SLIDE 6

Ising model: definition

Definition

A planar Ising network is a pair (G, J) where: G= (V , E) is a planar graph embedded in a disk J: E → R>0 is a function

b1 b2 b3 b4 b5 b6

Je1 Je2 Je3 Je4 Je5 Je6 Je7 Je8 Je9

Spin configuration: a map σ : V → {±1}

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 3 / 29

slide-7
SLIDE 7

Ising model: definition

Definition

A planar Ising network is a pair (G, J) where: G= (V , E) is a planar graph embedded in a disk J: E → R>0 is a function

b1 b2 b3 b4 b5 b6

Je1 Je2 Je3 Je4 Je5 Je6 Je7 Je8 Je9

Spin configuration: a map σ : V → {±1} Ising model: probability measure on {±1}V

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 3 / 29

slide-8
SLIDE 8

Ising model: definition

Definition

A planar Ising network is a pair (G, J) where: G= (V , E) is a planar graph embedded in a disk J: E → R>0 is a function

b1 b2 b3 b4 b5 b6

Je1 Je2 Je3 Je4 Je5 Je6 Je7 Je8 Je9

Spin configuration: a map σ : V → {±1} Ising model: probability measure on {±1}V wt(σ):=

  • {u,v}∈E

exp

  • J{u,v}σuσv
  • Pavel Galashin (MIT)

Ising model and total positivity U of Toronto, 01/07/2019 3 / 29

slide-9
SLIDE 9

Ising model: definition

Definition

A planar Ising network is a pair (G, J) where: G= (V , E) is a planar graph embedded in a disk J: E → R>0 is a function

b1 b2 b3 b4 b5 b6

Je1 Je2 Je3 Je4 Je5 Je6 Je7 Je8 Je9 Je1 Je2 Je3 Je4 Je5 Je6 Je7 Je8 Je9

Spin configuration: a map σ : V → {±1} Ising model: probability measure on {±1}V wt(σ):=

  • {u,v}∈E

exp

  • J{u,v}σuσv
  • wt(σ) =

exp (Je1 + Je2 + Je6 + Je8) exp (Je3 + Je4 + Je5 + Je7 + Je9)

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 3 / 29

slide-10
SLIDE 10

Ising model: definition

Definition

A planar Ising network is a pair (G, J) where: G= (V , E) is a planar graph embedded in a disk J: E → R>0 is a function

b1 b2 b3 b4 b5 b6

Je1 Je2 Je3 Je4 Je5 Je6 Je7 Je8 Je9 Je1 Je2 Je3 Je4 Je5 Je6 Je7 Je8 Je9

Spin configuration: a map σ : V → {±1} Ising model: probability measure on {±1}V wt(σ):=

  • {u,v}∈E

exp

  • J{u,v}σuσv
  • Partition function:

Z:=

  • σ∈{±1}V

wt(σ)

wt(σ) = exp (Je1 + Je2 + Je6 + Je8) exp (Je3 + Je4 + Je5 + Je7 + Je9)

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 3 / 29

slide-11
SLIDE 11

Ising model: definition

Definition

A planar Ising network is a pair (G, J) where: G= (V , E) is a planar graph embedded in a disk J: E → R>0 is a function

b1 b2 b3 b4 b5 b6

Je1 Je2 Je3 Je4 Je5 Je6 Je7 Je8 Je9 Je1 Je2 Je3 Je4 Je5 Je6 Je7 Je8 Je9

Spin configuration: a map σ : V → {±1} Ising model: probability measure on {±1}V wt(σ):=

  • {u,v}∈E

exp

  • J{u,v}σuσv
  • Partition function:

Z:=

  • σ∈{±1}V

wt(σ)

wt(σ) = exp (Je1 + Je2 + Je6 + Je8) exp (Je3 + Je4 + Je5 + Je7 + Je9) Prob(σ):= wt(σ) Z

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 3 / 29

slide-12
SLIDE 12

Ising model: correlation functions

Definition

For u, v ∈ V , their correlation is σuσv := Prob(σu = σv) − Prob(σu = σv).

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 4 / 29

slide-13
SLIDE 13

Ising model: correlation functions

Definition

For u, v ∈ V , their correlation is σuσv := Prob(σu = σv) − Prob(σu = σv).

Theorem (Griffiths (1967))

For u, v ∈ V , we have σuσv ≥ 0.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 4 / 29

slide-14
SLIDE 14

Ising model: correlation functions

Definition

For u, v ∈ V , their correlation is σuσv := Prob(σu = σv) − Prob(σu = σv).

Theorem (Griffiths (1967))

For u, v ∈ V , we have σuσv ≥ 0.

Theorem (Kelly–Sherman (1968))

For u, v, w ∈ V , we have σuσw ≥ σuσv · σvσw.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 4 / 29

slide-15
SLIDE 15

Ising model: correlation functions

Definition

For u, v ∈ V , their correlation is σuσv := Prob(σu = σv) − Prob(σu = σv).

Theorem (Griffiths (1967))

For u, v ∈ V , we have σuσv ≥ 0.

Theorem (Kelly–Sherman (1968))

For u, v, w ∈ V , we have σuσw ≥ σuσv · σvσw.

Question (Kelly–Sherman (1968))

Describe correlations of the Ising model by inequalities.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 4 / 29

slide-16
SLIDE 16

Ising model: correlation functions

Definition

For u, v ∈ V , their correlation is σuσv := Prob(σu = σv) − Prob(σu = σv).

Theorem (Griffiths (1967))

For u, v ∈ V , we have σuσv ≥ 0.

Theorem (Kelly–Sherman (1968))

For u, v, w ∈ V , we have σuσw ≥ σuσv · σvσw.

Question (Kelly–Sherman (1968))

Describe correlations of the Ising model by inequalities.

  • M. Lis (2017): more inequalities using objects from total positivity

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 4 / 29

slide-17
SLIDE 17

Ising model: correlation functions

Definition

For u, v ∈ V , their correlation is σuσv := Prob(σu = σv) − Prob(σu = σv).

Theorem (Griffiths (1967))

For u, v ∈ V , we have σuσv ≥ 0.

Theorem (Kelly–Sherman (1968))

For u, v, w ∈ V , we have σuσw ≥ σuσv · σvσw.

Question (Kelly–Sherman (1968))

Describe correlations of the Ising model by inequalities.

  • M. Lis (2017): more inequalities using objects from total positivity

Theorem (G.–Pylyavskyy (2018))

Describe boundary correlations of the planar Ising model by inequalities.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 4 / 29

slide-18
SLIDE 18

Ising model: history

slide-19
SLIDE 19

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 6 / 29

slide-20
SLIDE 20

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): not a good model for ferromagnetism

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 6 / 29

slide-21
SLIDE 21

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): not a good model for ferromagnetism

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 6 / 29

slide-22
SLIDE 22

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): not a good model for ferromagnetism

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 6 / 29

slide-23
SLIDE 23

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): not a good model for ferromagnetism

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 6 / 29

slide-24
SLIDE 24

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): not a good model for ferromagnetism

  • F

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 6 / 29

slide-25
SLIDE 25

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): not a good model for ferromagnetism

  • F

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 6 / 29

slide-26
SLIDE 26

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): not a good model for ferromagnetism

  • F

Q: how does | F| depend on T ◦?

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 6 / 29

slide-27
SLIDE 27

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): not a good model for ferromagnetism

  • F

Q: how does | F| depend on T ◦? T ◦ | F|

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 6 / 29

slide-28
SLIDE 28

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): not a good model for ferromagnetism

  • F

Q: how does | F| depend on T ◦? T ◦ | F| T ◦ | F|

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 6 / 29

slide-29
SLIDE 29

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): not a good model for ferromagnetism

  • F

Q: how does | F| depend on T ◦? T ◦ | F| T ◦ | F|

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 6 / 29

slide-30
SLIDE 30

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): not a good model for ferromagnetism

  • F

Q: how does | F| depend on T ◦? T ◦ | F| T ◦ | F| Curie point (P. Curie, 1895)

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 6 / 29

slide-31
SLIDE 31

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): not a good model for ferromagnetism

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 7 / 29

slide-32
SLIDE 32

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): no phase transition in 1D = ⇒ not a good model for ferromagnetism

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 7 / 29

slide-33
SLIDE 33

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): no phase transition in 1D = ⇒ not a good model for ferromagnetism Historically, we let G := Zd ∩ Ω for some Ω ⊂ Rd and set all Je := 1

T for some temperature T ∈ R>0.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 7 / 29

slide-34
SLIDE 34

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): no phase transition in 1D = ⇒ not a good model for ferromagnetism Historically, we let G := Zd ∩ Ω for some Ω ⊂ Rd and set all Je := 1

T for some temperature T ∈ R>0.

Peierls (1937): phase transition in Zd for d ≥ 2

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 7 / 29

slide-35
SLIDE 35

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): no phase transition in 1D = ⇒ not a good model for ferromagnetism Historically, we let G := Zd ∩ Ω for some Ω ⊂ Rd and set all Je := 1

T for some temperature T ∈ R>0.

Peierls (1937): phase transition in Zd for d ≥ 2 Kramers–Wannier (1941): critical temperature

1 Tc = 1 2 log

√ 2 + 1

  • for Z2

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 7 / 29

slide-36
SLIDE 36

Ising model: phase transition

Let G ⊂ Zd be a (2N + 1) × (2N + 1) square and Je = 1

T for some fixed T ∈ R>0.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 8 / 29

slide-37
SLIDE 37

Ising model: phase transition

Let G ⊂ Zd be a (2N + 1) × (2N + 1) square and Je = 1

T for some fixed T ∈ R>0.

Suppose that σu = +1 for all u ∈ ∂G.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 8 / 29

slide-38
SLIDE 38

Ising model: phase transition

Let G ⊂ Zd be a (2N + 1) × (2N + 1) square and Je = 1

T for some fixed T ∈ R>0.

Suppose that σu = +1 for all u ∈ ∂G. Let v be the vertex in the middle of the square. v

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 8 / 29

slide-39
SLIDE 39

Ising model: phase transition

Let G ⊂ Zd be a (2N + 1) × (2N + 1) square and Je = 1

T for some fixed T ∈ R>0.

Suppose that σu = +1 for all u ∈ ∂G. Let v be the vertex in the middle of the square. Define the spontaneous magnetization M(T) := lim

N→∞ (Prob(σv = +1) − Prob(σv = −1))

v

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 8 / 29

slide-40
SLIDE 40

Ising model: phase transition

Let G ⊂ Zd be a (2N + 1) × (2N + 1) square and Je = 1

T for some fixed T ∈ R>0.

Suppose that σu = +1 for all u ∈ ∂G. Let v be the vertex in the middle of the square. Define the spontaneous magnetization M(T) := lim

N→∞ (Prob(σv = +1) − Prob(σv = −1))

v

Theorem (Onsager (1944),Onsager–Kaufman (1949), Yang (1952))

T M(T) Tc

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 8 / 29

slide-41
SLIDE 41

Ising model: phase transition

Let G ⊂ Zd be a (2N + 1) × (2N + 1) square and Je = 1

T for some fixed T ∈ R>0.

Suppose that σu = +1 for all u ∈ ∂G. Let v be the vertex in the middle of the square. Define the spontaneous magnetization M(T) := lim

N→∞ (Prob(σv = +1) − Prob(σv = −1))

v

Theorem (Onsager (1944),Onsager–Kaufman (1949), Yang (1952))

T M(T) Tc ≍ (Tc − T)

1 8 Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 8 / 29

slide-42
SLIDE 42

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): no phase transition in 1D = ⇒ not a good model for ferromagnetism Historically, we let G := Zd ∩ Ω for some Ω ⊂ Rd and set all Je := 1

T for some temperature T ∈ R>0.

Peierls (1937): phase transition in Zd for d ≥ 2 Kramers–Wannier (1941): critical temperature

1 Tc = 1 2 log

√ 2 + 1

  • for Z2

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 9 / 29

slide-43
SLIDE 43

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): no phase transition in 1D = ⇒ not a good model for ferromagnetism Historically, we let G := Zd ∩ Ω for some Ω ⊂ Rd and set all Je := 1

T for some temperature T ∈ R>0.

Peierls (1937): phase transition in Zd for d ≥ 2 Kramers–Wannier (1941): critical temperature

1 Tc = 1 2 log

√ 2 + 1

  • for Z2

Onsager, Kaufman, Yang (1944–1952): exact expressions for the free energy and spontaneous magnetization

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 9 / 29

slide-44
SLIDE 44

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): no phase transition in 1D = ⇒ not a good model for ferromagnetism Historically, we let G := Zd ∩ Ω for some Ω ⊂ Rd and set all Je := 1

T for some temperature T ∈ R>0.

Peierls (1937): phase transition in Zd for d ≥ 2 Kramers–Wannier (1941): critical temperature

1 Tc = 1 2 log

√ 2 + 1

  • for Z2

Onsager, Kaufman, Yang (1944–1952): exact expressions for the free energy and spontaneous magnetization Belavin–Polyakov–Zamolodchikov (1984): conjectured conformal invariance of the scaling limit at T = Tc for Z2

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 9 / 29

slide-45
SLIDE 45

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): no phase transition in 1D = ⇒ not a good model for ferromagnetism Historically, we let G := Zd ∩ Ω for some Ω ⊂ Rd and set all Je := 1

T for some temperature T ∈ R>0.

Peierls (1937): phase transition in Zd for d ≥ 2 Kramers–Wannier (1941): critical temperature

1 Tc = 1 2 log

√ 2 + 1

  • for Z2

Onsager, Kaufman, Yang (1944–1952): exact expressions for the free energy and spontaneous magnetization Belavin–Polyakov–Zamolodchikov (1984): conjectured conformal invariance of the scaling limit at T = Tc for Z2 Smirnov, Chelkak, Hongler, Izyurov, ... (2010–2015): proved conformal invariance and universality of the scaling limit at T = Tc for Z2

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 9 / 29

slide-46
SLIDE 46

Ising model: boundary correlations

Recall: G is embedded in a disk. Let b1, . . . , bn be the boundary vertices.

b1 b2 b3 b4 b5 b6

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 10 / 29

slide-47
SLIDE 47

Ising model: boundary correlations

Recall: G is embedded in a disk. Let b1, . . . , bn be the boundary vertices. Correlation: σuσv := Prob(σu = σv) − Prob(σu = σv).

b1 b2 b3 b4 b5 b6

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 10 / 29

slide-48
SLIDE 48

Ising model: boundary correlations

Recall: G is embedded in a disk. Let b1, . . . , bn be the boundary vertices. Correlation: σuσv := Prob(σu = σv) − Prob(σu = σv).

Definition

Boundary correlation matrix: M(G, J) = (mij)n

i,j=1, where mij := σbiσbj.

b1 b2 b3 b4 b5 b6

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 10 / 29

slide-49
SLIDE 49

Ising model: boundary correlations

Recall: G is embedded in a disk. Let b1, . . . , bn be the boundary vertices. Correlation: σuσv := Prob(σu = σv) − Prob(σu = σv).

Definition

Boundary correlation matrix: M(G, J) = (mij)n

i,j=1, where mij := σbiσbj.

b1 b2 b3 b4 b5 b6

M(G, J) is a symmetric matrix

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 10 / 29

slide-50
SLIDE 50

Ising model: boundary correlations

Recall: G is embedded in a disk. Let b1, . . . , bn be the boundary vertices. Correlation: σuσv := Prob(σu = σv) − Prob(σu = σv).

Definition

Boundary correlation matrix: M(G, J) = (mij)n

i,j=1, where mij := σbiσbj.

b1 b2 b3 b4 b5 b6

M(G, J) is a symmetric matrix with 1’s on the diagonal

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 10 / 29

slide-51
SLIDE 51

Ising model: boundary correlations

Recall: G is embedded in a disk. Let b1, . . . , bn be the boundary vertices. Correlation: σuσv := Prob(σu = σv) − Prob(σu = σv).

Definition

Boundary correlation matrix: M(G, J) = (mij)n

i,j=1, where mij := σbiσbj.

b1 b2 b3 b4 b5 b6

M(G, J) is a symmetric matrix with 1’s on the diagonal and nonnegative entries

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 10 / 29

slide-52
SLIDE 52

Ising model: boundary correlations

Recall: G is embedded in a disk. Let b1, . . . , bn be the boundary vertices. Correlation: σuσv := Prob(σu = σv) − Prob(σu = σv).

Definition

Boundary correlation matrix: M(G, J) = (mij)n

i,j=1, where mij := σbiσbj.

b1 b2 b3 b4 b5 b6

M(G, J) is a symmetric matrix with 1’s on the diagonal and nonnegative entries Lives inside R(n

2) Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 10 / 29

slide-53
SLIDE 53

Ising model: boundary correlations

Recall: G is embedded in a disk. Let b1, . . . , bn be the boundary vertices. Correlation: σuσv := Prob(σu = σv) − Prob(σu = σv).

Definition

Boundary correlation matrix: M(G, J) = (mij)n

i,j=1, where mij := σbiσbj.

b1 b2 b3 b4 b5 b6

M(G, J) is a symmetric matrix with 1’s on the diagonal and nonnegative entries Lives inside R(n

2)

Xn := {M(G, J) | (G, J) is a planar Ising network with n boundary vertices}

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 10 / 29

slide-54
SLIDE 54

Ising model: boundary correlations

Recall: G is embedded in a disk. Let b1, . . . , bn be the boundary vertices. Correlation: σuσv := Prob(σu = σv) − Prob(σu = σv).

Definition

Boundary correlation matrix: M(G, J) = (mij)n

i,j=1, where mij := σbiσbj.

b1 b2 b3 b4 b5 b6

M(G, J) is a symmetric matrix with 1’s on the diagonal and nonnegative entries Lives inside R(n

2)

Xn := {M(G, J) | (G, J) is a planar Ising network with n boundary vertices} X n := closure of Xn inside the space of n × n matrices.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 10 / 29

slide-55
SLIDE 55

Boundary correlations: an example for n = 2

b2 b1

Je

b2 b1

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 11 / 29

slide-56
SLIDE 56

Boundary correlations: an example for n = 2

b2 b1

Je

b2 b1

M(G, J) = 1 m12 m12 1

  • Pavel Galashin (MIT)

Ising model and total positivity U of Toronto, 01/07/2019 11 / 29

slide-57
SLIDE 57

Boundary correlations: an example for n = 2

b2 b1

Je

b2 b1

M(G, J) = 1 m12 m12 1

  • ,

m12 = σ1σ2 = 2 exp(Je) − 2 exp(−Je) 2 exp(Je) + 2 exp(−Je)

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 11 / 29

slide-58
SLIDE 58

Boundary correlations: an example for n = 2

b2 b1

Je

b2 b1

M(G, J) = 1 m12 m12 1

  • ,

m12 = σ1σ2 = 2 exp(Je) − 2 exp(−Je) 2 exp(Je) + 2 exp(−Je) Je = 0 Je ∈ (0, ∞) Je = ∞ m12 = 0 m12 ∈ (0, 1) m12 = 1

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 11 / 29

slide-59
SLIDE 59

Boundary correlations: an example for n = 2

b2 b1

Je

b2 b1

M(G, J) = 1 m12 m12 1

  • ,

m12 = σ1σ2 = 2 exp(Je) − 2 exp(−Je) 2 exp(Je) + 2 exp(−Je) Je = 0 Je ∈ (0, ∞) Je = ∞ m12 = 0 m12 ∈ (0, 1) m12 = 1 We have X2 ∼ = [0, 1) and X 2 ∼ = [0, 1].

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 11 / 29

slide-60
SLIDE 60

Boundary correlations: an example for n = 2

b2 b1

Je

b2 b1

M(G, J) = 1 m12 m12 1

  • ,

m12 = σ1σ2 = 2 exp(Je) − 2 exp(−Je) 2 exp(Je) + 2 exp(−Je) Je = 0 Je ∈ (0, ∞) Je = ∞ m12 = 0 m12 ∈ (0, 1) m12 = 1 We have X2 ∼ = [0, 1) and X 2 ∼ = [0, 1]. Xn is neither open nor closed inside R(n

2). Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 11 / 29

slide-61
SLIDE 61

Boundary correlations: an example for n = 2

b2 b1

Je

b2 b1 b2 b1

M(G, J) = 1 m12 m12 1

  • ,

m12 = σ1σ2 = 2 exp(Je) − 2 exp(−Je) 2 exp(Je) + 2 exp(−Je) Je = 0 Je ∈ (0, ∞) Je = ∞ m12 = 0 m12 ∈ (0, 1) m12 = 1 We have X2 ∼ = [0, 1) and X 2 ∼ = [0, 1]. Xn is neither open nor closed inside R(n

2).

X n is obtained from Xn by allowing Je = ∞ (i.e., contracting edges).

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 11 / 29

slide-62
SLIDE 62

Part 2: Total positivity

slide-63
SLIDE 63

The totally nonnegative (TNN) Grassmannian

Gr(k, n) := {W ⊂ Rn | dim(W ) = k}.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 13 / 29

slide-64
SLIDE 64

The totally nonnegative (TNN) Grassmannian

Gr(k, n) := {W ⊂ Rn | dim(W ) = k}. Gr(k, n) := {k × n matrices of rank k}/(row operations).

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 13 / 29

slide-65
SLIDE 65

The totally nonnegative (TNN) Grassmannian

Gr(k, n) := {W ⊂ Rn | dim(W ) = k}. Gr(k, n) := {k × n matrices of rank k}/(row operations). Example: RowSpan 1 1 − 1 2 1 1

  • ∈ Gr(2, 4)

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 13 / 29

slide-66
SLIDE 66

The totally nonnegative (TNN) Grassmannian

Gr(k, n) := {W ⊂ Rn | dim(W ) = k}. Gr(k, n) := {k × n matrices of rank k}/(row operations). Example: RowSpan 1 1 − 1 2 1 1

  • ∈ Gr(2, 4)

Pl¨ ucker coordinates: for I ⊂ [n] := {1, 2, . . . , n} of size k,

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 13 / 29

slide-67
SLIDE 67

The totally nonnegative (TNN) Grassmannian

Gr(k, n) := {W ⊂ Rn | dim(W ) = k}. Gr(k, n) := {k × n matrices of rank k}/(row operations). Example: RowSpan 1 1 − 1 2 1 1

  • ∈ Gr(2, 4)

Pl¨ ucker coordinates: for I ⊂ [n] := {1, 2, . . . , n} of size k, ∆I := k × k minor with column set I.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 13 / 29

slide-68
SLIDE 68

The totally nonnegative (TNN) Grassmannian

Gr(k, n) := {W ⊂ Rn | dim(W ) = k}. Gr(k, n) := {k × n matrices of rank k}/(row operations). Example: RowSpan 1 1 − 1 2 1 1

  • ∈ Gr(2, 4)

∆13 = 1 ∆12 = 2 ∆14 = 1 ∆24 = 3 ∆34 = 1 ∆23 = 1. Pl¨ ucker coordinates: for I ⊂ [n] := {1, 2, . . . , n} of size k, ∆I := k × k minor with column set I.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 13 / 29

slide-69
SLIDE 69

The totally nonnegative (TNN) Grassmannian

Gr(k, n) := {W ⊂ Rn | dim(W ) = k}. Gr(k, n) := {k × n matrices of rank k}/(row operations). Example: RowSpan 1 1 − 1 2 1 1

  • ∈ Gr(2, 4)

∆13 = 1 ∆12 = 2 ∆14 = 1 ∆24 = 3 ∆34 = 1 ∆23 = 1. Pl¨ ucker coordinates: for I ⊂ [n] := {1, 2, . . . , n} of size k, ∆I := k × k minor with column set I.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 13 / 29

slide-70
SLIDE 70

The totally nonnegative (TNN) Grassmannian

Gr(k, n) := {W ⊂ Rn | dim(W ) = k}. Gr(k, n) := {k × n matrices of rank k}/(row operations). Example: RowSpan 1 1 − 1 2 1 1

  • ∈ Gr(2, 4)

∆13 = 1 ∆12 = 2 ∆14 = 1 ∆24 = 3 ∆34 = 1 ∆23 = 1. Pl¨ ucker coordinates: for I ⊂ [n] := {1, 2, . . . , n} of size k, ∆I := k × k minor with column set I.

Definition (Postnikov (2006))

The totally nonnegative Grassmannian is Gr≥0(k, n) := {W ∈ Gr(k, n) | ∆I(W ) ≥ 0 for all I}.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 13 / 29

slide-71
SLIDE 71

The totally nonnegative (TNN) Grassmannian

Gr(k, n) := {W ⊂ Rn | dim(W ) = k}. Gr(k, n) := {k × n matrices of rank k}/(row operations). Example: RowSpan 1 1 − 1 2 1 1

  • ∈ Gr≥0(2, 4)

∆13 = 1 ∆12 = 2 ∆14 = 1 ∆24 = 3 ∆34 = 1 ∆23 = 1. Pl¨ ucker coordinates: for I ⊂ [n] := {1, 2, . . . , n} of size k, ∆I := k × k minor with column set I.

Definition (Postnikov (2006))

The totally nonnegative Grassmannian is Gr≥0(k, n) := {W ∈ Gr(k, n) | ∆I(W ) ≥ 0 for all I}.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 13 / 29

slide-72
SLIDE 72

Example: Gr≥0(2, 4)

RowSpan 1 1 −1 2 1 1

  • ∈ Gr≥0(2, 4)

∆13 = 1, ∆24 = 3, ∆12 = 2, ∆34 = 1, ∆14 = 1, ∆23 = 1.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 14 / 29

slide-73
SLIDE 73

Example: Gr≥0(2, 4)

RowSpan 1 1 −1 2 1 1

  • ∈ Gr≥0(2, 4)

u1 u2 u3 u4 ∆13 = 1, ∆24 = 3, ∆12 = 2, ∆34 = 1, ∆14 = 1, ∆23 = 1.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 14 / 29

slide-74
SLIDE 74

Example: Gr≥0(2, 4)

RowSpan 1 1 −1 2 1 1

  • ∈ Gr≥0(2, 4)

u1 u2 u3 u4 u1 u2 u3 u4 ∆13 = 1, ∆24 = 3, ∆12 = 2, ∆34 = 1, ∆14 = 1, ∆23 = 1.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 14 / 29

slide-75
SLIDE 75

Example: Gr≥0(2, 4)

RowSpan 1 1 −1 2 1 1

  • ∈ Gr≥0(2, 4)

u1 u2 u3 u4 u1 u2 u3 u4 ∆13 = 1, ∆24 = 3, ∆12 = 2, ∆34 = 1, ∆14 = 1, ∆23 = 1. In Gr(2, 4), we have a Pl¨ ucker relation: ∆13∆24 = ∆12∆34 + ∆14∆23.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 14 / 29

slide-76
SLIDE 76

Example: Gr≥0(2, 4)

RowSpan 1 1 −1 2 1 1

  • ∈ Gr≥0(2, 4)

u1 u2 u3 u4 u1 u2 u3 u4 ∆13 = 1, ∆24 = 3, ∆12 = 2, ∆34 = 1, ∆14 = 1, ∆23 = 1. In Gr(2, 4), we have a Pl¨ ucker relation: ∆13∆24 = ∆12∆34 + ∆14∆23. Top cell: ∆13, ∆24, ∆12, ∆34, ∆14, ∆23 > 0

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 14 / 29

slide-77
SLIDE 77

Example: Gr≥0(2, 4)

RowSpan 1 1 −1 2 1 1

  • ∈ Gr≥0(2, 4)

u1 u2 u3 u4 u2 u3 u4 u1 ∆13 = 1, ∆24 = 3, ∆12 = 2, ∆34 = 1, ∆14 = 1, ∆23 = 1. In Gr(2, 4), we have a Pl¨ ucker relation: ∆13∆24 = ∆12∆34 + ∆14∆23. Top cell: ∆13, ∆24, ∆12, ∆34, ∆14, ∆23 > 0 Codimension 1 cells: ∆12 = 0

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 14 / 29

slide-78
SLIDE 78

Example: Gr≥0(2, 4)

RowSpan 1 1 −1 2 1 1

  • ∈ Gr≥0(2, 4)

u1 u2 u3 u4 u1 u2 u3 u4 ∆13 = 1, ∆24 = 3, ∆12 = 2, ∆34 = 1, ∆14 = 1, ∆23 = 1. In Gr(2, 4), we have a Pl¨ ucker relation: ∆13∆24 = ∆12∆34 + ∆14∆23. Top cell: ∆13, ∆24, ∆12, ∆34, ∆14, ∆23 > 0 Codimension 1 cells: ∆12 = 0

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 14 / 29

slide-79
SLIDE 79

Example: Gr≥0(2, 4)

RowSpan 1 1 −1 2 1 1

  • ∈ Gr≥0(2, 4)

u1 u2 u3 u4 u1 u2 u4 u3 ∆13 = 1, ∆24 = 3, ∆12 = 2, ∆34 = 1, ∆14 = 1, ∆23 = 1. In Gr(2, 4), we have a Pl¨ ucker relation: ∆13∆24 = ∆12∆34 + ∆14∆23. Top cell: ∆13, ∆24, ∆12, ∆34, ∆14, ∆23 > 0 Codimension 1 cells: ∆12 = 0, ∆23 = 0

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 14 / 29

slide-80
SLIDE 80

Example: Gr≥0(2, 4)

RowSpan 1 1 −1 2 1 1

  • ∈ Gr≥0(2, 4)

u1 u2 u3 u4 u1 u2 u3 u4 ∆13 = 1, ∆24 = 3, ∆12 = 2, ∆34 = 1, ∆14 = 1, ∆23 = 1. In Gr(2, 4), we have a Pl¨ ucker relation: ∆13∆24 = ∆12∆34 + ∆14∆23. Top cell: ∆13, ∆24, ∆12, ∆34, ∆14, ∆23 > 0 Codimension 1 cells: ∆12 = 0, ∆23 = 0

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 14 / 29

slide-81
SLIDE 81

Example: Gr≥0(2, 4)

RowSpan 1 1 −1 2 1 1

  • ∈ Gr≥0(2, 4)

u1 u2 u3 u4 u1 u2 u4 u3 ∆13 = 1, ∆24 = 3, ∆12 = 2, ∆34 = 1, ∆14 = 1, ∆23 = 1. In Gr(2, 4), we have a Pl¨ ucker relation: ∆13∆24 = ∆12∆34 + ∆14∆23. Top cell: ∆13, ∆24, ∆12, ∆34, ∆14, ∆23 > 0 Codimension 1 cells: ∆12 = 0, ∆23 = 0, ∆34 = 0

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 14 / 29

slide-82
SLIDE 82

Example: Gr≥0(2, 4)

RowSpan 1 1 −1 2 1 1

  • ∈ Gr≥0(2, 4)

u1 u2 u3 u4 u1 u2 u3 u4 ∆13 = 1, ∆24 = 3, ∆12 = 2, ∆34 = 1, ∆14 = 1, ∆23 = 1. In Gr(2, 4), we have a Pl¨ ucker relation: ∆13∆24 = ∆12∆34 + ∆14∆23. Top cell: ∆13, ∆24, ∆12, ∆34, ∆14, ∆23 > 0 Codimension 1 cells: ∆12 = 0, ∆23 = 0, ∆34 = 0

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 14 / 29

slide-83
SLIDE 83

Example: Gr≥0(2, 4)

RowSpan 1 1 −1 2 1 1

  • ∈ Gr≥0(2, 4)

u1 u2 u3 u4 u1 u2 u3 u4 ∆13 = 1, ∆24 = 3, ∆12 = 2, ∆34 = 1, ∆14 = 1, ∆23 = 1. In Gr(2, 4), we have a Pl¨ ucker relation: ∆13∆24 = ∆12∆34 + ∆14∆23. Top cell: ∆13, ∆24, ∆12, ∆34, ∆14, ∆23 > 0 Codimension 1 cells: ∆12 = 0, ∆23 = 0, ∆34 = 0, ∆14 = 0.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 14 / 29

slide-84
SLIDE 84

Example: Gr≥0(2, 4)

RowSpan 1 1 −1 2 1 1

  • ∈ Gr≥0(2, 4)

u1 u2 u3 u4 u1 u2 u3 u4 ∆13 = 1, ∆24 = 3, ∆12 = 2, ∆34 = 1, ∆14 = 1, ∆23 = 1. In Gr(2, 4), we have a Pl¨ ucker relation: ∆13∆24 = ∆12∆34 + ∆14∆23. Top cell: ∆13, ∆24, ∆12, ∆34, ∆14, ∆23 > 0 Codimension 1 cells: ∆12 = 0, ∆23 = 0, ∆34 = 0, ∆14 = 0.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 14 / 29

slide-85
SLIDE 85

Example: Gr≥0(2, 4)

RowSpan 1 1 −1 2 1 1

  • ∈ Gr≥0(2, 4)

u1 u2 u3 u4 u2 u3 u4 u1 ∆13 = 1, ∆24 = 3, ∆12 = 2, ∆34 = 1, ∆14 = 1, ∆23 = 1. In Gr(2, 4), we have a Pl¨ ucker relation: ∆13∆24 = ∆12∆34 + ∆14∆23. Top cell: ∆13, ∆24, ∆12, ∆34, ∆14, ∆23 > 0 Codimension 1 cells: ∆12 = 0, ∆23 = 0, ∆34 = 0, ∆14 = 0. Codimension 2 cell: ∆12 = ∆14 = ∆24 = 0.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 14 / 29

slide-86
SLIDE 86

The topology of Gr≥0(k, n)

Theorem (Postnikov (2006))

Each boundary cell (some ∆I > 0 and the rest ∆J = 0) is an open ball.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 15 / 29

slide-87
SLIDE 87

The topology of Gr≥0(k, n)

Theorem (Postnikov (2006))

Each boundary cell (some ∆I > 0 and the rest ∆J = 0) is an open ball.

Conjecture (Postnikov (2006))

The closure of each boundary cell is homeomorphic to a closed ball.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 15 / 29

slide-88
SLIDE 88

The topology of Gr≥0(k, n)

Theorem (Postnikov (2006))

Each boundary cell (some ∆I > 0 and the rest ∆J = 0) is an open ball.

Conjecture (Postnikov (2006))

The closure of each boundary cell is homeomorphic to a closed ball. Williams (2007),

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 15 / 29

slide-89
SLIDE 89

The topology of Gr≥0(k, n)

Theorem (Postnikov (2006))

Each boundary cell (some ∆I > 0 and the rest ∆J = 0) is an open ball.

Conjecture (Postnikov (2006))

The closure of each boundary cell is homeomorphic to a closed ball. Williams (2007), Postnikov–Speyer–Williams (2009),

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 15 / 29

slide-90
SLIDE 90

The topology of Gr≥0(k, n)

Theorem (Postnikov (2006))

Each boundary cell (some ∆I > 0 and the rest ∆J = 0) is an open ball.

Conjecture (Postnikov (2006))

The closure of each boundary cell is homeomorphic to a closed ball. Williams (2007), Postnikov–Speyer–Williams (2009), Rietsch–Williams (2010).

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 15 / 29

slide-91
SLIDE 91

The topology of Gr≥0(k, n)

Theorem (Postnikov (2006))

Each boundary cell (some ∆I > 0 and the rest ∆J = 0) is an open ball.

Conjecture (Postnikov (2006))

The closure of each boundary cell is homeomorphic to a closed ball. Williams (2007), Postnikov–Speyer–Williams (2009), Rietsch–Williams (2010).

Theorem (G.–Karp–Lam (2017))

Gr≥0(k, n) is homeomorphic to a k(n − k)-dimensional closed ball.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 15 / 29

slide-92
SLIDE 92

The topology of Gr≥0(k, n)

Theorem (Postnikov (2006))

Each boundary cell (some ∆I > 0 and the rest ∆J = 0) is an open ball.

Conjecture (Postnikov (2006))

The closure of each boundary cell is homeomorphic to a closed ball. Williams (2007), Postnikov–Speyer–Williams (2009), Rietsch–Williams (2010).

Theorem (G.–Karp–Lam (2017))

Gr≥0(k, n) is homeomorphic to a k(n − k)-dimensional closed ball.

Theorem (G.–Karp–Lam (2019+))

The closure of each boundary cell is homeomorphic to a closed ball.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 15 / 29

slide-93
SLIDE 93

The topology of Gr≥0(k, n)

Theorem (Postnikov (2006))

Each boundary cell (some ∆I > 0 and the rest ∆J = 0) is an open ball.

Conjecture (Postnikov (2006))

The closure of each boundary cell is homeomorphic to a closed ball. Williams (2007), Postnikov–Speyer–Williams (2009), Rietsch–Williams (2010).

Theorem (G.–Karp–Lam (2017))

Gr≥0(k, n) is homeomorphic to a k(n − k)-dimensional closed ball.

Theorem (G.–Karp–Lam (2019+))

The closure of each boundary cell is homeomorphic to a closed ball.

Theorem (Smale (1960), Freedman (1982), Perelman (2003))

Let C be a compact contractible topological manifold whose boundary is homeomorphic to a sphere. Then C is homeomorphic to a closed ball.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 15 / 29

slide-94
SLIDE 94

The totally nonnegative orthogonal Grassmannian

Gr≥0(k, n) ← → amplituhedron ← → N = 4 supersymmetric Yang–Mills theory

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 16 / 29

slide-95
SLIDE 95

The totally nonnegative orthogonal Grassmannian

Gr≥0(k, n) ← → amplituhedron ← → N = 4 supersymmetric Yang–Mills theory OG≥0(n, 2n) ← →

?

← → N = 6 supersymmetric Chern-Simons matter theory

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 16 / 29

slide-96
SLIDE 96

The totally nonnegative orthogonal Grassmannian

Gr≥0(k, n) ← → amplituhedron ← → N = 4 supersymmetric Yang–Mills theory OG≥0(n, 2n) ← →

?

← → N = 6 supersymmetric Chern-Simons matter theory

Recall: Gr≥0(k, n) := {W ∈ Gr(k, n) | ∆I(W ) ≥ 0 for all I}.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 16 / 29

slide-97
SLIDE 97

The totally nonnegative orthogonal Grassmannian

Gr≥0(k, n) ← → amplituhedron ← → N = 4 supersymmetric Yang–Mills theory OG≥0(n, 2n) ← →

?

← → N = 6 supersymmetric Chern-Simons matter theory

Recall: Gr≥0(k, n) := {W ∈ Gr(k, n) | ∆I(W ) ≥ 0 for all I}. The orthogonal Grassmannian: OG(n, 2n) := {W ∈ Gr(n, 2n) | ∆I(W ) = ∆[2n]\I(W ) for all I}.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 16 / 29

slide-98
SLIDE 98

The totally nonnegative orthogonal Grassmannian

Gr≥0(k, n) ← → amplituhedron ← → N = 4 supersymmetric Yang–Mills theory OG≥0(n, 2n) ← →

?

← → N = 6 supersymmetric Chern-Simons matter theory

Recall: Gr≥0(k, n) := {W ∈ Gr(k, n) | ∆I(W ) ≥ 0 for all I}. The orthogonal Grassmannian: OG(n, 2n) := {W ∈ Gr(n, 2n) | ∆I(W ) = ∆[2n]\I(W ) for all I}.

Definition (Huang–Wen (2013))

The totally nonnegative orthogonal Grassmannian: OG≥0(n, 2n) := OG(n, 2n) ∩ Gr≥0(n, 2n)

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 16 / 29

slide-99
SLIDE 99

The totally nonnegative orthogonal Grassmannian

Gr≥0(k, n) ← → amplituhedron ← → N = 4 supersymmetric Yang–Mills theory OG≥0(n, 2n) ← →

?

← → N = 6 supersymmetric Chern-Simons matter theory

Recall: Gr≥0(k, n) := {W ∈ Gr(k, n) | ∆I(W ) ≥ 0 for all I}. The orthogonal Grassmannian: OG(n, 2n) := {W ∈ Gr(n, 2n) | ∆I(W ) = ∆[2n]\I(W ) for all I}.

Definition (Huang–Wen (2013))

The totally nonnegative orthogonal Grassmannian: OG≥0(n, 2n) := OG(n, 2n) ∩ Gr≥0(n, 2n), i.e., OG≥0(n, 2n) := {W ∈ Gr(n, 2n) | ∆I(W ) = ∆[2n]\I(W ) ≥ 0 for all I}.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 16 / 29

slide-100
SLIDE 100

The totally nonnegative orthogonal Grassmannian

Gr≥0(k, n) ← → amplituhedron ← → N = 4 supersymmetric Yang–Mills theory OG≥0(n, 2n) ← →

?

← → N = 6 supersymmetric Chern-Simons matter theory

Recall: Gr≥0(k, n) := {W ∈ Gr(k, n) | ∆I(W ) ≥ 0 for all I}. The orthogonal Grassmannian: OG(n, 2n) := {W ∈ Gr(n, 2n) | ∆I(W ) = ∆[2n]\I(W ) for all I}.

Definition (Huang–Wen (2013))

The totally nonnegative orthogonal Grassmannian: OG≥0(n, 2n) := OG(n, 2n) ∩ Gr≥0(n, 2n), i.e., OG≥0(n, 2n) := {W ∈ Gr(n, 2n) | ∆I(W ) = ∆[2n]\I(W ) ≥ 0 for all I}. dim(Gr≥0(n, 2n)) = n2

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 16 / 29

slide-101
SLIDE 101

The totally nonnegative orthogonal Grassmannian

Gr≥0(k, n) ← → amplituhedron ← → N = 4 supersymmetric Yang–Mills theory OG≥0(n, 2n) ← →

?

← → N = 6 supersymmetric Chern-Simons matter theory

Recall: Gr≥0(k, n) := {W ∈ Gr(k, n) | ∆I(W ) ≥ 0 for all I}. The orthogonal Grassmannian: OG(n, 2n) := {W ∈ Gr(n, 2n) | ∆I(W ) = ∆[2n]\I(W ) for all I}.

Definition (Huang–Wen (2013))

The totally nonnegative orthogonal Grassmannian: OG≥0(n, 2n) := OG(n, 2n) ∩ Gr≥0(n, 2n), i.e., OG≥0(n, 2n) := {W ∈ Gr(n, 2n) | ∆I(W ) = ∆[2n]\I(W ) ≥ 0 for all I}. dim(Gr≥0(n, 2n)) = n2 dim(OG≥0(n, 2n)) = n

2

  • = n(n−1)

2

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 16 / 29

slide-102
SLIDE 102

Main result

Xn := {M(G, J) | (G, J) is a planar Ising network with n boundary vertices} X n := closure of Xn inside the space of n × n matrices.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 17 / 29

slide-103
SLIDE 103

Main result

Xn := {M(G, J) | (G, J) is a planar Ising network with n boundary vertices} X n := closure of Xn inside the space of n × n matrices. We have Xn, X n ⊂ Matsym

n

(R, 1) := symmetric n × n matrices with 1’s on the diagonal

  • .

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 17 / 29

slide-104
SLIDE 104

Main result

Xn := {M(G, J) | (G, J) is a planar Ising network with n boundary vertices} X n := closure of Xn inside the space of n × n matrices. We have Xn, X n ⊂ Matsym

n

(R, 1) := symmetric n × n matrices with 1’s on the diagonal

  • .

Definition

The doubling map φ:

    1 m12 m13 m14 m12 1 m23 m24 m13 m23 1 m34 m14 m24 m34 1     →     1 1 m12 − m12 − m13 m13 m14 − m14 − m12 m12 1 1 m23 − m23 − m24 m24 m13 − m13 − m23 m23 1 1 m34 − m34 − m14 m14 m24 − m24 − m34 m34 1 1    

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 17 / 29

slide-105
SLIDE 105

Main result

Xn := {M(G, J) | (G, J) is a planar Ising network with n boundary vertices} X n := closure of Xn inside the space of n × n matrices. We have Xn, X n ⊂ Matsym

n

(R, 1) := symmetric n × n matrices with 1’s on the diagonal

  • .

Definition

The doubling map φ:

    1 m12 m13 m14 m12 1 m23 m24 m13 m23 1 m34 m14 m24 m34 1     →     1 1 m12 − m12 − m13 m13 m14 − m14 − m12 m12 1 1 m23 − m23 − m24 m24 m13 − m13 − m23 m23 1 1 m34 − m34 − m14 m14 m24 − m24 − m34 m34 1 1    

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 17 / 29

slide-106
SLIDE 106

Main result

Xn := {M(G, J) | (G, J) is a planar Ising network with n boundary vertices} X n := closure of Xn inside the space of n × n matrices. We have Xn, X n ⊂ Matsym

n

(R, 1) := symmetric n × n matrices with 1’s on the diagonal

  • .

Definition

The doubling map φ:

    1 m12 m13 m14 m12 1 m23 m24 m13 m23 1 m34 m14 m24 m34 1     →     1 1 m12 − m12 − m13 m13 m14 − m14 − m12 m12 1 1 m23 − m23 − m24 m24 m13 − m13 − m23 m23 1 1 m34 − m34 − m14 m14 m24 − m24 − m34 m34 1 1    

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 17 / 29

slide-107
SLIDE 107

Main result

Xn := {M(G, J) | (G, J) is a planar Ising network with n boundary vertices} X n := closure of Xn inside the space of n × n matrices. We have Xn, X n ⊂ Matsym

n

(R, 1) := symmetric n × n matrices with 1’s on the diagonal

  • .

Definition

The doubling map φ:

    1 m12 m13 m14 m12 1 m23 m24 m13 m23 1 m34 m14 m24 m34 1     →     1 1 m12 − m12 − m13 m13 m14 − m14 − m12 m12 1 1 m23 − m23 − m24 m24 m13 − m13 − m23 m23 1 1 m34 − m34 − m14 m14 m24 − m24 − m34 m34 1 1    

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 17 / 29

slide-108
SLIDE 108

Main result

Xn := {M(G, J) | (G, J) is a planar Ising network with n boundary vertices} X n := closure of Xn inside the space of n × n matrices. We have Xn, X n ⊂ Matsym

n

(R, 1) := symmetric n × n matrices with 1’s on the diagonal

  • .

Definition

The doubling map φ:

    1 m12 m13 m14 m12 1 m23 m24 m13 m23 1 m34 m14 m24 m34 1     →     1 1 m12 − m12 − m13 m13 m14 − m14 − m12 m12 1 1 m23 − m23 − m24 m24 m13 − m13 − m23 m23 1 1 m34 − m34 − m14 m14 m24 − m24 − m34 m34 1 1    

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 17 / 29

slide-109
SLIDE 109

Main result

Xn := {M(G, J) | (G, J) is a planar Ising network with n boundary vertices} X n := closure of Xn inside the space of n × n matrices. We have Xn, X n ⊂ Matsym

n

(R, 1) := symmetric n × n matrices with 1’s on the diagonal

  • .

Definition

The doubling map φ:

    1 m12 m13 m14 m12 1 m23 m24 m13 m23 1 m34 m14 m24 m34 1     →     1 1 m12 − m12 − m13 m13 m14 − m14 − m12 m12 1 1 m23 − m23 − m24 m24 m13 − m13 − m23 m23 1 1 m34 − m34 − m14 m14 m24 − m24 − m34 m34 1 1    

Theorem (G.–Pylyavskyy (2018))

Matsym

n

(R, 1) OG(n, 2n) X n OG≥0(n, 2n) φ

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 17 / 29

slide-110
SLIDE 110

Main result

Xn := {M(G, J) | (G, J) is a planar Ising network with n boundary vertices} X n := closure of Xn inside the space of n × n matrices. We have Xn, X n ⊂ Matsym

n

(R, 1) := symmetric n × n matrices with 1’s on the diagonal

  • .

Definition

The doubling map φ:

    1 m12 m13 m14 m12 1 m23 m24 m13 m23 1 m34 m14 m24 m34 1     →     1 1 m12 − m12 − m13 m13 m14 − m14 − m12 m12 1 1 m23 − m23 − m24 m24 m13 − m13 − m23 m23 1 1 m34 − m34 − m14 m14 m24 − m24 − m34 m34 1 1    

Theorem (G.–Pylyavskyy (2018))

  • The map φ restricts to a homeomorphism

between X n and OG≥0(n, 2n).

Matsym

n

(R, 1) OG(n, 2n) X n OG≥0(n, 2n) φ

φ

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 17 / 29

slide-111
SLIDE 111

Main result

Xn := {M(G, J) | (G, J) is a planar Ising network with n boundary vertices} X n := closure of Xn inside the space of n × n matrices. We have Xn, X n ⊂ Matsym

n

(R, 1) := symmetric n × n matrices with 1’s on the diagonal

  • .

Definition

The doubling map φ:

    1 m12 m13 m14 m12 1 m23 m24 m13 m23 1 m34 m14 m24 m34 1     →     1 1 m12 − m12 − m13 m13 m14 − m14 − m12 m12 1 1 m23 − m23 − m24 m24 m13 − m13 − m23 m23 1 1 m34 − m34 − m14 m14 m24 − m24 − m34 m34 1 1    

Theorem (G.–Pylyavskyy (2018))

  • The map φ restricts to a homeomorphism

between X n and OG≥0(n, 2n).

  • Each of the spaces is homeomorphic

to an n

2

  • dimensional closed ball.

Matsym

n

(R, 1) OG(n, 2n) X n OG≥0(n, 2n) φ

φ

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 17 / 29

slide-112
SLIDE 112

Example: n = 2

Theorem (G.–Pylyavskyy (2018))

  • The map φ restricts to a homeomorphism

between X n and OG≥0(n, 2n).

  • Each of the spaces is homeomorphic

to an n

2

  • dimensional closed ball.

Matsym

n

(R, 1) OG(n, 2n) X n OG≥0(n, 2n) φ

φ

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 18 / 29

slide-113
SLIDE 113

Example: n = 2

Theorem (G.–Pylyavskyy (2018))

  • The map φ restricts to a homeomorphism

between X n and OG≥0(n, 2n).

  • Each of the spaces is homeomorphic

to an n

2

  • dimensional closed ball.

Matsym

n

(R, 1) OG(n, 2n) X n OG≥0(n, 2n) φ

φ

Je

b2 b1

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 18 / 29

slide-114
SLIDE 114

Example: n = 2

Theorem (G.–Pylyavskyy (2018))

  • The map φ restricts to a homeomorphism

between X n and OG≥0(n, 2n).

  • Each of the spaces is homeomorphic

to an n

2

  • dimensional closed ball.

Matsym

n

(R, 1) OG(n, 2n) X n OG≥0(n, 2n) φ

φ

Je

b2 b1

M(G, J) = 1 m m 1

  • Pavel Galashin (MIT)

Ising model and total positivity U of Toronto, 01/07/2019 18 / 29

slide-115
SLIDE 115

Example: n = 2

Theorem (G.–Pylyavskyy (2018))

  • The map φ restricts to a homeomorphism

between X n and OG≥0(n, 2n).

  • Each of the spaces is homeomorphic

to an n

2

  • dimensional closed ball.

Matsym

n

(R, 1) OG(n, 2n) X n OG≥0(n, 2n) φ

φ

Je

b2 b1

M(G, J) = 1 m m 1

  • X 2 :

0 ≤ m ≤ 1

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 18 / 29

slide-116
SLIDE 116

Example: n = 2

Theorem (G.–Pylyavskyy (2018))

  • The map φ restricts to a homeomorphism

between X n and OG≥0(n, 2n).

  • Each of the spaces is homeomorphic

to an n

2

  • dimensional closed ball.

Matsym

n

(R, 1) OG(n, 2n) X n OG≥0(n, 2n) φ

φ

Je

b2 b1

M(G, J) = 1 m m 1

  • X 2 :

0 ≤ m ≤ 1 → 1 1 m −m −m m 1 1

  • Pavel Galashin (MIT)

Ising model and total positivity U of Toronto, 01/07/2019 18 / 29

slide-117
SLIDE 117

Example: n = 2

Theorem (G.–Pylyavskyy (2018))

  • The map φ restricts to a homeomorphism

between X n and OG≥0(n, 2n).

  • Each of the spaces is homeomorphic

to an n

2

  • dimensional closed ball.

Matsym

n

(R, 1) OG(n, 2n) X n OG≥0(n, 2n) φ

φ

Je

b2 b1

M(G, J) = 1 m m 1

  • X 2 :

0 ≤ m ≤ 1 → 1 1 m −m −m m 1 1

  • ∆13 = 1 + m2,

∆12 = 2m, ∆14 = 1 − m2 ∆24 = 1 + m2, ∆34 = 2m, ∆23 = 1 − m2

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 18 / 29

slide-118
SLIDE 118

Example: n = 2

Theorem (G.–Pylyavskyy (2018))

  • The map φ restricts to a homeomorphism

between X n and OG≥0(n, 2n).

  • Each of the spaces is homeomorphic

to an n

2

  • dimensional closed ball.

Matsym

n

(R, 1) OG(n, 2n) X n OG≥0(n, 2n) φ

φ

Je

b2 b1

M(G, J) = 1 m m 1

  • X 2 :

0 ≤ m ≤ 1 → 1 1 m −m −m m 1 1

  • ∆13 = 1 + m2,

∆12 = 2m, ∆14 = 1 − m2 ∆24 = 1 + m2, ∆34 = 2m, ∆23 = 1 − m2

∈ OG≥0(2, 4)

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 18 / 29

slide-119
SLIDE 119

Kramers–Wannier’s duality

slide-120
SLIDE 120

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): no phase transition in 1D = ⇒ not a good model for ferromagnetism Historically, we let G := Zd ∩ Ω for some Ω ⊂ Rd and set all Je := 1

T for some temperature T ∈ R>0.

Peierls (1937): phase transition in Zd for d ≥ 2 Kramers–Wannier (1941): critical temperature

1 Tc = 1 2 log

√ 2 + 1

  • for Z2

Onsager, Kaufman, Yang (1944–1952): exact expressions for the free energy and spontaneous magnetization Belavin–Polyakov–Zamolodchikov (1984): conjectured conformal invariance of the scaling limit at T = Tc for Z2 Smirnov, Chelkak, Hongler, Izyurov, ... (2010–2015): proved conformal invariance and universality of the scaling limit at T = Tc for Z2

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 20 / 29

slide-121
SLIDE 121

Ising model: history

Suggested by by W. Lenz to his student E. Ising in 1920 Ising (1925): no phase transition in 1D = ⇒ not a good model for ferromagnetism Historically, we let G := Zd ∩ Ω for some Ω ⊂ Rd and set all Je := 1

T for some temperature T ∈ R>0.

Peierls (1937): phase transition in Zd for d ≥ 2 Kramers–Wannier (1941): critical temperature

1 Tc = 1 2 log

√ 2 + 1

  • for Z2

Onsager, Kaufman, Yang (1944–1952): exact expressions for the free energy and spontaneous magnetization Belavin–Polyakov–Zamolodchikov (1984): conjectured conformal invariance of the scaling limit at T = Tc for Z2 Smirnov, Chelkak, Hongler, Izyurov, ... (2010–2015): proved conformal invariance and universality of the scaling limit at T = Tc for Z2

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 20 / 29

slide-122
SLIDE 122

Kramers–Wannier’s duality

b1 b2 b3 b4 b5 b6

e1 e2 e3 e4 e5 e6 e7 e8 e9

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 21 / 29

slide-123
SLIDE 123

Kramers–Wannier’s duality

KWD

− − − →

b1 b2 b3 b4 b5 b6

e1 e2 e3 e4 e5 e6 e7 e8 e9

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 21 / 29

slide-124
SLIDE 124

Kramers–Wannier’s duality

KWD

− − − →

b1 b2 b3 b4 b5 b6

e1 e2 e3 e4 e5 e6 e7 e8 e9 b∗

1

b∗

2

b∗

3

b∗

4

b∗

5

b∗

6

e∗

2

e∗

1

e∗

3

e∗

8

e∗

9

e∗

7

e∗

6

e∗

5

e∗

4

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 21 / 29

slide-125
SLIDE 125

Kramers–Wannier’s duality

KWD

− − − →

b1 b2 b3 b4 b5 b6

e1 e2 e3 e4 e5 e6 e7 e8 e9 b∗

1

b∗

2

b∗

3

b∗

4

b∗

5

b∗

6

e∗

2

e∗

1

e∗

3

e∗

8

e∗

9

e∗

7

e∗

6

e∗

5

e∗

4

Here Je∗ is defined by sinh(2Je) sinh(2Je∗) = 1.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 21 / 29

slide-126
SLIDE 126

Kramers–Wannier’s duality

KWD

− − − →

b1 b2 b3 b4 b5 b6

e1 e2 e3 e4 e5 e6 e7 e8 e9 b∗

1

b∗

2

b∗

3

b∗

4

b∗

5

b∗

6

e∗

2

e∗

1

e∗

3

e∗

8

e∗

9

e∗

7

e∗

6

e∗

5

e∗

4

Here Je∗ is defined by sinh(2Je) sinh(2Je∗) = 1. Q: what happens if we apply the duality twice?

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 21 / 29

slide-127
SLIDE 127

Kramers–Wannier’s duality

KWD

− − − →

b1 b2 b3 b4 b5 b6

e1 e2 e3 e4 e5 e6 e7 e8 e9 b∗

1

b∗

2

b∗

3

b∗

4

b∗

5

b∗

6

e∗

2

e∗

1

e∗

3

e∗

8

e∗

9

e∗

7

e∗

6

e∗

5

e∗

4

Here Je∗ is defined by sinh(2Je) sinh(2Je∗) = 1. Q: what happens if we apply the duality twice?

( K W D )

2

− − − − − →

b6 b1 b2 b3 b4 b5

e1 e2 e3 e4 e5 e6 e7 e8 e9

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 21 / 29

slide-128
SLIDE 128

Kramers–Wannier’s duality

KWD

− − − →

b1 b2 b3 b4 b5 b6

e1 e2 e3 e4 e5 e6 e7 e8 e9 b∗

1

b∗

2

b∗

3

b∗

4

b∗

5

b∗

6

e∗

2

e∗

1

e∗

3

e∗

8

e∗

9

e∗

7

e∗

6

e∗

5

e∗

4

Here Je∗ is defined by sinh(2Je) sinh(2Je∗) = 1. Q: what happens if we apply the duality twice?

( K W D )

2

− − − − − →

b6 b1 b2 b3 b4 b5

e1 e2 e3 e4 e5 e6 e7 e8 e9

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 21 / 29

slide-129
SLIDE 129

Kramers–Wannier’s duality

KWD

− − − →

b1 b2 b3 b4 b5 b6

e1 e2 e3 e4 e5 e6 e7 e8 e9 b∗

1

b∗

2

b∗

3

b∗

4

b∗

5

b∗

6

e∗

2

e∗

1

e∗

3

e∗

8

e∗

9

e∗

7

e∗

6

e∗

5

e∗

4

Here Je∗ is defined by sinh(2Je) sinh(2Je∗) = 1. Q: what happens if we apply the duality twice? (KWD)2 = cyclic shift!

( K W D )

2

− − − − − →

b6 b1 b2 b3 b4 b5

e1 e2 e3 e4 e5 e6 e7 e8 e9

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 21 / 29

slide-130
SLIDE 130

Kramers–Wannier’s duality vs. critical temperature

Recall: Je∗ is defined by sinh(2Je) sinh(2Je∗) = 1.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 22 / 29

slide-131
SLIDE 131

Kramers–Wannier’s duality vs. critical temperature

Recall: Je∗ is defined by sinh(2Je) sinh(2Je∗) = 1. Preserves partition function Z

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 22 / 29

slide-132
SLIDE 132

Kramers–Wannier’s duality vs. critical temperature

Recall: Je∗ is defined by sinh(2Je) sinh(2Je∗) = 1. Preserves partition function Z Switches between high and low temperature expansions for Z

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 22 / 29

slide-133
SLIDE 133

Kramers–Wannier’s duality vs. critical temperature

Recall: Je∗ is defined by sinh(2Je) sinh(2Je∗) = 1. Preserves partition function Z Switches between high and low temperature expansions for Z Takes correlations to “disorder variables”

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 22 / 29

slide-134
SLIDE 134

Kramers–Wannier’s duality vs. critical temperature

Recall: Je∗ is defined by sinh(2Je) sinh(2Je∗) = 1. Preserves partition function Z Switches between high and low temperature expansions for Z Takes correlations to “disorder variables” The unique solution to sinh(2J) sinh(2J) = 1 is given by J = 1 2 log( √ 2 + 1)

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 22 / 29

slide-135
SLIDE 135

Kramers–Wannier’s duality vs. critical temperature

Recall: Je∗ is defined by sinh(2Je) sinh(2Je∗) = 1. Preserves partition function Z Switches between high and low temperature expansions for Z Takes correlations to “disorder variables” The unique solution to sinh(2J) sinh(2J) = 1 is given by J = 1 2 log( √ 2 + 1) Takes G = Z2 ∩ Ω to G ∗ ≈ (Z + 1

2)2 ∩ Ω

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 22 / 29

slide-136
SLIDE 136

Kramers–Wannier’s duality vs. critical temperature

Recall: Je∗ is defined by sinh(2Je) sinh(2Je∗) = 1. Preserves partition function Z Switches between high and low temperature expansions for Z Takes correlations to “disorder variables” The unique solution to sinh(2J) sinh(2J) = 1 is given by J = 1 2 log( √ 2 + 1) Takes G = Z2 ∩ Ω to G ∗ ≈ (Z + 1

2)2 ∩ Ω

Fixed point of KWD ↔ Ising model at critical temperature

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 22 / 29

slide-137
SLIDE 137

Cyclic shift on Gr≥0(k, n)

Theorem (G.–Karp–Lam (2017))

Gr≥0(k, n) is homeomorphic to a k(n − k)-dimensional closed ball.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 23 / 29

slide-138
SLIDE 138

Cyclic shift on Gr≥0(k, n)

Theorem (G.–Karp–Lam (2017))

Gr≥0(k, n) is homeomorphic to a k(n − k)-dimensional closed ball. Our proof involves a flow that contracts the whole Gr≥0(k, n) to the unique cyclically symmetric point X0 ∈ Gr≥0(k, n).

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 23 / 29

slide-139
SLIDE 139

Cyclic shift on Gr≥0(k, n)

Theorem (G.–Karp–Lam (2017))

Gr≥0(k, n) is homeomorphic to a k(n − k)-dimensional closed ball. Our proof involves a flow that contracts the whole Gr≥0(k, n) to the unique cyclically symmetric point X0 ∈ Gr≥0(k, n).

Cyclic shift S : Gr(k, n) → Gr(k, n), [w1|w2| . . . |wn] → [(−1)k−1wn|w1| . . . |wn−1].

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 23 / 29

slide-140
SLIDE 140

Cyclic shift on Gr≥0(k, n)

Theorem (G.–Karp–Lam (2017))

Gr≥0(k, n) is homeomorphic to a k(n − k)-dimensional closed ball. Our proof involves a flow that contracts the whole Gr≥0(k, n) to the unique cyclically symmetric point X0 ∈ Gr≥0(k, n).

Cyclic shift S : Gr(k, n) → Gr(k, n), [w1|w2| . . . |wn] → [(−1)k−1wn|w1| . . . |wn−1].

This map preserves Gr≥0(k, n).

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 23 / 29

slide-141
SLIDE 141

Cyclic shift on Gr≥0(k, n)

Theorem (G.–Karp–Lam (2017))

Gr≥0(k, n) is homeomorphic to a k(n − k)-dimensional closed ball. Our proof involves a flow that contracts the whole Gr≥0(k, n) to the unique cyclically symmetric point X0 ∈ Gr≥0(k, n).

Cyclic shift S : Gr(k, n) → Gr(k, n), [w1|w2| . . . |wn] → [(−1)k−1wn|w1| . . . |wn−1].

This map preserves Gr≥0(k, n). Example: For Gr≥0(2, 4), we have X0 = 1 −1 − √ 2 1 √ 2 1

  • S

− → √ 2 1 −1 1 √ 2 1

  • Pavel Galashin (MIT)

Ising model and total positivity U of Toronto, 01/07/2019 23 / 29

slide-142
SLIDE 142

Cyclic shift on Gr≥0(k, n)

Theorem (G.–Karp–Lam (2017))

Gr≥0(k, n) is homeomorphic to a k(n − k)-dimensional closed ball. Our proof involves a flow that contracts the whole Gr≥0(k, n) to the unique cyclically symmetric point X0 ∈ Gr≥0(k, n).

Cyclic shift S : Gr(k, n) → Gr(k, n), [w1|w2| . . . |wn] → [(−1)k−1wn|w1| . . . |wn−1].

This map preserves Gr≥0(k, n). Example: For Gr≥0(2, 4), we have X0 = 1 −1 − √ 2 1 √ 2 1

  • S

− → √ 2 1 −1 1 √ 2 1

  • S

− →

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 23 / 29

slide-143
SLIDE 143

Cyclic shift on Gr≥0(k, n)

Theorem (G.–Karp–Lam (2017))

Gr≥0(k, n) is homeomorphic to a k(n − k)-dimensional closed ball. Our proof involves a flow that contracts the whole Gr≥0(k, n) to the unique cyclically symmetric point X0 ∈ Gr≥0(k, n).

Cyclic shift S : Gr(k, n) → Gr(k, n), [w1|w2| . . . |wn] → [(−1)k−1wn|w1| . . . |wn−1].

This map preserves Gr≥0(k, n). Example: For Gr≥0(2, 4), we have X0 = 1 −1 − √ 2 1 √ 2 1

  • S

− → √ 2 1 −1 1 √ 2 1

  • = X0 ∈ Gr≥0(2, 4)

S

− →

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 23 / 29

slide-144
SLIDE 144

Cyclic shift on Gr≥0(k, n)

Theorem (G.–Karp–Lam (2017))

Gr≥0(k, n) is homeomorphic to a k(n − k)-dimensional closed ball. Our proof involves a flow that contracts the whole Gr≥0(k, n) to the unique cyclically symmetric point X0 ∈ Gr≥0(k, n).

Cyclic shift S : Gr(k, n) → Gr(k, n), [w1|w2| . . . |wn] → [(−1)k−1wn|w1| . . . |wn−1].

This map preserves Gr≥0(k, n). Example: For Gr≥0(2, 4), we have X0 = 1 −1 − √ 2 1 √ 2 1

  • S

− → √ 2 1 −1 1 √ 2 1

  • = X0 ∈ Gr≥0(2, 4)

∆13 = 2 ∆12 = √ 2 ∆14 = √ 2 ∆24 = 2 ∆34 = √ 2 ∆23 = √ 2.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 23 / 29

slide-145
SLIDE 145

Cyclic shift on Gr≥0(k, n)

Theorem (G.–Karp–Lam (2017))

Gr≥0(k, n) is homeomorphic to a k(n − k)-dimensional closed ball. Our proof involves a flow that contracts the whole Gr≥0(k, n) to the unique cyclically symmetric point X0 ∈ Gr≥0(k, n).

Cyclic shift S : Gr(k, n) → Gr(k, n), [w1|w2| . . . |wn] → [(−1)k−1wn|w1| . . . |wn−1].

This map preserves Gr≥0(k, n). Example: For Gr≥0(2, 4), we have X0 = 1 −1 − √ 2 1 √ 2 1

  • S

− → √ 2 1 −1 1 √ 2 1

  • = X0 ∈ OG≥0(2, 4)

∆13 = 2 ∆12 = √ 2 ∆14 = √ 2 ∆24 = 2 ∆34 = √ 2 ∆23 = √ 2.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 23 / 29

slide-146
SLIDE 146

Kramers–Wannier’s duality vs. cyclic shift

Theorem (G.–Pylyavskyy (2018))

  • The map φ restricts to a homeomorphism

between X n and OG≥0(n, 2n).

  • Each of the spaces is homeomorphic

to an n

2

  • dimensional closed ball.

Matsym

n

(R, 1) OG(n, 2n) X n OG≥0(n, 2n) φ

φ

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 24 / 29

slide-147
SLIDE 147

Kramers–Wannier’s duality vs. cyclic shift

Theorem (G.–Pylyavskyy (2018))

  • The map φ restricts to a homeomorphism

between X n and OG≥0(n, 2n).

  • Each of the spaces is homeomorphic

to an n

2

  • dimensional closed ball.

Matsym

n

(R, 1) OG(n, 2n) X n OG≥0(n, 2n) X n OG≥0(n, 2n) φ

φ

KWD S

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 24 / 29

slide-148
SLIDE 148

Kramers–Wannier’s duality vs. cyclic shift

Theorem (G.–Pylyavskyy (2018))

  • The map φ restricts to a homeomorphism

between X n and OG≥0(n, 2n).

  • Each of the spaces is homeomorphic

to an n

2

  • dimensional closed ball.
  • φ translates KWD : X n → X n into

the cyclic shift S on OG≥0(n, 2n)

Matsym

n

(R, 1) OG(n, 2n) X n OG≥0(n, 2n) X n OG≥0(n, 2n) φ

φ

φ

KWD S

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 24 / 29

slide-149
SLIDE 149

Kramers–Wannier’s duality vs. cyclic shift

Theorem (G.–Pylyavskyy (2018))

  • The map φ restricts to a homeomorphism

between X n and OG≥0(n, 2n).

  • Each of the spaces is homeomorphic

to an n

2

  • dimensional closed ball.
  • φ translates KWD : X n → X n into

the cyclic shift S on OG≥0(n, 2n)

  • There exists a unique matrix M0 ∈ X n

that is fixed by KWD.

Matsym

n

(R, 1) OG(n, 2n) X n OG≥0(n, 2n) X n OG≥0(n, 2n) φ

φ

φ

KWD S

∈ M0 ∈ X0

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 24 / 29

slide-150
SLIDE 150

Kramers–Wannier’s duality vs. cyclic shift

Theorem (G.–Pylyavskyy (2018))

  • The map φ restricts to a homeomorphism

between X n and OG≥0(n, 2n).

  • Each of the spaces is homeomorphic

to an n

2

  • dimensional closed ball.
  • φ translates KWD : X n → X n into

the cyclic shift S on OG≥0(n, 2n)

  • There exists a unique matrix M0 ∈ X n

that is fixed by KWD.

Matsym

n

(R, 1) OG(n, 2n) X n OG≥0(n, 2n) X n OG≥0(n, 2n) φ

φ

φ

KWD S

∈ M0 ∈ X0 Example:

Je

b2 b1

M0 ↔ Je = 1

2 log(

√ 2 + 1)

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 24 / 29

slide-151
SLIDE 151

Kramers–Wannier’s duality vs. cyclic shift

Theorem (G.–Pylyavskyy (2018))

  • The map φ restricts to a homeomorphism

between X n and OG≥0(n, 2n).

  • Each of the spaces is homeomorphic

to an n

2

  • dimensional closed ball.
  • φ translates KWD : X n → X n into

the cyclic shift S on OG≥0(n, 2n)

  • There exists a unique matrix M0 ∈ X n

that is fixed by KWD.

Matsym

n

(R, 1) OG(n, 2n) X n OG≥0(n, 2n) X n OG≥0(n, 2n) φ

φ

φ

KWD S

∈ M0 ∈ X0 Example:

Je

b2 b1

M0 ↔ Je = 1

2 log(

√ 2 + 1) Fixed point M0 of KWD ↔ Ising model at critical temperature ↔ X0?

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 24 / 29

slide-152
SLIDE 152

Kramers–Wannier’s duality vs. cyclic shift

Fixed point M0 of KWD ↔ Ising model at critical temperature ↔ X0?

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 25 / 29

slide-153
SLIDE 153

Kramers–Wannier’s duality vs. cyclic shift

Fixed point M0 of KWD ↔ Ising model at critical temperature ↔ X0? Let G = with n boundary vertices and Je := 1

2 log

√ 2 + 1

  • .

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 25 / 29

slide-154
SLIDE 154

Kramers–Wannier’s duality vs. cyclic shift

Fixed point M0 of KWD ↔ Ising model at critical temperature ↔ X0? Let G = with n boundary vertices and Je := 1

2 log

√ 2 + 1

  • .

Let M0 be the unique boundary n × n correlation matrix fixed by KWD.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 25 / 29

slide-155
SLIDE 155

Kramers–Wannier’s duality vs. cyclic shift

Fixed point M0 of KWD ↔ Ising model at critical temperature ↔ X0? Let G = with n boundary vertices and Je := 1

2 log

√ 2 + 1

  • .

Let M0 be the unique boundary n × n correlation matrix fixed by KWD.

Proposition (G.–Pylyavskyy (2018))

The entries of M0 = (mij)n

i,j=1 are given by mij =

  • I ∆I(X0)
  • I ′ ∆I ′(X0).

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 25 / 29

slide-156
SLIDE 156

Kramers–Wannier’s duality vs. cyclic shift

Fixed point M0 of KWD ↔ Ising model at critical temperature ↔ X0? Let G = with n boundary vertices and Je := 1

2 log

√ 2 + 1

  • .

Let M0 be the unique boundary n × n correlation matrix fixed by KWD.

Proposition (G.–Pylyavskyy (2018))

The entries of M0 = (mij)n

i,j=1 are given by mij =

  • I ∆I(X0)
  • I ′ ∆I ′(X0).

For I = {i1 < i2 < · · · < in}, we have ∆I(X0) =

  • i<j∈I

sin j − i 2n π

  • .

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 25 / 29

slide-157
SLIDE 157

Kramers–Wannier’s duality vs. cyclic shift

Fixed point M0 of KWD ↔ Ising model at critical temperature ↔ X0? Let G = with n boundary vertices and Je := 1

2 log

√ 2 + 1

  • .

Let M0 be the unique boundary n × n correlation matrix fixed by KWD.

Proposition (G.–Pylyavskyy (2018))

The entries of M0 = (mij)n

i,j=1 are given by mij =

  • I ∆I(X0)
  • I ′ ∆I ′(X0).

For I = {i1 < i2 < · · · < in}, we have ∆I(X0) =

  • i<j∈I

sin j − i 2n π

  • .

Question

How close is M0 to M(G, J)?

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 25 / 29

slide-158
SLIDE 158

Kramers–Wannier’s duality vs. cyclic shift

Fixed point M0 of KWD ↔ Ising model at critical temperature ↔ X0? Let G = with n boundary vertices and Je := 1

2 log

√ 2 + 1

  • .

Let M0 be the unique boundary n × n correlation matrix fixed by KWD.

Proposition (G.–Pylyavskyy (2018))

The entries of M0 = (mij)n

i,j=1 are given by mij =

  • I ∆I(X0)
  • I ′ ∆I ′(X0).

For I = {i1 < i2 < · · · < in}, we have ∆I(X0) =

  • i<j∈I

sin j − i 2n π

  • .

Question

How close is M0 to M(G, J)? Do they have the same scaling limit?

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 25 / 29

slide-159
SLIDE 159

Kramers–Wannier’s duality vs. cyclic shift

M0 for n = 2 . . . 20 For I = {i1 < i2 < · · · < in}, we have ∆I(X0) =

  • i<j∈I

sin j − i 2n π

  • .

Question

How close is M0 to M(G, J)? Do they have the same scaling limit?

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 25 / 29

slide-160
SLIDE 160

Kramers–Wannier’s duality vs. cyclic shift

M0 for n = 2 . . . 20 as n → ∞ M(G, J)

  • 2

1−cos(t)

For I = {i1 < i2 < · · · < in}, we have ∆I(X0) =

  • i<j∈I

sin j − i 2n π

  • .

Question

How close is M0 to M(G, J)? Do they have the same scaling limit?

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 25 / 29

slide-161
SLIDE 161

Electrical networks

Let R : E → R>0 be an assignment of resistances to the edges of G.

b1 b2 b3 b4 b5 b6

R1 R2 R3 R4 R5 R6 R7 R8 R9

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 26 / 29

slide-162
SLIDE 162

Electrical networks

Let R : E → R>0 be an assignment of resistances to the edges of G.

Definition

Electrical response matrix Λ(G, R) : Rn → Rn, sending voltages to currents.

b1 b2 b3 b4 b5 b6

R1 R2 R3 R4 R5 R6 R7 R8 R9

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 26 / 29

slide-163
SLIDE 163

Electrical networks

Let R : E → R>0 be an assignment of resistances to the edges of G.

Definition

Electrical response matrix Λ(G, R) : Rn → Rn, sending voltages to currents.

b1 b2 b3 b4 b5 b6

R1 R2 R3 R4 R5 R6 R7 R8 R9

Λ(G, R) is a symmetric matrix

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 26 / 29

slide-164
SLIDE 164

Electrical networks

Let R : E → R>0 be an assignment of resistances to the edges of G.

Definition

Electrical response matrix Λ(G, R) : Rn → Rn, sending voltages to currents.

b1 b2 b3 b4 b5 b6

R1 R2 R3 R4 R5 R6 R7 R8 R9

Λ(G, R) is a symmetric matrix with zero row sums

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 26 / 29

slide-165
SLIDE 165

Electrical networks

Let R : E → R>0 be an assignment of resistances to the edges of G.

Definition

Electrical response matrix Λ(G, R) : Rn → Rn, sending voltages to currents.

b1 b2 b3 b4 b5 b6

R1 R2 R3 R4 R5 R6 R7 R8 R9

Λ(G, R) is a symmetric matrix with zero row sums Lives inside R(n

2) Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 26 / 29

slide-166
SLIDE 166

Electrical networks

Let R : E → R>0 be an assignment of resistances to the edges of G.

Definition

Electrical response matrix Λ(G, R) : Rn → Rn, sending voltages to currents.

b1 b2 b3 b4 b5 b6

R1 R2 R3 R4 R5 R6 R7 R8 R9

Λ(G, R) is a symmetric matrix with zero row sums Lives inside R(n

2)

E n: compactification of the space of n × n electrical response matrices [Lam (2014)]

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 26 / 29

slide-167
SLIDE 167

Stratification: n = 2

Stratification: X n =

  • τ∈Match(2n)

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 27 / 29

slide-168
SLIDE 168

Stratification: n = 2

Stratification: X n =

  • τ∈Match(2n)

Xτ E n =

  • τ∈Match(2n)

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 27 / 29

slide-169
SLIDE 169

Stratification: n = 2

Stratification: X n =

  • τ∈Match(2n)

Xτ E n =

  • τ∈Match(2n)

b2 b1

Je

b2 b1 b2 b1

M(G, J) = 1 m12 m12 1

  • Je = 0

m12 = 0 Je ∈ (0, ∞) m12 ∈ (0, 1) Je = ∞ m12 = 1

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 27 / 29

slide-170
SLIDE 170

Stratification: n = 2

Stratification: X n =

  • τ∈Match(2n)

Xτ E n =

  • τ∈Match(2n)

b2 b1 d4 d3 d2 d1 b2 b1

M(G, J) = 1 m12 m12 1

  • Je = 0

m12 = 0 Je ∈ (0, ∞) m12 ∈ (0, 1) Je = ∞ m12 = 1

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 27 / 29

slide-171
SLIDE 171

Stratification: n = 2

Stratification: X n =

  • τ∈Match(2n)

Xτ E n =

  • τ∈Match(2n)

d4 d3 d2 d1 d4 d3 d2 d1 b2 b1

M(G, J) = 1 m12 m12 1

  • Je = 0

m12 = 0 Je ∈ (0, ∞) m12 ∈ (0, 1) Je = ∞ m12 = 1

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 27 / 29

slide-172
SLIDE 172

Stratification: n = 2

Stratification: X n =

  • τ∈Match(2n)

Xτ E n =

  • τ∈Match(2n)

d4 d3 d2 d1 d4 d3 d2 d1 d4 d3 d2 d1

M(G, J) = 1 m12 m12 1

  • Je = 0

m12 = 0 Je ∈ (0, ∞) m12 ∈ (0, 1) Je = ∞ m12 = 1

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 27 / 29

slide-173
SLIDE 173

Ising model vs. Electrical networks

X n =

  • τ∈Match(2n)

Xτ E n =

  • τ∈Match(2n)

1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 28 / 29

slide-174
SLIDE 174

Ising model vs. Electrical networks

X n =

  • τ∈Match(2n)

Xτ E n =

  • τ∈Match(2n)

1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6

Problem

Construct a stratification-preserving homeomorphism between X n and E n.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 28 / 29

slide-175
SLIDE 175

Ising model vs. Electrical networks

X n =

  • τ∈Match(2n)

Xτ E n =

  • τ∈Match(2n)

1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6

Problem

Construct a stratification-preserving homeomorphism between X n and E n. Show that the closure of Xτ and of Eτ is a ball.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 28 / 29

slide-176
SLIDE 176

Thank you!

Slides: http://math.mit.edu/~galashin/slides/toronto_ising.pdf Pavel Galashin and Pavlo Pylyavskyy. Ising model and the positive orthogonal Grassmannian arXiv:1807.03282. Pavel Galashin, Steven N. Karp, and Thomas Lam. The totally nonnegative Grassmannian is a ball. arXiv:1707.02010. Marcin Lis. The planar Ising model and total positivity.

  • J. Stat. Phys., 166(1):72–89, 2017.

Alexander Postnikov. Total positivity, Grassmannians, and networks. arXiv:math/0609764. Thomas Lam. Electroid varieties and a compactification of the space of electrical networks Advances in Mathematics, 338 (2018): 549-600.

Pavel Galashin (MIT) Ising model and total positivity U of Toronto, 01/07/2019 29 / 29