Related papers: The greedy basis equals the theta basis

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 compare the canonical basis for a generalized Temperley-Lieb algebra of type A or B with the Kazhdan-Lusztig basis for the corresponding Hecke algebra.

The goal of this paper is to study the performance of the Thresholding Greedy Algorithm (TGA) when we increase the size of greedy sums by a constant factor $\lambda\geqslant 1$. We introduce the so-called $\lambda$-almost greedy and…

In 1999, S. V. Konyagin and V. N. Temlyakov introduced the so-called Thresholding Greedy Algorithm. Since then, there have been many interesting and useful characterizations of greedy-type bases in Banach spaces. In this article, we study…

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…

Okounkov [Oko03] conjectured the log-concavity about the structure constants for many interesting basis from representation theory. For the cluster algebra, Gross, Hacking, Keel, Kontsevich [GHKK18] introduced the atomic theta basis. We…

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 construct common triangular bases for almost all the known (quantum) cluster algebras from Lie theory. These bases provide analogs of the dual canonical bases, long anticipated in cluster theory. In cases where the generalized Cartan…

We construct "quantum theta bases," extending the set of quantum cluster monomials, for various versions of skew-symmetric quantum cluster algebras. These bases consist precisely of the indecomposable universally positive elements of the…

Let S be a planar point set. Krznaric and Levcopoulos proved that given the Delaunay triangulation DT(S) for S, one can find the greedy triangulation GT(S) in linear time. We provide a (partial) converse of this result: given GT(S), it is…

It is known that a basis is almost greedy if and only if the thresholding greedy algorithm gives essentially the smallest error term compared to errors from projections onto intervals or in other words, consecutive terms of $\mathbb{N}$. In…

For two countable ordinals $\alpha$ and $\beta$, a basis of a Banach space $X$ is said to be $(\alpha, \beta)$-quasi-greedy if it is 1) quasi-greedy, 2) $\mathcal{S}_\alpha$-unconditional but not $\mathcal{S}_{\alpha+1}$-unconditional, and…

Greedy bases are those bases where the Thresholding Greedy Algorithm (introduced by S. V. Konyagin and V. N. Temlyakov) produces the best possible approximation up to a constant. In 2017, Bern\'a and Blasco gave a characterization of these…

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 show that the Lindenstrauss basic sequence in l_1 may be used to construct a conditional quasi-greedy basis of l_1, thus answering a question of Wojtaszczyk. We further show that the sequence of coefficient functionals for this basis is…

We prove thatthe Banach space $(\oplus_{n=1}^\infty \ell_p^n)_{\ell_q}$, which is isomorphic to certain Besov spaces, has a greedy basis whenever $1\leq p \leq\infty$ and $1<q<\infty$. Furthermore, the Banach spaces $(\oplus_{n=1}^\infty…

Lusztig proved that the Kazhdan-Lusztig basis of a spherical Hecke algebra can be essentially identified with the Weyl characters of the Langlands dual group. We generalize this result to the unequal parameter case. The new proof is pretty…

We give a new proof of the equivalence between two of the main models for $(\infty,n)$-categories, namely the $n$-fold Segal spaces of Barwick and the $\Theta_{n}$-spaces of Rezk, by proving that these are algebras for the same monad on the…

A base for a subgroup $G$ of $\mathrm{Sym}(\Omega)$ is a sequence of elements of $\Omega$ with trivial pointwise stabiliser. The size of the smallest base for $G$ is denoted $b(G)$. There is a natural greedy algorithm to compute a base for…

We characterize the approximation spaces of a broad class of bases - which includes almost greedy bases - in terms of weighted Lorentz spaces. For those bases, we also find necessary and sufficient conditions under which the approximation…