Sublattices of associahedra and permutohedra permutohedra Geyers - PowerPoint PPT Presentation

Associahedra, permutohedra Associahedra, Sublattices of associahedra and permutohedra permutohedra Geyer’s Conjecture Non- Luigi Santocanale and Friedrich Wehrung embeddable bounded lattices LIF (Marseille) and LMNO (Caen) Non- E-mail (Santocanale): luigi.santocanale@lif.univ-mrs.fr embeddability into URL (Santocanale): http://www.lif.univ-mrs.fr/˜lsantoca permutohedra E-mail (Wehrung): wehrung@math.unicaen.fr URL (Wehrung): http://www.math.unicaen.fr/˜wehrung TACL 2011, Marseilles, July 29 2011

A(4): the associahedron on 4 + 1 letters Associahedra, permutohedra Associahedra, permutohedra Geyer’s Conjecture Non- embeddable bounded lattices Non- embeddability into permutohedra

P(4): the permutohedron on 4 letters Associahedra, permutohedra Associahedra, permutohedra Geyer’s Conjecture Non- embeddable bounded lattices Non- embeddability into permutohedra

Associahedra and permutohedra Associahedra, permutohedra . . . appear in the worlds of voting theory, Associahedra, permutohedra Geyer’s Conjecture Non- embeddable bounded lattices Non- embeddability into permutohedra

Associahedra and permutohedra Associahedra, permutohedra . . . appear in the worlds of voting theory, Associahedra, permutohedra graphs, polyhedra, Geyer’s Conjecture Non- embeddable bounded lattices Non- embeddability into permutohedra

Associahedra and permutohedra Associahedra, permutohedra . . . appear in the worlds of voting theory, Associahedra, permutohedra graphs, polyhedra, Geyer’s groups, Conjecture Non- embeddable bounded lattices Non- embeddability into permutohedra

Associahedra and permutohedra Associahedra, permutohedra . . . appear in the worlds of voting theory, Associahedra, permutohedra graphs, polyhedra, Geyer’s groups, Conjecture Non- lattices. embeddable bounded lattices Non- embeddability into permutohedra

Associahedra and permutohedra Associahedra, permutohedra . . . appear in the worlds of voting theory, Associahedra, permutohedra graphs, polyhedra, Geyer’s groups, Conjecture Non- lattices. embeddable bounded lattices A logical issue: Non- embeddability to characterize the equational theory of these lattices. into permutohedra

Associahedra and permutohedra Associahedra, permutohedra . . . appear in the worlds of voting theory, Associahedra, permutohedra graphs, polyhedra, Geyer’s groups, Conjecture Non- lattices. embeddable bounded lattices A logical issue: Non- embeddability to characterize the equational theory of these lattices. into permutohedra Associahedra: no nontrivial lattice identity known to hold – until recently [S&W, November 2011].

Associahedra and permutohedra Associahedra, permutohedra . . . appear in the worlds of voting theory, Associahedra, permutohedra graphs, polyhedra, Geyer’s groups, Conjecture Non- lattices. embeddable bounded lattices A logical issue: Non- embeddability to characterize the equational theory of these lattices. into permutohedra Associahedra: no nontrivial lattice identity known to hold – until recently [S&W, November 2011]. Permutohedra: no nontrivial lattice identity known to hold – yet.

The permutohedron on n letters These objects can be defined in many equivalent ways: Associahedra, permutohedra Associahedra, permutohedra Geyer’s Conjecture Non- embeddable bounded lattices Non- embeddability into permutohedra

The permutohedron on n letters These objects can be defined in many equivalent ways: Associahedra, permutohedra Set [ n ] := { 1 , 2 , . . . , n } and Associahedra, I n := { ( i , j ) ∈ [ n ] × [ n ] | i < j } . permutohedra Geyer’s Conjecture Elements of I n are called inversions. Non- embeddable bounded lattices Non- embeddability into permutohedra

The permutohedron on n letters These objects can be defined in many equivalent ways: Associahedra, permutohedra Set [ n ] := { 1 , 2 , . . . , n } and Associahedra, I n := { ( i , j ) ∈ [ n ] × [ n ] | i < j } . permutohedra Geyer’s Conjecture Elements of I n are called inversions. Non- A subset a of I n is closed if it is transitive. embeddable bounded Say that a is open if I n \ a is closed. lattices Non- embeddability into permutohedra

The permutohedron on n letters These objects can be defined in many equivalent ways: Associahedra, permutohedra Set [ n ] := { 1 , 2 , . . . , n } and Associahedra, I n := { ( i , j ) ∈ [ n ] × [ n ] | i < j } . permutohedra Geyer’s Conjecture Elements of I n are called inversions. Non- A subset a of I n is closed if it is transitive. embeddable bounded Say that a is open if I n \ a is closed. lattices Non- The permutohedron of n letters – P( n ) – is defined as: embeddability into permutohedra P( n ) = { clopen (i.e., closed and open) subsets of I n } , P( n ) is ordered by containment.

The permutohedron on n letters These objects can be defined in many equivalent ways: Associahedra, permutohedra Set [ n ] := { 1 , 2 , . . . , n } and Associahedra, I n := { ( i , j ) ∈ [ n ] × [ n ] | i < j } . permutohedra Geyer’s Conjecture Elements of I n are called inversions. Non- A subset a of I n is closed if it is transitive. embeddable bounded Say that a is open if I n \ a is closed. lattices Non- The permutohedron of n letters – P( n ) – is defined as: embeddability into permutohedra P( n ) = { clopen (i.e., closed and open) subsets of I n } , P( n ) is ordered by containment. Theorem (Guilbaud and Rosenstiehl 1963) The poset P( n ) is a lattice, for each positive integer n .

P( n ) as the lattice of all permutations of [ n ] Associahedra, For σ ∈ S n , the inversion set permutohedra Inv( σ ) := { ( i , j ) ∈ I n | σ − 1 ( i ) > σ − 1 ( j ) } Associahedra, permutohedra is clopen. Geyer’s Conjecture Non- embeddable bounded lattices Non- embeddability into permutohedra

P( n ) as the lattice of all permutations of [ n ] Associahedra, For σ ∈ S n , the inversion set permutohedra Inv( σ ) := { ( i , j ) ∈ I n | σ − 1 ( i ) > σ − 1 ( j ) } Associahedra, permutohedra is clopen. Geyer’s Conjecture � � � ������������������������ Non- ������������������ � � � � � � embeddable � � � � � bounded � � � � � � lattices � � � � � � � � � � � Non- � � � � � embeddability � � � � � � into � � � � � � permutohedra � � 1 2 3 4 5 Inv(34152) = { (1 , 3) , (1 , 4) , (2 , 3) , (2 , 4) , (2 , 5) }

P( n ) as the lattice of all permutations of [ n ] Associahedra, For σ ∈ S n , the inversion set permutohedra Inv( σ ) := { ( i , j ) ∈ I n | σ − 1 ( i ) > σ − 1 ( j ) } Associahedra, permutohedra is clopen. Geyer’s Conjecture � � � ������������������������ Non- ������������������ � � � � � � embeddable � � � � � bounded � � � � � � lattices � � � � � � � � � � � Non- � � � � � embeddability � � � � � � into � � � � � � permutohedra � � 1 2 3 4 5 Inv(34152) = { (1 , 3) , (1 , 4) , (2 , 3) , (2 , 4) , (2 , 5) } Every clopen set has the form Inv( σ ), for a (unique) σ ∈ S n .

Associahedra, permutohedra Associahedra, permutohedra Geyer’s Theorem Conjecture Non- Inv( σ ) ⊆ Inv( τ ) embeddable bounded if and only if lattices there is a length-increasing path from σ to τ Non- embeddability in the Cayley graph of S n . into permutohedra

Associahedra as retracts of permutohedra Associahedra, A( n ), the associahedron (Tamari 1962) of index n : permutohedra all bracketings on n + 1 letters ordered together with the reflexive and transitive closure of Associahedra, permutohedra ( xy ) z < x ( yz ) . Geyer’s Conjecture Non- embeddable bounded lattices Non- embeddability into permutohedra

Associahedra as retracts of permutohedra Associahedra, A( n ), the associahedron (Tamari 1962) of index n : permutohedra all bracketings on n + 1 letters ordered together with the reflexive and transitive closure of Associahedra, permutohedra ( xy ) z < x ( yz ) . Geyer’s Conjecture Proved to be a lattice by Friedman and Tamari (1967). Non- embeddable bounded lattices Non- embeddability into permutohedra

Associahedra as retracts of permutohedra Associahedra, A( n ), the associahedron (Tamari 1962) of index n : permutohedra all bracketings on n + 1 letters ordered together with the reflexive and transitive closure of Associahedra, permutohedra ( xy ) z < x ( yz ) . Geyer’s Conjecture Proved to be a lattice by Friedman and Tamari (1967). Non- embeddable Say that a ⊆ I n is a left subset if bounded lattices i < j < k and ( i , k ) ∈ a implies that ( i , j ) ∈ a . Non- embeddability into Then: permutohedra A( n ) : ≃ { closed left subsets of I n } .