Related papers: The valuation pairing on an upper cluster algebra
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…
In this paper, we introduce the enough $g$-pairs property for a principal coefficients cluster algebra, which can be understood as a strong version of the sign-coherence of the $G$-matrices. Then we prove that any skew-symmetrizable…
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…
This is an introductory survey on cluster algebras and their (additive) categorification using derived categories of Ginzburg algebras. After a gentle introduction to cluster combinatorics, we review important examples of coordinate rings…
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…
We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…
A rank-invariant clustering of variables is introduced that is based on the predictive strength between groups of variables, i.e., two groups are assigned a high similarity if the variables in the first group contain high predictive…
We show that for cluster algebras associated with finite quivers without oriented cycles (with no coefficients), a seed is determined by its cluster, as conjectured by Fomin and Zelevinsky.We also obtain an interpretation of the monomial in…
Tensor factorizations are computationally hard problems, and in particular, are often significantly harder than their matrix counterparts. In case of Boolean tensor factorizations -- where the input tensor and all the factors are required…
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…
In this paper we give a direct proof of the positivity conjecture for adapted quantum cluster variables. Moreover, our process allows one to explicitly compute formulas for all adapted cluster monomials and certain ordered products of…
We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear…
Rings of integer-valued polynomials are known to be atomic, non-factorial rings furnishing examples for both irreducible elements for which all powers factor uniquely (\emph{absolutely irreducibles}) and irreducible elements where some…
The article concerns the existence and uniqueness of quantisations of cluster algebras. We prove that cluster algebras with an initial exchange matrix of full rank admit a quantisation in the sense of Berenstein-Zelevinsky and give an…
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…
There are two main types of objects in the theory of cluster algebras: the upper cluster algebras ${{\boldsymbol{\mathsf U}}}$ with their Gekhtman-Shapiro-Vainshtein Poisson brackets and their root of unity quantizations…
This paper introduces the multidimensional butterfly factorization as a data-sparse representation of multidimensional kernel matrices that satisfy the complementary low-rank property. This factorization approximates such a kernel matrix of…
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…
Many clustering schemes are defined by optimizing an objective function defined on the partitions of the underlying set of a finite metric space. In this paper, we construct a framework for studying what happens when we instead impose…
Holm and Jorgensen have shown the existence of a cluster structure on a certain category $D$ that shares many properties with finite type $A$ cluster categories and that can be fruitfully considered as an infinite analogue of these. In this…