Fix three non-negative integers b12 = b23 = b13 − 1 = 1.

Let Q be the acyclic quiver with

three mutable vertices 1, 2, 3, and bij arrows from i to j. Let A be the cluster algebra with
principal coefficients. Here we give a conjectural formula for preprojective cluster variables.
We mutate at 1, 2, 3, 1, 2, 3, ..., and label the cluster variables that are obtained from this
sequence of mutations as follows.
(0) (0) (0)
L1 L2 L3
(1) (1) (1)
L1 L2 L3
.. .. ..
. . .
(−1)
When we consider initial cluster variables, we let Li = xi .
(j) (j) (j) (j) (j)
Let di = ((di )1 , (di )2 , (di )3 ) be the denominator vector of Li .
(j)
Lemma 0.1. Fix any i ∈ {1, 2, 3}. Then the sequence {di }j≥−1 of vectors satisfies the
following linear recursive relation:
(j+3) (j+2) (j+1) (j)
di − 5di − 5di + di = 0.
(j)
Consider the sequence ((d1 )1 )j≥0 = (1, 6, 36, 209, 1219, ...). Let λ1 > λ2 be the two
irrational roots of the characteristic equation x3 − 5x2 − 5x + 1 = (x + 1)(x2 − 6x + 1). Then
it is straightforward to show that

(j) 7(λ1 + 1) j 7(λ2 + 1) j 1

(d1 )1 = λ1 + λ + (−1)j .
8(λ1 − λ2 ) 8(λ2 − λ1 ) 2 8
(j)
The general entry of the sequence ((d1 )3 )j≥0 = (0, 2, 13, 75, 438, ...) is

(j) (λ2 + 17) j (λ1 + 17) j 1

(d1 )3 = λ1 + λ + (−1)j .
8(λ1 − λ2 ) 8(λ2 − λ1 ) 2 8
(j)
Other (di )k will be of similar form.
(j) 3 a1 −a2 5 8 a1
Lemma 0.2. Let (a1 , a2 , a3 ) = di for j > 0. Then 2
≤ a3
≤ 3
and 3
≤ a3
≤ 3.
3 a1 −a2
Since 2
≤ a3
≤ 2, there exist two non-negative integers α and β such that

(a1 − a2 , a3 ) = α(2, 1) + β(3, 2).

It is easy to see that α = 2(a1 − a2 ) − a3 .

Since 38 ≤ aa13 ≤ 3, there are two non-negative integers u and v such that

(a1 , a3 ) = u(3, 1) + v(8, 3).

Note that v = 3a3 − a1 .

These α and v will play roles in our formula.
(j)
Lemma 0.3. Let (a1 , a2 , a3 ) = di for j > 0. Then v ≥ α.
1
2

1. Formula
Definition 1.1. A finite sequence of lattice points ((a1 , b1 ), ..., (an , bn )) on Z2≥0 is said to be
admissible if 23 ≤ ab11 ≤ 53 and (ai+1 , bi+1 ) = (ai − 5, bi − 3) for all i ∈ {1, ..., n − 1}.
Note that n and (a1 , b1 ) determine the sequence.
For (a1 , a2 , a3 ) ∈ Z3 with a2 = 0, let x[a1 , a2 , a3 ] be the greedy basis element of A with
the denominator xa11 xa33 . Since a2 = 0, we have a well-understood rank 2 greedy formula for
x[a1 , 0, a3 ] in terms of compatible pairs.
For x ∈ Z and y ∈ Z≥0 , the binomial coefficient we will use is
 
x
= x(x − 1) · · · (x − y + 1)/y!
y
Definition 1.2. Let ((a1 , b1 ), ..., (an , bn )) be an admissible sequence. Then we define the
corresponding sequence (z1 , ..., zn ) of n elements in the cluster algebra A as follows.
if abii ≥ 32 ;

 x[ai , 0, bi ],
zi =
 P2a1 −3b1 2a1 −3b1 −i

j=0 j
x[ai − 6j, 0, bi − 4j], if abii < 32 .
(c,d) (c,d)
Let Aai ×bi be the coefficient of x12d−ai xc+d
2 x3
2c−bi
in zi (with y1 = y2 = y3 = 1). Let Ba×b
be the number of compatible pairs (S1 , S2 ) with |S1 | = c and |S2 | = d in the maximal Dyck
path of size a × b (here the cardinality of the shadow of each edge is assumed to be 3).
Definition 1.3. Suppose that (a1 , a2 , a3 ) satiesfies 23 ≤ a1a−a3
2
≤ 53 and 38 ≤ aa13 ≤ 3. Consider
the admissible sequence ((a1 − a2 , a3 ), ..., (a1 − a2 − 5w, a3 − 3w)), where w = 3a3 − a1 . Define
 
1 X a2 − r − s − i a2 −s−t r+s 2r+3s+t 2 i
P [a1 , a2 , a3 ] = a1 a2 a3 C(r, s, i) x1 x2 x3 (x1 x2 ) ,
x1 x2 x3 4
t
(r,s,i,t)∈Z≥0

where
(r,i)
C(r, 0, i) = A(a1 −a2 )×a3 ;

(s,i)
C(0, s, i) = Ba1 ×a3 ;
Ps w

a1 −r−3i

(r,i−3j)
in general C(r, s, i) = j=0 j s−j
A(a1 −a2 −5j)×(a3 −3j) .
(j)
Conjecture 1.4. Let (a1 , a2 , a3 ) = di for j > 0. Then
α  
(j)
X v−α
Li = P [a1 − 20k, a2 − 9k, a3 − 7k].
k=0
k