Related papers: Rooted Clusters for Graph LP Algebras
Graph LP algebras are a generalization of cluster algebras introduced by Lam and Pylyavskyy. We provide a combinatorial proof of positivity for certain cluster variables in these algebras. This proof uses a hypergraph generalization of…
Laurent phenomenon algebras, first introduced by Lam and Pylyavskyy, are a generalization of cluster algebras that still possess many salient features of cluster algebras. Graph Laurent phenomenon algebras, defined by Lam and Pylyavskyy,…
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 was shown by Fomin, Shapiro and Thurston that some cluster algebras arise from orientable surfaces. Subsequently, Dupont and Palesi extended this construction to non-orientable surfaces. We link this framework to Lam and Pylyavskyy's…
It was shown by Fock, Goncharov and Fomin, Shapiro, Thurston that some cluster algebras arise from triangulated orientable suraces. Subsequently Dupont and Palesi generalised this construction to include unpunctured non-orientable surfaces,…
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…
Using the LP algebraic toolkit, Conway's original topograph is rethought of as a cluster construction, paving the way for a wider topography based on mutation-type local rules. As a remarkable application of such cluster-driven upgrade,…
We show that cluster algebras do not contain non-trivial units and that all cluster variables are irreducible elements. Both statements follow from Fomin and Zelevinsky's Laurent phenomenon. As an application we give a criterion for a…
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…
We mainly introduce an abstract pattern to study cluster algebras. Cluster algebras, generalized cluster algebras and Laurent phenomenon algebras are unified in the language of generalized Laurent phenomenon algebras (briefly, GLP algebras)…
A cluster is a finite set of generators of a cluster algebra. The Laurent Phenomenon of Fomin and Zelevinsky says that any element of a cluster algebra can be written as a Laurent polynomial in terms of any cluster. The upper cluster…
Generalized quantum cluster algebras introduced in [1] are quantum deformation of generalized cluster algebras of geometric types. In this paper, we prove that the Laurent phenomenon holds in these generalized quantum cluster algebras. We…
Cluster algebras are commutative rings with a set of distinguished generators having a remarkable combinatorial structure. They were introduced by Fomin and Zelevinsky in 2000 in the context of Lie theory, but have since appeared in many…
Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…
These are notes for a series of lectures presented at the ASIDE conference 2016. The definition of a cluster algebra is motivated through several examples, namely Markov triples, the Grassmannians $Gr_2(\mathbb{C})$, and the appearance of…
We generalize Fomin and Zelevinsky's cluster algebras by allowing exchange polynomials to be arbitrary irreducible polynomials, rather than binomials.
We consider a family of nonlinear recurrences with the Laurent property. Although these recurrences are not generated by mutations in a cluster algebra, they fit within the broader framework of Laurent phenomenon algebras, as introduced…
We give combinatorial formulas for the Laurent expansion of any cluster variable in any cluster algebra coming from a triangulated surface (with or without punctures), with respect to an arbitrary seed. Moreover, we work in the generality…
Cluster algebras are a class of commutative algebras whose generators are defined by a recursive process called mutation. We give a brief introduction to cluster algebras, and explain how discrete integrable systems can appear in the…
In 2013, Lee, Li, and Zelevinsky introduced combinatorial objects called compatible pairs to construct the greedy bases for rank-2 cluster algebras, consisting of indecomposable positive elements including the cluster monomials.…