Related papers: Combinatorial Expressions for F-polynomials in Cla…
In their "Cluster Algebras IV" paper, Fomin and Zelevinsky defined F-polynomials and g-vectors, and they showed that the cluster variables in any cluster algebra can be expressed in a formula involving the appropriate F-polynomial and…
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…
Lots of research focuses on the combinatorics behind various bases of cluster algebras. This paper studies the natural basis of a type A cluster algebra, which consists of all cluster monomials. We introduce a new kind of combinatorial…
In this article, we introduce combinatorial models for poly-Bernoulli polynomials and poly-Euler numbers of both kinds. As their applications, we provide combinatorial proofs of some identities involving poly-Bernoulli polynomials.
We show the polynomial property of $F$-polynomials for generalized quantum cluster algebras and obtain the associated separation formulas under a mild condition. Along the way, we obtain Gupta's formulas of $F$-polynomials for generalized…
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…
We give a purely combinatorial proof of the positivity of the stabilized forms of the generalized exponents associated to each classical root system. In finite type A_{n-1}, we rederive the description of the generalized exponents in terms…
We give a combinatorial model for F-polynomials and g-vectors for type D cluster algebras where the associated quiver is acyclic. Our model utilizes a combination of dimer configurations and double dimer configurations which we refer to as…
We study the $c$-vectors, $g$-vectors, and $F$-polynomials for generalized cluster algebras satisfying a normalization condition and a power condition recovering classical recursions and separation of additions formulas. We establish a…
F-polynomials and g-vectors were defined by Fomin and Zelevinsky to give a formula which expresses cluster variables in a cluster algebra in terms of the initial cluster data. A quantum cluster algebra is a certain noncommutative…
We use the differential algebra of polytopes to explain the known remarkable relation of the combinatorics of the associahedra and permutohedra with the universal compositional and multiplicative inversion formulas for the formal power…
In this note we augment the poly-Bernoulli family with two new combinatorial objects. We derive formulas for the relatives of the poly-Bernoulli numbers using the appropriate variations of combinatorial interpretations. Our goal is to show…
We compute the number of $\mathcal{X}$-variables (also called coefficients) of a cluster algebra of finite type when the underlying semifield is the universal semifield. For classical types, these numbers arise from a bijection between…
We develop a general approach to finding combinatorial models for cluster algebras. The approach is to construct a labeled graph called a framework. When a framework is constructed with certain properties, the result is a model…
By using the Poisson formula for resultants and the variants of chip-firing game on graphs, we provide a combinatorial method for computing a class of of resultants, i.e. the characteristic polynomials of the adjacency tensors of starlike…
We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…
We prove a classification of additive polynomial superfunctors, which allows us to compute some extensions of a superfunctor of the form $F \circ A$ where $F$ is a classical polynomial functor and $A$ is additive. We get a formula which…
This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…
We use the stabilization functors to study the combinatorial aspects of the $F$-polynomial of a representation of any finite-dimensional basic algebra. We characterize the vertices of their Newton polytopes. We give an explicit formula for…
In this paper we use the combinatorics of alcove walks to give a uniform combinatorial formula for Macdonald polynomials for all Lie types. These formulas are generalizations of the formulas of Haglund-Haiman-Loehr for Macdonald polynoimals…