Recurrence formula, positivity and polytope basis in cluster algebras via Newton polytopes (2201.01440v3)

Abstract: We study Newton polytopes of $F$-polynomials in a TSSS cluster algebra $\mathcal A$ and generalize them to a larger set consisting of polytopes $N_h$ for $h\in{\mathbb Z}^n$. The main contribution contains: (i) obtaining a recurrence construction of Laurent expression of a cluster variable in a cluster from its $g$-vector; (ii) proving the subset $\mathcal P$ of $\widehat{\mathcal P}$ consisting of Laurent polynomials in $\widehat{\mathcal P}$ is a strongly positive ${\mathbb Z}Trop(Y)$-basis for ${\mathcal U}({\mathcal A})$ consisting of certain universally indecomposable Laurent polynomials when $\mathcal A$ is a cluster algebra with principal coefficients. For a cluster algebra $\mathcal A$ over a semifield $\mathbb P$ in general, $\mathcal P$ is a strongly positive ${\mathbb Z}{\mathbb P}$-basis for a subalgebra ${\mathcal I}_{\mathcal P}({\mathcal A})}$ of ${\mathcal U}({\mathcal A})}$. We call $\mathcal P$ a polytope basis; (iii) constructing some explicit maps among $F$-polynomials, $g$-vectors, $d$-vectors and cluster variables to characterize their relationship. As applications of (i), we give an affirmation to positivity conjecture of cluster variables in a TSSS cluster algebra, which in particular provides a new method different from that given by Gross etc. to present the positivity of cluster variables in the skew-symmetrizable case. And, a conjecture on Newton polytopes posed by Fei is answered affirmatively. For (ii), we know in rank $2$ case, $\mathcal P$ coincides with the greedy basis introduced by Lee etc.. Hence, we can regard the polytope basis $\mathcal P$ as a natural generalization of the greedy basis in any rank. As application of (iii), the positivity of $d$-vectors associated to non-initial cluster variables, which was a conjecture raised, is proved in a TSSS cluster algebra.