2016
DOI: 10.48550/arxiv.1612.06845
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

F-polynomial formula from continued fractions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

1
1
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 0 publications
1
1
0
Order By: Relevance
“…Moreover, the numerator of that continued fraction is the number of perfect matchings of its associated snake graph. This relation to continued fractions was found in [CS4] and applications were given in [CS5,CLS,LS,R]. Therefore by Theorem 4.2, the numerator of the continued fraction associated to a Markov snake graph is that Markov number.…”
Section: Proof Of Conjectures 12 and 13supporting
confidence: 53%
See 1 more Smart Citation
“…Moreover, the numerator of that continued fraction is the number of perfect matchings of its associated snake graph. This relation to continued fractions was found in [CS4] and applications were given in [CS5,CLS,LS,R]. Therefore by Theorem 4.2, the numerator of the continued fraction associated to a Markov snake graph is that Markov number.…”
Section: Proof Of Conjectures 12 and 13supporting
confidence: 53%
“…General snake graphs were introduced in [MSW] in order to give a combinatorial formula for cluster variables in terms of perfect matchings. These graphs were further studied in [CS,CS2,CS3,CS4,CS5,R]. The special case of Markov snake graphs already appeared in [P].…”
Section: Proof Of Conjectures 12 and 13mentioning
confidence: 99%