3,047 research outputs found
The diameter of type D associahedra and the non-leaving-face property
Generalized associahedra were introduced by S. Fomin and A. Zelevinsky in
connection to finite type cluster algebras. Following recent work of L. Pournin
in types and , this paper focuses on geodesic properties of generalized
associahedra. We prove that the graph diameter of the -dimensional
associahedron of type is precisely for all greater than .
Furthermore, we show that all type associahedra have the non-leaving-face
property, that is, any geodesic connecting two vertices in the graph of the
polytope stays in the minimal face containing both. This property was already
proven by D. Sleator, R. Tarjan and W. Thurston for associahedra of type .
In contrast, we present relevant examples related to the associahedron that do
not always satisfy this property.Comment: 18 pages, 14 figures. Version 3: improved presentation,
simplification of Section 4.1. Final versio
Cluster algebras of type D: pseudotriangulations approach
We present a combinatorial model for cluster algebras of type in terms
of centrally symmetric pseudotriangulations of a regular -gon with a small
disk in the centre. This model provides convenient and uniform interpretations
for clusters, cluster variables and their exchange relations, as well as for
quivers and their mutations. We also present a new combinatorial interpretation
of cluster variables in terms of perfect matchings of a graph after deleting
two of its vertices. This interpretation differs from known interpretations in
the literature. Its main feature, in contrast with other interpretations, is
that for a fixed initial cluster seed, one or two graphs serve for the
computation of all cluster variables. Finally, we discuss applications of our
model to polytopal realizations of type associahedra and connections to
subword complexes and -cluster complexes.Comment: 21 pages, 21 figure
Dyck path triangulations and extendability
We introduce the Dyck path triangulation of the cartesian product of two
simplices . The maximal simplices of this
triangulation are given by Dyck paths, and its construction naturally
generalizes to produce triangulations of
using rational Dyck paths. Our study of the Dyck path triangulation is
motivated by extendability problems of partial triangulations of products of
two simplices. We show that whenever , any triangulation of
extends to a unique triangulation of
. Moreover, with an explicit construction, we
prove that the bound is optimal. We also exhibit interesting
interpretations of our results in the language of tropical oriented matroids,
which are analogous to classical results in oriented matroid theory.Comment: 15 pages, 14 figures. Comments very welcome
Generalized Heawood Graphs and Triangulations of Tori
The Heawood graph is a remarkable graph that played a fundamental role in the
development of the theory of graph colorings on surfaces in the 19th and 20th
centuries.
Based on permutahedral tilings, we introduce a generalization of the
classical Heawood graph indexed by a sequence of positive integers.
We show that the resulting generalized Heawood graphs are toroidal graphs,
which are dual to higher dimensional triangulated tori. We also present
explicit combinatorial formulas for their -vectors and study their
automorphism groups.Comment: 40 pages, 22 figure
- …