arXiv:2112.11839 [math.CO]AbstractReferencesReviewsResources
Two Formulas for $F$-Polynomials
Feiyang Lin, Gregg Musiker, Tomoki Nakanishi
Published 2021-12-22, updated 2023-05-17Version 2
We discuss a product formula for $F$-polynomials in cluster algebras, and provide two proofs. One proof is inductive and uses only the mutation rule for $F$-polynomials. The other is based on the Fock-Goncharov decomposition of mutations. We conclude by expanding this product formula as a sum and illustrate applications. This expansion provides an explicit combinatorial computation of $F$-polynomials in a given seed that depends only on the $\mathbf{c}$-vectors and $\mathbf{g}$-vectors along a finite sequence of mutations from the initial seed to the given seed.
Journal: International Mathematics Research Notices (April 2023)
DOI: 10.1093/imrn/rnad074
Categories: math.CO
Subjects: 05E16
Keywords: polynomials, product formula, explicit combinatorial computation, finite sequence, mutation rule
Tags: journal article
Related articles: Most relevant | Search more
arXiv:2409.06878 [math.CO] (Published 2024-09-10)
Deformed Homogeneous $(s,t)$-Rogers-Szegö Polynomials and the Deformed $(s,t)$-Exponential Operator e$_{s,t}(y{\rm T}_a D_{s,t},v)$
arXiv:2309.11650 [math.CO] (Published 2023-09-20)
Dimensions of splines of degree two
arXiv:2309.01762 [math.CO] (Published 2023-09-04)
Thresholds for Pebbling on Grids