相关论文: Saturation of Newton polytopes of type A and D clu…
We study Newton polytopes of cluster variables in type A_n cluster algebras, whose cluster and coefficient variables are indexed by the diagonals and boundary segments of a polygon. Our main results include an explicit description of the…
We characterize the cluster variables of skew-symmetrizable cluster algebras of rank 3 by their Newton polytopes. The Newton polytope of the cluster variable $z$ is the convex hull of the set of all $\mathbf{p}\in\mathbb{Z}^3$ such that the…
In a cluster algebra, a subset of initial cluster variables can be specialised in such a way that all elements of the resulting algebra become polynomial in the remaining variables.
Associated to any acyclic cluster algebra is a corresponding triangulated category known as the cluster category. It is known that there is a one-to-one correspondence between cluster variables in the cluster algebra and exceptional…
Let $\Sigma$ be Laurent phenomenon (LP) seed of rank $n$, $\mathcal{A}(\Sigma)$, $\mathcal{U}(\Sigma)$ and $\mathcal{L}(\Sigma)$ be its corresponding Laurent phenomenon algebra, upper bound and lower bound respectively. We prove that each…
In this paper, we study the Newton polytopes of $F$-polynomials in a TSSS cluster algebra $\mathcal A$ and generalize them to a larger set consisting of polytopes $N_{h}$ associated to vectors $h\in\Z^{n}$ as well as $\widehat{\mathcal{P}}$…
The Fomin-Zelevinsky Laurent phenomenon states that every cluster variable in a cluster algebra can be expressed as a Laurent polynomial in the variables lying in an arbitrary initial cluster. We give representation-theoretic formulas for…
We introduce a general class of symmetric polynomials that have saturated Newton polytope and their Newton polytope has integer decomposition property. The class covers numerous previously studied symmetric polynomials.
We give a criterion which characterizes a real multi-variate Laurent polynomial with full-dimensional smooth Newton polytope to have the property that all sufficiently large powers of the polynomial have fully positive coefficients. Here a…
We study cluster algebras over $\mathbb{F}_2$. By the Laurent phenomenon there is a map from the set of seeds of the cluster algebra to the corresponding cluster variety. We show that in type $A$, fibers of this map can be described in…
We study the dependence of a cluster algebra on the choice of coefficients. We write general formulas expressing the cluster variables in any cluster algebra in terms of the initial data; these formulas involve a family of polynomials…
A polynomial has saturated Newton polytope (SNP) if every lattice point of the convex hull of its exponent vectors corresponds to a monomial. We compile instances of SNP in algebraic combinatorics (some with proofs, others conjecturally):…
We prove that the cluster monomials in non-initial cluster variables are uniquely determined by the Newton polytopes of their $F$-polynomials for skew-symmetrizable cluster algebras. Accordingly, we prove that the $\tau$-rigid modules and…
In [LP] we introduced Laurent phenomenon algebras, a generalization of cluster algebras. Here we give an explicit description of Laurent phenomenon algebras with a linear initial seed arising from a graph. In particular, any graph…
It has been established in recent years how to approach acyclic cluster algebras of finite type using subword complexes. In this paper, we continue this study by describing the c- and g-vectors, and by providing a conjectured description of…
Symmetric Grothendieck polynomials are inhomogeneous versions of Schur polynomials that arise in combinatorial $K$-theory. A polynomial has saturated Newton polytope (SNP) if every lattice point in the polytope is an exponent vector. We…
In this paper we give a graph theoretic combinatorial interpretation for the cluster variables that arise in most cluster algebras of finite type. In particular, we provide a family of graphs such that a weighted enumeration of their…
The nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby,…
We study cluster algebras that are associated to unpunctured surfaces with coefficients arising from boundary arcs. We give a direct formula for the Laurent polynomial expansion of cluster variables in these cluster algebras in terms of…
Let $X$ be the family of hypersurfaces in the odd-dimensional torus ${\mathbb T}^{2n+1}$ defined by a Laurent polynomial $f$ with fixed exponents and variable coefficients. We show that if $n\Delta$, the dilation of the Newton polytope…