Abstract
Abstract 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 $\textbf {c}$-vectors and $\textbf {g}$-vectors along a finite sequence of mutations from the initial seed to the given seed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
