The brick polytope of a sorting network
From MaRDI portal
Abstract: The associahedron is a polytope whose graph is the graph of flips on triangulations of a convex polygon. Pseudotriangulations and multitriangulations generalize triangulations in two different ways, which have been unified by Pilaud and Pocchiola in their study of flip graphs on pseudoline arrangements with contacts supported by a given sorting network. In this paper, we construct the brick polytope of a sorting network, obtained as the convex hull of the brick vectors associated to each pseudoline arrangement supported by the network. We combinatorially characterize the vertices of this polytope, describe its faces, and decompose it as a Minkowski sum of matroid polytopes. Our brick polytopes include Hohlweg and Lange's many realizations of the associahedron, which arise as brick polytopes for certain well-chosen sorting networks. We furthermore discuss the brick polytopes of sorting networks supporting pseudoline arrangements which correspond to multitriangulations of convex polygons: our polytopes only realize subgraphs of the flip graphs on multitriangulations and they cannot appear as projections of a hypothetical multiassociahedron.
Recommendations
Cites work
- scientific article; zbMATH DE number 47598 (Why is no real title available?)
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 1182909 (Why is no real title available?)
- scientific article; zbMATH DE number 2209740 (Why is no real title available?)
- A Turán-type theorem on chords of a convex polygon
- A generalization of diagonal flips in a convex polygon
- A new perspective on \(k\)-triangulations
- A simple way to tell a simple polytope from its graph
- Brick polytopes of spherical subword complexes and generalized associahedra
- Constructions and complexity of secondary polytopes
- Coxeter complexes and graph-associahedra
- Faces of generalized permutohedra
- Isometry classes of generalized associahedra
- Many non-equivalent realizations of the associahedron
- Matroid polytopes and their volumes
- Maximal fillings of Moon polyominoes, simplicial complexes, and Schubert polynomials
- Minkowski decompositions of associahedra
- Multitriangulations as complexes of star polygons
- Multitriangulations, pseudotriangulations and primitive sorting networks
- On line arrangements in the hyperbolic plane
- Oriented Matroids
- Permutahedra and generalized associahedra.
- Permutohedra, Associahedra, and Beyond
- Pseudo-triangulations -- a survey
- Puzzles and polytope isomorphisms
- Realization of the Stasheff polytope
- Realizations of the associahedron and cyclohedron
- Subword complexes in Coxeter groups.
- Subword complexes, cluster complexes, and generalized multi-associahedra
- The associahedron and triangulations of the \(n\)-gon
- Topologically sweeping visibility complexes via pseudotriangulations
- Triangulations. Structures for algorithms and applications
Cited in
(37)- Polytopal realizations and Hopf algebra structures for lattice quotients of the weak order
- Non-kissing complexes and tau-tilting for gentle algebras
- Vertex barycenter of generalized associahedra
- Toric matrix Schubert varieties and their polytopes
- Fan realizations of type \(A\) subword complexes and multi-associahedra of rank 3
- Subword complexes via triangulations of root polytopes
- Minkowski decomposition of associahedra and related combinatorics
- Geometric realizations of the accordion complex of a dissection
- scientific article; zbMATH DE number 7203483 (Why is no real title available?)
- Brick manifolds and toric varieties of brick polytopes
- The brick polytope of a sorting network
- Combinatorial generation via permutation languages. II. Lattice congruences
- Quotientopes
- A catalanization map on the symmetric group
- Many non-equivalent realizations of the associahedron
- Fan realizations for some 2-associahedra
- Homotopical perspective on statistical quantities
- Multitriangulations, pseudotriangulations and primitive sorting networks
- Compatibility fans for graphical nested complexes
- Lifted generalized permutahedra and composition polynomials
- Subword complexes, cluster complexes, and generalized multi-associahedra
- Associahedra via spines
- Brick polytopes of spherical subword complexes and generalized associahedra
- Associahedra for finite‐type cluster algebras and minimal relations between g‐vectors
- Brick polytopes, lattice quotients, and Hopf algebras
- The diameter of type \(D\) associahedra and the non-leaving-face property
- Hopf Monoids and Generalized Permutahedra
- Celebrating Loday's associahedron
- A Hopf algebra of subword complexes
- Cambrian acyclic domains: counting \(c\)-singletons
- Denominator vectors and compatibility degrees in cluster algebras of finite type
- A Hopf algebra of subword complexes (Extended abstract)
- Hopf dreams and diagonal harmonics
- Bruhat intervals, subword complexes and brick polyhedra for finite Coxeter groups
- Generating near‐bipartite bricks
- Rectangulotopes
- \(\mathsf{K}\)-orbit closures and Barbasch-Evens-Magyar varieties
This page was built for publication: The brick polytope of a sorting network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412257)
