2018
DOI: 10.1007/s00454-018-9973-4
|View full text |Cite
|
Sign up to set email alerts
|

Simion’s Type B Associahedron is a Pulling Triangulation of the Legendre Polytope

Abstract: We show that Simion's type B associahedron is combinatorially equivalent to a pulling triangulation of a type B root polytope called the Legendre polytope. Furthermore, we show that every pulling triangulation of the Legendre polytope yields a flag complex. Our triangulation refines a decomposition of the Legendre polytope given by Cho. We extend Cho's cyclic group action to the triangulation in such a way that it corresponds to rotating centrally symmetric triangulations of a regular (2n + 2)-gon. Finally, we… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
12
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(13 citation statements)
references
References 21 publications
1
12
0
Order By: Relevance
“…For this reason we call it the cyclohedral triangulation C n . (A related triangulation has been found recently and independently by Ehrenborg, Hetyei and Readdy [19], cf. Section 1.4.…”
Section: Introductionsupporting
confidence: 61%
See 1 more Smart Citation
“…For this reason we call it the cyclohedral triangulation C n . (A related triangulation has been found recently and independently by Ehrenborg, Hetyei and Readdy [19], cf. Section 1.4.…”
Section: Introductionsupporting
confidence: 61%
“…While preparing the final version of this manuscript, we became aware of the recent work by Ehrenborg, Hetyei and Readdy in [19]. There, the authors realize Simion's type B associahedron as a pulling triangulation of the boundary of the Legendre polytope conv{e i − e j : 1 ≤ i, j ≤ n, i = j}, also known as the full root polytope of type A n−1 [19]. We can recover their triangulation by projecting our cyclohedral triangulation of ∆ n ×∆ n along the span of the vectors {(e i , e i ) : i ∈ [n]}.…”
Section: Introductionmentioning
confidence: 99%
“…It is called cowell-covered if G is well-covered. For G 1 = G 2 = K d the complete graph on d vertices, the polytope P G 1 + (−P G 2 ) is the Legendre polytope studied by Hetyei et al [Het09,EHR18].…”
Section: Unconditional Reflexive Polytopes and Perfect Graphsmentioning
confidence: 99%
“…, n + 1} that is both the head and the tail of an arrow; see [14,Lemmas 4.2 and 4.4]. Equivalently, the faces are products of two simplices [11,Lemma 2.2]: we may write them as ∆ I × ∆ J where I, J = ∅, I ∩ J = ∅ and the symbol ∆ K denotes the convex hull of the set {e i : i ∈ K} for K ⊆ {1, 2, . .…”
Section: Preliminariesmentioning
confidence: 99%
“…Triangulations of root polytopes and of products of simplices have been a subject of intense study in recent years [2,5,6,7,13]. Motivated by an observation made in [9], we recently [11] established that the Simion type B associahedron [19] may be realized as a pulling triangulation of the Legendre polytope, defined as the convex hull of all differences of pairs of standard basis vectors in Euclidean space. These vertices can be thought of as arrows between numbered nodes.…”
Section: Introductionmentioning
confidence: 99%