Related papers: An Infinitely Generated Upper Cluster Algebra
We construct geometric realization for non-exceptional mutation-finite cluster algebras by extending the theory of Fomin and Thurston to skew-symmetrizable case. Cluster variables for these algebras are renormalized lambda lengths on…
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.…
This paper develops techniques for producing presentations of upper cluster algebras. These techniques are suited to computer implementation, and will always succeed when the upper cluster algebra is totally coprime and finitely generated.…
In \cite{CK2005} and \cite{Hubery2005}, the authors proved the cluster multiplication theorems for finite type and affine type. We generalize their results and prove the cluster multiplication theorem for arbitrary type by using the…
Working over an infinite field of positive characteristic, an upper bound is given for the nilpotency index of a finitely generated nil algebra of bounded nil index $n$ in terms of the maximal degree in a minimal homogenous generating…
We apply our previous work on cluster characters for Hom-infinite cluster categories to the theory of cluster algebras. We give a new proof of Conjectures 5.4, 6.13, 7.2, 7.10 and 7.12 of Fomin and Zelevinsky's Cluster algebras IV for…
We show that the coordinate ring of a simply-connected simple algebraic group $G$ over the complex number field coincides with the Berenstein--Fomin--Zelevinsky cluster algebra and its upper cluster algebra, at least when $G$ is not of type…
We study the lower bound algebras generated by the generalized projective cluster variables of acyclic generalized cluster algebras of geometric types. We prove that this lower bound algebra coincides with the corresponding generalized…
We establish certain fundamental properties of $f$-vectors and $F$-matrices for generalized cluster algebras, including the initial and final seed mutation formulas, the compatibility property and the symmetry property. Along the way, we…
Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…
We prove the Berenstein-Zelevinsky conjecture that the quantized coordinate rings of the double Bruhat cells of all finite dimensional simple algebraic groups admit quantum cluster algebra structures with initial seeds as specified by [4].…
We introduce a category of cluster algebras with fixed initial seeds. This category has countable coproducts, which can be constructed combinatorially, but no products. We characterise isomorphisms and monomorphisms in this category and…
Inspired by recent work of Geiss-Leclerc-Schroer, we use Hom-finite cluster categories to give a good candidate set for a basis of (upper) cluster algebras with coefficients arising from quivers. This set consists of generic values taken by…
All algebras in a very large, axiomatically defined class of quantum nilpotent algebras are proved to possess quantum cluster algebra structures under mild conditions. Furthermore, it is shown that these quantum cluster algebras always…
In the cluster algebra literature, the notion of a graded cluster algebra has been implicit since the origin of the subject. In this work, we wish to bring this aspect of cluster algebra theory to the foreground and promote its study. We…
We initiate a study of the dependence on the choice of ground ring on the question of whether a cluster algebra is equal to its upper cluster algebra. A condition for when there is equality of the cluster algebra and upper cluster algebra…
In this paper, for a given finitely generated algebra (an algebraic structure with arbitrary operations and no predicates) A we study finitely generated limit algebras of A, approaching them via model theory and algebraic geometry. Along…
Generating trees are a useful technique in the enumeration of various combinatorial objects, particularly restricted permutations. Quite often the generating tree for the set of permutations avoiding a set of patterns requires infinitely…
A prototypical examples of a cluster algebra is the coordinate ring of a finite Grassmannian: using the Pl\"ucker embedding the cluster algebra structure allows one to move between `maximal sets' of algebraically independent Pl\"ucker…
Classes of algebraic structures that are defined by equational laws are called varieties or equational classes. A variety is finitely generated if it is defined by the laws that hold in some fixed finite algebra. We show that every…