Vincent Pilaud ; Francisco Santos
-
Multi-triangulations as complexes of star polygons
dmtcs:3642 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2008,
DMTCS Proceedings vol. AJ, 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008)
-
https://doi.org/10.46298/dmtcs.3642
Multi-triangulations as complexes of star polygonsArticle
A $k$-triangulation of a convex polygon is a maximal set of diagonals so that no $k+1$ of them mutually cross. $k$-triangulations have received attention in recent literature, with motivation coming from several interpretations of them. We present a new way of looking at $k$-triangulations, where certain star polygons naturally generalize triangles for $k$-triangulations. With this tool we give new, direct proofs of the fundamental properties of $k$-triangulations (number of edges, definition of flip). This interpretation also opens up new avenues of research that we briefly explore in the last section.
Nantel Bergeron;Cesar Ceballos;Jean-Philippe Labbé, 2015, Fan Realizations of Type $$A$$ A Subword Complexes and Multi-associahedra of Rank 3, arXiv (Cornell University), 54, 1, pp. 195-231, 10.1007/s00454-015-9691-0, http://arxiv.org/abs/1404.7380.
Luis Serrano;Christian Stump, 2012, Maximal Fillings of Moon Polyominoes, Simplicial Complexes, and Schubert Polynomials, The Electronic Journal of Combinatorics, 19, 1, 10.37236/1167, https://doi.org/10.37236/1167.
Stefan Grünewald;Jack H. Koolen;Vincent Moulton;Taoyang Wu, 2012, The size of 3-compatible, weakly compatible split systems, Journal of Applied Mathematics and Computing, 40, 1-2, pp. 249-259, 10.1007/s12190-012-0546-z.