2018
DOI: 10.1016/j.jalgebra.2018.05.019
|View full text |Cite
|
Sign up to set email alerts
|

F-polynomial formula from continued fractions

Abstract: For cluster algebras from surfaces, there is a known formula for cluster variables and F -polynomials in terms of the perfect matchings of snake graphs. If the cluster algebra has trivial coefficients, there is also a known formula for cluster variables in terms of continued fractions. In this paper, we extend this result to cluster algebras with principal coefficients by producing a formula for the F -polynomials in terms of continued fractions.2000 Mathematics Subject Classification. Primary: 13F60, Secondar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(10 citation statements)
references
References 11 publications
0
10
0
Order By: Relevance
“…There are a few quantities defined on continued fractions which we will use often in this paper. These can be found in [LS19], [CS18], and [Rab18] (among others) defined only for positive or even continued fractions. We extend them here to all continued fractions.…”
Section: Proposition 21 ([Hw79][ls19]mentioning
confidence: 99%
“…There are a few quantities defined on continued fractions which we will use often in this paper. These can be found in [LS19], [CS18], and [Rab18] (among others) defined only for positive or even continued fractions. We extend them here to all continued fractions.…”
Section: Proposition 21 ([Hw79][ls19]mentioning
confidence: 99%
“…Remark 2.1.1. The connection between these posets and F -polynomials in cluster algebras has been noted in [MSW11], [Rab18], [BG21], and [Cla20]. These posets were called "fence posets" in [MSS21] and "piece-wise linear posets" in [BG21].…”
Section: Combinatorial Interpretationsmentioning
confidence: 99%
“…, G k ) is the single edge e j if j > k. The decomposition is in fact obtained by deleting the sign-changed tiles. Following [33], once we choose the minimal perfect matching P − of a snake graph G, then the minimal matching P − | H i of a subsnake graph H i is either the matching which inherits from P − or the union of the matching which inherits from P − and a unique interior edge.…”
Section: Preliminarymentioning
confidence: 99%
“…For simplicity, let j ℓ=i x ℓ = 1 for j < i. The following results from [33] will play an important role in the subsequent proof. In [33] Rabideau required that S G ∈ P − for a labeled snake graph G. Lemma 2.8.…”
Section: Preliminarymentioning
confidence: 99%
See 1 more Smart Citation