Related papers: Characterization of $1$-almost greedy bases
A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…
We prove some results on the rate of convergence of greedy algorithms, which provide expansions. We consider both the case of Hilbert spaces and the more general case of Banach spaces. The new ingredient of the paper is that we bound the…
We introduce a new class of quasi-Banach spaces as an extension of the classical Grand Lebesgue Spaces for small values of the parameter, and we investigate some its properties, in particular, completeness, fundamental function, operators…
We study the greedy (exploitation-only) algorithm in bandit problems with a known reward structure. We allow arbitrary finite reward structures, while prior work focused on a few specific ones. We fully characterize when the greedy…
Greedy algorithms are a fundamental category of algorithms in mathematics and computer science, characterized by their iterative, locally optimal decision-making approach, which aims to find global optima. In this review, we will discuss…
We analyse the problem of controllability for parameter-dependent linear finite-dimensional systems. The goal is to identify the most distinguished realisations of those parameters so to better describe or approximate the whole range of…
The rate of convergence of the classical Thresholding Greedy Algorithm with respect to bases is studied in this paper. We bound the error of approximation by the product of both norms -- the norm of $f$ and the $A_1$-norm of $f$. We obtain…
We discuss optimal constants of certain projections on subsequences of weakly null sequences. Positive results yield constants arbitrarily close to $1$ for Schreier type projections, and arbitrarily close to $1$ for Elton type projections…
In this paper we settle in the negative the problem of the superreflexivity of Garling sequence spaces by showing that they contain a complemented subspace isomorphic to a non superreflexive mixed-norm sequence space. As a by-product of our…
We show that finite dimensional Banach spaces fail to be uniformly non locally almost square. Moreover, we construct an equivalent almost square bidual norm on $\ell_\infty.$ As a consequence we get that every dual Banach space containing…
In recent work of the authors the notion of a derivation being approximately semi-inner arose as a tool for investigating (approximate) amenability questions for Banach algebras. Here we investigate this property in its own right, together…
The purpose of this article is to characterize the quasi-isometry type of a proper metric space via the Banach algebra of Higson functions on it.
We prove that the fundamental function of any almost greedy basis of $L_p$, $1<p<\infty$, grows as either $(m^{1/p})_{m=1}^\infty$ or $(m^{1/2})_{m=1}^\infty$.
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 study the boundedness of averaging projections associated with symmetric Schauder bases in quasi-Banach spaces. Although this property is standard in the Banach setting, it is far from clear in the absence of local convexity and, indeed,…
A Banach space is said to be Grothendieck if weak and weak$^*$ convergent sequences in the dual space coincide. This notion has been quantificated by H. Bendov\'{a}. She has proved that $\ell_\infty$ has the quantitative Grothendieck…
In this paper we proof that there exists a function f(x) belongs to L^1[0,1] such that a greedy algorithm with regard to generalized Walsh system does not converge to f(x) in L^1[0,1] norm, i.e. the generalized Walsh system is not a…
We study sparse approximation by greedy algorithms. We prove the Lebesgue-type inequalities for the Weak Chebyshev Greedy Algorithm (WCGA), a generalization of the Weak Orthogonal Matching Pursuit to the case of a Banach space. The main…
The aim of this article is to use Banach lattice techniques to study coordinate systems in function spaces. We begin by proving that the greedy algorithm of a basis is order convergent if and only if a certain maximal inequality is…
In this note, we study some concentration properties for Lipschitz maps defined on Hamming graphs, as well as their stability under sums of Banach spaces. As an application, we extend a result of Causey on the coarse Lipschitz structure of…