2000 character limit reached
A Combinatorial Formula for Rank 2 Cluster Variables
Published 6 Jun 2011 in math.CO and math.RT | (1106.0952v3)
Abstract: Let $r$ be any positive integer, and let $x_1, x_2$ be indeterminates. We consider the sequence ${x_n}$ defined by the recursive relation $$ x_{n+1} =(x_nr +1)/{x_{n-1}} $$ for any integer $n$. Finding a combinatorial expression for $x_n$ as a rational function of $x_1$ and $x_2$ has been an open problem since 2001. We give a direct elementary formula for $x_n$ in terms of subpaths of a specific lattice path in the plane. The formula is manifestly positive, providing a new proof of a result by Nakajima and Qin.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.