Related papers: Greedy elements in rank 2 cluster algebras

We identify a quantum lift of the greedy basis for rank 2 coefficient-free cluster algebras. Our main result is that our construction does not depend on the choice of initial cluster, that it builds all cluster monomials, and that it…

In this note we extend the notion of greedy bases developed by Lee, Li, and Zelevinsky to rank two generalized cluster algebras, i.e. binomial exchange relations are replaced by polynomial exchange relations. In the process we give a…

There have been several combinatorial constructions of universally positive bases in cluster algebras, and these same combinatorial objects play a crucial role in the known proofs of the famous positivity conjecture for cluster algebras.…

We study the relationship between the positivity property in a rank 2 cluster algebra, and the property of such an algebra to be tame. More precisely, we show that a rank 2 cluster algebra has a basis of indecomposable positive elements if…

We establish the existence of a quantum lift of the greedy basis.

Motivated by the change-making problem, we extend the notion of greediness to sets of positive integers not containing the element $1$, and from there to numerical semigroups. We provide an algorithm to determine if a given set (not…

In this paper, we simplify and generalize formulas for the expansion of rank 2 cluster variables. In particular, we prove an equivalent, but simpler, description of the colored Dyck subpaths framework introduced by Lee and Schiffler. We…

We prove the equality of two canonical bases of a rank 2 cluster algebra, the greedy basis of Lee-Li-Zelevinsky and the theta basis of Gross-Hacking-Keel-Kontsevich.

The article gives a ring theoretic perspective on cluster algebras. Gei{\ss}-Leclerc-Schr\"oer prove that all cluster variables in a cluster algebra are irreducible elements. Furthermore, they provide two necessary conditions for a cluster…

The change-making problem was recently extended to sets of positive integers not containing the element $1$, and from there to numerical semigroups. A greedy numerical semigroup is defined as a numerical semigroup where the greedy…

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.…

We study greedy-type algorithms such that at a greedy step we pick several dictionary elements contrary to a single dictionary element in standard greedy-type algorithms. We call such greedy algorithms {\it super greedy algorithms}. The…

The main motivation for the study of cluster algebras initiated in math.RT/0104151, math.RA/0208229 and math.RT/0305434 was to design an algebraic framework for understanding total positivity and canonical bases in semisimple algebraic…

We develop an elementary formula for certain non-trivial elements of upper cluster algebras. These elements have positive coefficients. We show that when the cluster algebra is acyclic these elements form a basis. Using this formula, we…

We prove that the basis of cluster monomials of a skew-symmetric cluster algebra A of finite type is the atomic basis of A. This means that an element of A is positive if and only if it has a non-negative expansion in the basis of cluster…

Sherman-Zelevinsky and Cerulli constructed canonically positive bases in cluster algebras associated to affine quivers having at most three vertices. Both constructions involve cluster monomials and normalized Chebyshev polynomials of the…

For Schauder bases, Dilworth et al. introduced and characterized the partially greedy property, which is strictly weaker than the (almost) greedy property. Later, Berasategui et al. defined and studied the strong partially greedy property…

We shall present new characterizations of partially greedy and almost greedy bases. A new class of basis (which we call reverse partially greedy basis) arises naturally from these characterizations of partially greedy bases. We also give…

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…

A novel and detailed convergence analysis is presented for a greedy algorithm that was previously introduced for operator reconstruction problems in the field of quantum mechanics. This algorithm is based on an offline/online decomposition…