Let Pn be a convex n-gon in the plane, n ⩾ 3. Consider Σn, the collection of all sets of mutually non-crossing diagonals of Pn. Then Σn is a simplicial complex of dimension n − 4. We prove that Σn is isomorphic to the boundary complex of some (n − 3)-dimensional simplicial convex polytope, and that this polytope can be geometrically realized to have the dihedral group Dn as its group of symmetries. Formulas for the f-vector and h-vector of this polytope and some implications for related combinatorial problems are discussed
2021 Fall.Includes bibliographical references.A convex polyhedron is the convex hull of a finite set...
When does a topological polyhedral complex (embedded in Rd) admit a geometric realization (a rectili...
AbstractFor n≥3, let Ωn be the set of line segments between the vertices of a convex n-gon. For j≥2,...
Let Pn be a convex n-gon in the plane, n ⩾ 3. Consider Σn, the collection of all sets of mutually no...
Motivated by the question of the polytopal realizability of the simplicial complex Γn,k of (k + 1)-c...
AbstractThe (type-A) associahedron is a polytope related to polygon dissections which arises in seve...
International audienceMotivated by the question of the polytopal realizability of the simplicial com...
International audienceMotivated by the question of the polytopal realizability of the simplicial com...
AbstractWe connect k-triangulations of a convex n-gon to the theory of Schubert polynomials. We use ...
The associahedron is at the interface between several mathematical fields. Combinatorially, it is th...
The associahedron is at the interface between several mathematical fields. Combinatorially, it is th...
The associahedron is at the interface between several mathematical fields. Combinatorially, it is th...
The associahedron is at the interface between several mathematical fields. Combinatorially, it is th...
AbstractGiven a convex n-gon P in R2 with vertices in general position, it is well known that the si...
Given an arbitrary simple polygon, we construct a polytopal complex analogous to the associahedron b...
2021 Fall.Includes bibliographical references.A convex polyhedron is the convex hull of a finite set...
When does a topological polyhedral complex (embedded in Rd) admit a geometric realization (a rectili...
AbstractFor n≥3, let Ωn be the set of line segments between the vertices of a convex n-gon. For j≥2,...
Let Pn be a convex n-gon in the plane, n ⩾ 3. Consider Σn, the collection of all sets of mutually no...
Motivated by the question of the polytopal realizability of the simplicial complex Γn,k of (k + 1)-c...
AbstractThe (type-A) associahedron is a polytope related to polygon dissections which arises in seve...
International audienceMotivated by the question of the polytopal realizability of the simplicial com...
International audienceMotivated by the question of the polytopal realizability of the simplicial com...
AbstractWe connect k-triangulations of a convex n-gon to the theory of Schubert polynomials. We use ...
The associahedron is at the interface between several mathematical fields. Combinatorially, it is th...
The associahedron is at the interface between several mathematical fields. Combinatorially, it is th...
The associahedron is at the interface between several mathematical fields. Combinatorially, it is th...
The associahedron is at the interface between several mathematical fields. Combinatorially, it is th...
AbstractGiven a convex n-gon P in R2 with vertices in general position, it is well known that the si...
Given an arbitrary simple polygon, we construct a polytopal complex analogous to the associahedron b...
2021 Fall.Includes bibliographical references.A convex polyhedron is the convex hull of a finite set...
When does a topological polyhedral complex (embedded in Rd) admit a geometric realization (a rectili...
AbstractFor n≥3, let Ωn be the set of line segments between the vertices of a convex n-gon. For j≥2,...