dissections hom complexes and the cayley trick

play

Dissections, Hom-complexes and the Cayley Trick Julian Pfeifle MA - PowerPoint PPT Presentation

Nov 05, 2023 •260 likes •976 views

Introduction The Cayley trick Hom-complexes Dissection complexes Dissections, Hom-complexes and the Cayley Trick Julian Pfeifle MA II, Universitat Politcnica de Catalunya julian.pfeifle@upc.edu Work in progress Introduction The Cayley

Introduction The Cayley trick Hom-complexes Dissection complexes Dissections, Hom-complexes and the Cayley Trick Julian Pfeifle MA II, Universitat Politècnica de Catalunya julian.pfeifle@upc.edu Work in progress
Introduction The Cayley trick Hom-complexes Dissection complexes Outline Introduction The associahedron Dissections of polygons Results in this talk The Cayley trick Joins and projections . . . and the Cayley trick Hom-complexes Hom-complexes and the Cayley trick Symmetry classes The case Hom ( K g , H ) Dissection complexes
Introduction The Cayley trick Hom-complexes Dissection complexes Outline Introduction The associahedron Dissections of polygons Results in this talk The Cayley trick Joins and projections . . . and the Cayley trick Hom-complexes Hom-complexes and the Cayley trick Symmetry classes The case Hom ( K g , H ) Dissection complexes
Introduction The Cayley trick Hom-complexes Dissection complexes The associahedron Its face lattice records the incidence structure of the dissections of a convex ( n + 2 ) -gon into ( j + 2 ) -gons, j = 1 , 2 , . . . , n
Introduction The Cayley trick Hom-complexes Dissection complexes Polygon dissections Let’s dissect into k -gons instead of triangles: Definition Let k ≥ 3 and m ≥ 1. (a) An allowable diagonal of a convex N -gon is one that can be completed to a dissection of the N -gon (So N = m ( k − 2 ) + 2.) into m convex k -gons. (b) [Vic Reiner] Let T ( k , m ) be the simplicial complex on the allowable diagonals whose faces are the partial dissections.
Introduction The Cayley trick Hom-complexes Dissection complexes Polygon dissections Let’s dissect into k -gons instead of triangles: Definition Let k ≥ 3 and m ≥ 1. (a) An allowable diagonal of a convex N -gon is one that can be completed to a dissection of the N -gon (So N = m ( k − 2 ) + 2.) into m convex k -gons. (b) [Vic Reiner] Let T ( k , m ) be the simplicial complex on the allowable diagonals whose faces are the partial dissections.
Introduction The Cayley trick Hom-complexes Dissection complexes Dissections of polygons Theorem (Tzanaki 2005) The complex T ( k , m ) (a) is vertex-decomposable, hence shellable; � ( k − 2 ) m (b) has the homotopy type of a wedge of 1 � spheres of m m − 1 dimension m − 2 . In particular, for k = 3 it really is a sphere: the boundary complex of the polar of the associahedron! But for k > 3, the complex T ( k , m ) cannot be the boundary complex of a convex polytope.
Introduction The Cayley trick Hom-complexes Dissection complexes Dissections of polygons Theorem (Tzanaki 2005) The complex T ( k , m ) (a) is vertex-decomposable, hence shellable; � ( k − 2 ) m (b) has the homotopy type of a wedge of 1 � spheres of m m − 1 dimension m − 2 . In particular, for k = 3 it really is a sphere: the boundary complex of the polar of the associahedron! But for k > 3, the complex T ( k , m ) cannot be the boundary complex of a convex polytope.
Introduction The Cayley trick Hom-complexes Dissection complexes Dissections of polygons Theorem (Tzanaki 2005) The complex T ( k , m ) (a) is vertex-decomposable, hence shellable; � ( k − 2 ) m (b) has the homotopy type of a wedge of 1 � spheres of m m − 1 dimension m − 2 . In particular, for k = 3 it really is a sphere: the boundary complex of the polar of the associahedron! But for k > 3, the complex T ( k , m ) cannot be the boundary complex of a convex polytope.
Introduction The Cayley trick Hom-complexes Dissection complexes Dissections of polygons Theorem (Tzanaki 2005) The complex T ( k , m ) (a) is vertex-decomposable, hence shellable; � ( k − 2 ) m (b) has the homotopy type of a wedge of 1 � spheres of m m − 1 dimension m − 2 . In particular, for k = 3 it really is a sphere: the boundary complex of the polar of the associahedron! But for k > 3, the complex T ( k , m ) cannot be the boundary complex of a convex polytope.
Introduction The Cayley trick Hom-complexes Dissection complexes Flip graphs D ( k , m ) is the dual graph of T ( k , m ) : two dissections are connected if they only differ in one diagonal.
Introduction The Cayley trick Hom-complexes Dissection complexes Preliminary results 1. We relate Hom-complexes to the Cayley trick, and study Hom ( G , H ) / S G , where S G is the symmetry group of G 2. We focus on Hom ( K g , H ) . (For coloring problems, people look at Hom ( G , K h ) .) 3. We obtain results on T ( k , m ) and D ( k , m ) : (a) T ( k , m ) = sk m − 2 Hom t � � K m − 1 , I ( k , m ) / S m − 1 . + (b) D ( k , m ) = sk 1 Hom � � K m − 1 , I ( k , m ) / S m − 1 . 4. Also: T ( k , m ) = sk m − 2 ♦ ( k , m ) (motivated by a question of Fomin & Zelevinski) � ∆ C ↓ 5. Hom ( K m − 1 , I ( k , m )) contains copies of sk d / 2 � d ( n ) 6. D ( k , m ) contains copies of C ( r , s ) , the “flip graph” of weak compositions of r into s parts
Introduction The Cayley trick Hom-complexes Dissection complexes Preliminary results 1. We relate Hom-complexes to the Cayley trick, and study Hom ( G , H ) / S G , where S G is the symmetry group of G 2. We focus on Hom ( K g , H ) . (For coloring problems, people look at Hom ( G , K h ) .) 3. We obtain results on T ( k , m ) and D ( k , m ) : (a) T ( k , m ) = sk m − 2 Hom t � � K m − 1 , I ( k , m ) / S m − 1 . + (b) D ( k , m ) = sk 1 Hom � � K m − 1 , I ( k , m ) / S m − 1 . 4. Also: T ( k , m ) = sk m − 2 ♦ ( k , m ) (motivated by a question of Fomin & Zelevinski) � ∆ C ↓ 5. Hom ( K m − 1 , I ( k , m )) contains copies of sk d / 2 � d ( n ) 6. D ( k , m ) contains copies of C ( r , s ) , the “flip graph” of weak compositions of r into s parts
Introduction The Cayley trick Hom-complexes Dissection complexes Preliminary results 1. We relate Hom-complexes to the Cayley trick, and study Hom ( G , H ) / S G , where S G is the symmetry group of G 2. We focus on Hom ( K g , H ) . (For coloring problems, people look at Hom ( G , K h ) .) 3. We obtain results on T ( k , m ) and D ( k , m ) : (a) T ( k , m ) = sk m − 2 Hom t � � K m − 1 , I ( k , m ) / S m − 1 . + (b) D ( k , m ) = sk 1 Hom � � K m − 1 , I ( k , m ) / S m − 1 . 4. Also: T ( k , m ) = sk m − 2 ♦ ( k , m ) (motivated by a question of Fomin & Zelevinski) � ∆ C ↓ 5. Hom ( K m − 1 , I ( k , m )) contains copies of sk d / 2 � d ( n ) 6. D ( k , m ) contains copies of C ( r , s ) , the “flip graph” of weak compositions of r into s parts
Introduction The Cayley trick Hom-complexes Dissection complexes Preliminary results 1. We relate Hom-complexes to the Cayley trick, and study Hom ( G , H ) / S G , where S G is the symmetry group of G 2. We focus on Hom ( K g , H ) . (For coloring problems, people look at Hom ( G , K h ) .) 3. We obtain results on T ( k , m ) and D ( k , m ) : (a) T ( k , m ) = sk m − 2 Hom t � � K m − 1 , I ( k , m ) / S m − 1 . + (b) D ( k , m ) = sk 1 Hom � � K m − 1 , I ( k , m ) / S m − 1 . 4. Also: T ( k , m ) = sk m − 2 ♦ ( k , m ) (motivated by a question of Fomin & Zelevinski) � ∆ C ↓ 5. Hom ( K m − 1 , I ( k , m )) contains copies of sk d / 2 � d ( n ) 6. D ( k , m ) contains copies of C ( r , s ) , the “flip graph” of weak compositions of r into s parts
Introduction The Cayley trick Hom-complexes Dissection complexes Preliminary results 1. We relate Hom-complexes to the Cayley trick, and study Hom ( G , H ) / S G , where S G is the symmetry group of G 2. We focus on Hom ( K g , H ) . (For coloring problems, people look at Hom ( G , K h ) .) 3. We obtain results on T ( k , m ) and D ( k , m ) : (a) T ( k , m ) = sk m − 2 Hom t � � K m − 1 , I ( k , m ) / S m − 1 . + (b) D ( k , m ) = sk 1 Hom � � K m − 1 , I ( k , m ) / S m − 1 . 4. Also: T ( k , m ) = sk m − 2 ♦ ( k , m ) (motivated by a question of Fomin & Zelevinski) � ∆ C ↓ 5. Hom ( K m − 1 , I ( k , m )) contains copies of sk d / 2 � d ( n ) 6. D ( k , m ) contains copies of C ( r , s ) , the “flip graph” of weak compositions of r into s parts
Introduction The Cayley trick Hom-complexes Dissection complexes Preliminary results 1. We relate Hom-complexes to the Cayley trick, and study Hom ( G , H ) / S G , where S G is the symmetry group of G 2. We focus on Hom ( K g , H ) . (For coloring problems, people look at Hom ( G , K h ) .) 3. We obtain results on T ( k , m ) and D ( k , m ) : (a) T ( k , m ) = sk m − 2 Hom t � � K m − 1 , I ( k , m ) / S m − 1 . + (b) D ( k , m ) = sk 1 Hom � � K m − 1 , I ( k , m ) / S m − 1 . 4. Also: T ( k , m ) = sk m − 2 ♦ ( k , m ) (motivated by a question of Fomin & Zelevinski) � ∆ C ↓ 5. Hom ( K m − 1 , I ( k , m )) contains copies of sk d / 2 � d ( n ) 6. D ( k , m ) contains copies of C ( r , s ) , the “flip graph” of weak compositions of r into s parts

Download Presentation

Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

More recommend