Multitriangulations as complexes of star polygons
From MaRDI portal
Publication:1017914
DOI10.1007/s00454-008-9078-6zbMath1177.52007arXiv0706.3121OpenAlexW2074673531MaRDI QIDQ1017914
Francisco Santos, Vincent Pilaud
Publication date: 13 May 2009
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0706.3121
Related Items (19)
A Hopf algebra of subword complexes ⋮ Posets and Spaces of $k$-Noncrossing RNA Structures ⋮ Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings ⋮ Brick polytopes, lattice quotients, and Hopf algebras ⋮ Maximal 0-1-fillings of Moon polyominoes with restricted chain lengths and rc-graphs ⋮ The brick polytope of a sorting network ⋮ Celebrating Loday's associahedron ⋮ Multitriangulations, pseudotriangulations and primitive sorting networks ⋮ Subword complexes, cluster complexes, and generalized multi-associahedra ⋮ The diameter of associahedra ⋮ The diameter of type \(D\) associahedra and the non-leaving-face property ⋮ Fan Realizations for Some 2-Associahedra ⋮ A new perspective on \(k\)-triangulations ⋮ The size of 3-compatible, weakly compatible split systems ⋮ The \(\nu \)-Tamari lattice via \(\nu \)-trees, \( \nu \)-bracket vectors, and subword complexes ⋮ Unnamed Item ⋮ Brick polytopes of spherical subword complexes and generalized associahedra ⋮ One Brick at a Time: A Survey of Inductive Constructions in Rigidity Theory ⋮ Fan realizations of type \(A\) subword complexes and multi-associahedra of rank 3
Cites Work
- Increasing and decreasing sequences in fillings of moon polyominoes
- Constructions and complexity of secondary polytopes
- Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
- On the maximum number of edges in quasi-planar graphs
- Sparse hypergraphs and pebble game algorithms
- Axioms and hulls
- A Turán-type theorem on chords of a convex polygon
- Gröbner bases and multiplicity of determinantal and Pfaffian ideals
- \(4n-10\)
- The associahedron and triangulations of the \(n\)-gon
- On line arrangements in the hyperbolic plane
- Realization of the Stasheff polytope
- A generalization of diagonal flips in a convex polygon
- Realizations of the associahedron and cyclohedron
- A bijection between 2-triangulations and pairs of non-crossing Dyck paths
- Pebble game algorithms and sparse graphs
- Generalized triangulations and diagonal-free subsets of stack polyominoes
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Lectures on Polytopes
- Oriented Matroids
- THE VISIBILITY COMPLEX
- \(2kn-\binom{2k+1}{2}\). A note on extremal combinatorics of cyclic split systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Multitriangulations as complexes of star polygons
