Fomin–Zelevinsky's conjectures on cluster algebras

About 15 years old · traced to

Let Tn\mathbb{T}_n be the nn-regular tree indexing seeds, let BB be an exchange matrix at a base vertex t0t_0, and let Fj;tB;t0F_{j;t}^{B;t_0} and gj;tB;t0\mathbf{g}_{j;t}^{B;t_0} denote the associated FF-polynomials and gg-vectors. For adjacent vertices t0t_0 and t1t_1 related by mutation in direction kk, write B′=μk(B)B'=\mu_k(B).

Fomin–Zelevinsky's conjectures. The following statements hold:

(i) Each polynomial Fj;tB;t0F_{j;t}^{B;t_0} has constant term 11.

(ii) Each polynomial Fj;tB;t0F_{j;t}^{B;t_0} has a unique monomial of maximal degree; this monomial has coefficient 11 and is divisible by all the other occurring monomials.

(iii) For every t∈Tnt\in\mathbb{T}_n, the vectors g1;tB;t0,…,gn;tB;t0\mathbf{g}_{1;t}^{B;t_0},\dots,\mathbf{g}_{n;t}^{B;t_0} are sign-coherent: for each i=1,…,ni=1,\dots,n, their iith components are either all nonnegative or all nonpositive.

(iv) For every t∈Tnt\in\mathbb{T}_n, the vectors g1;tB;t0,…,gn;tB;t0\mathbf{g}_{1;t}^{B;t_0},\dots,\mathbf{g}_{n;t}^{B;t_0} form a Z\mathbb{Z}-basis of the lattice Zn\mathbb{Z}^n.

(v) For any t∈Tnt\in\mathbb{T}_n and j=1,…,nj=1,\dots,n, if gj;tB;t0=(g1,…,gn)\mathbf{g}_{j;t}^{B;t_0}=(g_1,\dots,g_n) and gj;tB′;t1=(g1′,…,gn′)\mathbf{g}_{j;t}^{B';t_1}=(g'_1,\dots,g'_n), then

gi′={−gkif i=k,gi+[bik]+gk−bikmin⁡(gk,0)if i≠k.g'_i=\begin{cases} -g_k & \text{if }i=k,\\ g_i+[b_{ik}]_+g_k-b_{ik}\min(g_k,0) & \text{if }i\ne k. \end{cases}

These are the conjectures reproduced from earlier work and concern the constant terms and maximal monomials of FF-polynomials, sign-coherence and basis properties of gg-vectors, and their mutation rule. In the source they are presented in a section explaining consequences of sign-coherence and matrix identities; the supplied text does not establish their resolution, so their status is left open.

References

Primary source

Tomoki Nakanishi and Andrei Zelevinsky, “On tropical dualities in cluster algebras”, arXiv:1101.3736 (2011).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.