The Chan-Robbins-Yuen polytope : ( b ij ) R n 2 | doubly-stochastic - - PowerPoint PPT Presentation

the chan robbins yuen polytope
SMART_READER_LITE
LIVE PREVIEW

The Chan-Robbins-Yuen polytope : ( b ij ) R n 2 | doubly-stochastic - - PowerPoint PPT Presentation

Open problem: volumes of flow polytopes Alejandro H. Morales LaCIM, Universit e du Qu ebec ` a Montr eal Stanley@ vol 0 vol 0 June 23, 2014 joint with: Karola M esz aros, Jessica Striker; Drew Armstrong, Karola M esz


slide-1
SLIDE 1

Open problem: volumes of flow polytopes Alejandro H. Morales LaCIM, Universit´ e du Qu´ ebec ` a Montr´ eal June 23, 2014

joint with: Karola M´ esz´ aros, Jessica Striker; Drew Armstrong, Karola M´ esz´ aros, and Brendon Rhoades;

Stanley@ vol

vol

Karola M´ esz´ aros

slide-2
SLIDE 2

= convex hull n × n permutation matrices The Chan-Robbins-Yuen polytope:

CRYn :=

  • (bij) ∈ Rn2 | doubly-stochastic matrix, bij = 0, i − j ≥ 2
slide-3
SLIDE 3

= convex hull n × n permutation matrices The Chan-Robbins-Yuen polytope:

CRYn :=

  • (bij) ∈ Rn2 | doubly-stochastic matrix, bij = 0, i − j ≥ 2
  • 2n−1 vertices,

dimension n

2

slide-4
SLIDE 4

= convex hull n × n permutation matrices The Chan-Robbins-Yuen polytope:

CRYn :=

  • (bij) ∈ Rn2 | doubly-stochastic matrix, bij = 0, i − j ≥ 2
  • 2n−1 vertices,

dimension n

2

  • 1

1 1 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 0 1 1 0 1 1 1 0 0

CRY3

slide-5
SLIDE 5

= convex hull n × n permutation matrices The Chan-Robbins-Yuen polytope:

CRYn :=

  • (bij) ∈ Rn2 | doubly-stochastic matrix, bij = 0, i − j ≥ 2
  • 2n−1 vertices,

dimension n

2

  • 1

1 1 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 0 1 1 0 1 1 1 0 0

CRY3

1 1 1 1 1 1 0 1 1 1 0 1 1 1 1 0 1 1

slide-6
SLIDE 6

From CRYn to a flow polytope

CRYn :=

  • (bij) ∈ Rn2 | doubly-stochastic matrix, bij = 0, i − j ≥ 2
  • K4

a b c d e f

slide-7
SLIDE 7

From CRYn to a flow polytope

CRYn :=

  • (bij) ∈ Rn2 | doubly-stochastic matrix, bij = 0, i − j ≥ 2
  • K4

a b c d e f a + b + c =1

a b c

a b c 1

slide-8
SLIDE 8

From CRYn to a flow polytope

CRYn :=

  • (bij) ∈ Rn2 | doubly-stochastic matrix, bij = 0, i − j ≥ 2
  • K4

a b c d e f

b c

a + b + c =1 d + e − a =0 d e a

a d e

1

slide-9
SLIDE 9

From CRYn to a flow polytope

CRYn :=

  • (bij) ∈ Rn2 | doubly-stochastic matrix, bij = 0, i − j ≥ 2
  • K4

a b c d e f

a d e

d + e − a =0

b c

a + b + c =1 f d b f − b − d =0

b d f

1

slide-10
SLIDE 10

From CRYn to a flow polytope

CRYn :=

  • (bij) ∈ Rn2 | doubly-stochastic matrix, bij = 0, i − j ≥ 2
  • K4

a b c d e f

a b c e d f

f − b − d =0 d + e − a =0 a + b + c =1 −c − e − f =−1 c e f 1 −1

slide-11
SLIDE 11

From CRYn to a flow polytope

CRYn :=

  • (bij) ∈ Rn2 | doubly-stochastic matrix, bij = 0, i − j ≥ 2
  • K4

a b c d e f

a b c e d f

f − b − d =0 d + e − a =0 a + b + c =1 −c − e − f =−1 c e f 1 −1 −c − e − f =−1 f e c

c e f

  • Correspondence CRYn and flows in complete graph Kn+1 with

netflow: 1 first vertex, −1 last vertex, 0 other vertices. b a d

slide-12
SLIDE 12

Volume of the CRYn polytope

vn := volume(CRYn) 2 3 4 5 6 7 n vn 1 1 2 10 140 5880

slide-13
SLIDE 13

Volume of the CRYn polytope

vn := volume(CRYn) 2 3 4 5 6 7 n vn 1 1 2 10 140 5880 v2n v2n−2 2 70 1 10 5880

slide-14
SLIDE 14

Volume of the CRYn polytope

vn := volume(CRYn) 2 3 4 5 6 7 n vn 1 1 2 10 140 5880 v2n v2n−2 2 70 vn vn−1 1 2 5 14 42 1 10 5880 1 10 5880

slide-15
SLIDE 15

Volume of the CRYn polytope

vn := volume(CRYn) 2 3 4 5 6 7 n vn 1 1 2 10 140 5880 v2n v2n−2 2 70

  • vn = Cat0Cat1 · · · Catn−2

(Zeilberger 99) vn vn−1 1 2 5 14 42 (conjecture Chan-Robbins-Yuen 99) 1 10 5880 1 10 5880

slide-16
SLIDE 16

CRYn: permutation matrices vertices: 1 −1 flow polytope complete graph

slide-17
SLIDE 17

CRYn: permutation matrices

  • 1. vertices: alternating sign

matrices vertices:

  • 3. type D analogue of CRYn

Variants

  • 2. change netflow from

(1, 0, . . . , 0, −1) to (1, 1, . . . , 1, −n) 1 −1 flow polytope complete graph

slide-18
SLIDE 18

Alternating sign matrices

  • rows and columns sum to 1

permutation matrices alternating sign matrices

  • entries are 0, 1

1 1 1 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 0 1 1 0 1 1 1 0 0 1 1 1 0 0

slide-19
SLIDE 19

Alternating sign matrices

  • rows and columns sum to 1
  • nonzero entries in rows and

columns alternate in sign permutation matrices

  • rows and columns sum to 1

alternating sign matrices

  • entries are 0, 1
  • entries are 0, 1, −1

1 1 1 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 0 1 1 0 1 1 1 0 0 1 1 1 0 0 1 1 1 1 1 1 1

First enumerated by Zeilberger 92

slide-20
SLIDE 20
  • 1. The CRY polytope of ASMs

CRYASM

n

= convex hull n × n ASMs

slide-21
SLIDE 21
  • 1. The CRY polytope of ASMs

The polytope CRY′

n of ASMs is an order polytope as defined by

Stanley 86. (M´ esz´ aros-M-Striker 13+)

CRYASM

n

= convex hull n × n ASMs

slide-22
SLIDE 22
  • 1. The CRY polytope of ASMs

The polytope CRY′

n of ASMs is an order polytope as defined by

Stanley 86. (M´ esz´ aros-M-Striker 13+)

Example

.3 .4 .1 .2 .6 .1 .1 .7 .2 .1 .1 .9 .8

CRYASM

n

= convex hull n × n ASMs

slide-23
SLIDE 23
  • 1. The CRY polytope of ASMs

The polytope CRY′

n of ASMs is an order polytope as defined by

Stanley 86. (M´ esz´ aros-M-Striker 13+)

Example

.3 .4 .1 .2 .6 .1 .1 .7 .2 .1 .1 .9 .8 .2 .3 .7 .8 .9 .8 .8 .7 .3 .2 .1 .2 .7 .3 corner sums complement

CRYASM

n

= convex hull n × n ASMs

slide-24
SLIDE 24
  • 1. The CRY polytope of ASMs

The polytope CRY′

n of ASMs is an order polytope as defined by

Stanley 86. (M´ esz´ aros-M-Striker 13+)

CRYASM

n

= convex hull n × n ASMs In EC1

slide-25
SLIDE 25
  • 1. The CRY polytope of ASMs

volume = f(n−1,n−2,...,1) = #SY T(δn−1) Catn vertices P

CRYASM

n

= convex hull n × n ASMs

slide-26
SLIDE 26

Question CRYn: CRYASM

n

: permutation matrices alternating sign matrices vertices: vertices:

1 1 1 1 1 1 0 1 1 1 0 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 1 0 1 1

What can we learn about CRYn from CRYASM

n

?

slide-27
SLIDE 27
  • 2. The Tesler polytope

volume = n−2

i=0 Cati

CRYn: flow polytope complete graph 1 −1

Theorem (Zeilberger 99):

CRY3 :

  • 2n−1 vertices
  • dimension

n

2

slide-28
SLIDE 28
  • 2. The Tesler polytope

volume = n−2

i=0 Cati

CRYn: flow polytope complete graph 1 −1 flow polytope complete graph different nettflow 1

Theorem (Zeilberger 99):

CRY3 : T3 :

  • 2n−1 vertices
  • dimension

n

2

  • 1

1 −3

slide-29
SLIDE 29
  • 2. The Tesler polytope

volume = n−2

i=0 Cati

CRYn: flow polytope complete graph 1 −1 flow polytope complete graph different nettflow 1

Theorem (Zeilberger 99):

CRY3 : T3 :

  • 2n−1 vertices
  • dimension

n

2

  • 1

1 −3

  • lattice points are

Tesler matrices

a c b x y z a b c x y z

slide-30
SLIDE 30
  • 2. The Tesler polytope

volume = n−2

i=0 Cati

CRYn: flow polytope complete graph 1 −1 flow polytope complete graph different nettflow 1

Theorem (Zeilberger 99):

CRY3 : T3 :

  • 2n−1 vertices
  • dimension

n

2

  • 1

1 −3

  • lattice points are

Tesler matrices

1 0 1 0 1 2 1 1 1 2

slide-31
SLIDE 31
  • 2. The Tesler polytope

volume = n−2

i=0 Cati

CRYn: flow polytope complete graph 1 −1 flow polytope complete graph different nettflow 1

Theorem (Zeilberger 99):

CRY3 : T3 :

  • 2n−1 vertices
  • dimension

n

2

  • 1

1 −3

  • dimension

n

2

  • n! vertices
  • lattice points are

Tesler matrices

1 0 1 0 1 2 1 1 1 2

slide-32
SLIDE 32
  • 2. The Tesler polytope

volume = n−2

i=0 Cati

CRYn: flow polytope complete graph 1 −1 flow polytope complete graph different nettflow 1

Theorem vol = f(n−1,n−2,...,1) · n−1

i=0 Cati

Theorem (Zeilberger 99):

CRY3 : T3 :

  • 2n−1 vertices
  • dimension

n

2

  • 1

1 −3

(Armstrong-M´ esz´ aros-M-Rhoades 14+)

  • dimension

n

2

  • n! vertices
  • lattice points are

Tesler matrices

1 0 1 0 1 2 1 1 1 2

slide-33
SLIDE 33
  • 3. The type D CRY polytope

CRYn: Second generalization CRYn: flow polytope complete graph 1 −1

Theorem (Zeilberger 99):

CRY3 :

  • 2n−1 vertices
  • dimension

n

2

  • volume = n−2

i=0 Cati

slide-34
SLIDE 34
  • 3. The type D CRY polytope

CRYn: Second generalization CRYn: flow polytope complete graph 1 −1 flow polytope complete signed graph 2

Theorem (Zeilberger 99):

CRY3 : CRYD

3 :

  • 2n−1 vertices
  • dimension

n

2

  • volume = n−2

i=0 Cati

slide-35
SLIDE 35
  • 3. The type D CRY polytope

CRYn: Second generalization CRYn: flow polytope complete graph 1 −1 flow polytope complete signed graph 2

Theorem (Zeilberger 99):

CRY3 : CRYD

3 :

  • 2n−1 vertices
  • dimension

n

2

  • 3n − 2n vertices
  • dimension n2 − 1

volume = n−2

i=0 Cati

slide-36
SLIDE 36
  • 3. The type D CRY polytope

CRYn: Second generalization CRYn: flow polytope complete graph 1 −1 flow polytope complete signed graph 2

Conjecture: (M´ esz´ aros-M 12) volume = 2(n−1)2 · n−1

i=0 Cati

Theorem (Zeilberger 99):

CRY3 : CRYD

3 :

  • 2n−1 vertices
  • dimension

n

2

  • 3n − 2n vertices
  • dimension n2 − 1

volume = n−2

i=0 Cati

slide-37
SLIDE 37

Happy birthday Richard!

CRY3 CRYASM

3

T3 CRYD

2

Why product of Catalan? conjecture volume How do they fit together?