A Combinatorial Formula for Rank 2 Cluster Variables

preprint2011arXivOpen access

Abstract

Let rr be any positive integer, and let x1,x2x_1, x_2 be indeterminates. We consider the sequence {xn}\{x_n\} defined by the recursive relation xn+1=(xnr+1)/xn−1 x_{n+1} =(x_n^r +1)/{x_{n-1}} for any integer nn. Finding a combinatorial expression for xnx_n as a rational function of x1x_1 and x2x_2 has been an open problem since 2001. We give a direct elementary formula for xnx_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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.