Algebraic Combinatorics 2018
DOI: 10.5802/alco.25
|View full text |Cite
|
Sign up to set email alerts
|

Towards a uniform subword complex description of acyclic finite type cluster algebras

Abstract: It has been established in recent years how to approach acyclic cluster algebras of finite type using subword complexes. In this paper, we continue this study by describing the c-and g-vectors, and by providing a conjectured description of the Newton polytopes of the F -polynomials. In particular, we show that this conjectured description would imply that finite type cluster complexes are realized by the duals of the Minkowski sums of the Newton polytopes of either the F -polynomials, or of the cluster variabl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
11
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(12 citation statements)
references
References 22 publications
1
11
0
Order By: Relevance
“…We employ our algorithms to compute all maximal-dimensional cones in TGr + (3, 8) and compare them to the cluster complex of Gr(3, 8). We verify that [SW05, Conjecture 8.1] holds, which is proven to be true in [BS18]. This serves as a verification of our computations, and as an alternative proof of the conjecture in this specific case.…”
Section: Introductionsupporting
confidence: 68%
See 2 more Smart Citations
“…We employ our algorithms to compute all maximal-dimensional cones in TGr + (3, 8) and compare them to the cluster complex of Gr(3, 8). We verify that [SW05, Conjecture 8.1] holds, which is proven to be true in [BS18]. This serves as a verification of our computations, and as an alternative proof of the conjecture in this specific case.…”
Section: Introductionsupporting
confidence: 68%
“…It is also conjectured [SW05,Conjecture 8.1] that they encode the combinatorics of cluster algebras of finite type. This was proven recently by Brodsky and Stump for many important cases [BS18].…”
Section: Introductionmentioning
confidence: 55%
See 1 more Smart Citation
“…Let us consider the Mellit chart M, as constructed in Theorem 2.28, and ω M its corresponding 2-form. 12 In this subsection, we will first show that ω M/Tπ is nondegenerate, and thus (holomorphic) symplectic. Then we prove, in Theorem 3.5, that ω induces the holomorphic symplectic structure according to Theorem 1.1.…”
Section: Holomorphic Symplectic Structurementioning
confidence: 99%
“…Subword Complexes. First, the combinatorics of weaves appears to be closely related to the combinatorics of subword complexes and brick polytopes [12,22,32,42,43,51,59,60,78]. The faces of a subword complex for a braid word γ correspond to all possible subwords of γ such that the Demazure product of their complements equals w 0 .…”
Section: Future Directionsmentioning
confidence: 99%