Related papers: Characterization of weight-semi-greedy bases

A basic result in semigroup theory states that every $C_0$-semigroup is quasi-contractive with respect to some appropriately chosen equivalent norm. This paper contains a counterpart of this well-known fact. Namely, by examining the…

We consider a bounded representation $T$ of a commutative semigroup $S$ on a Banach space and analyse the relation between three concepts: (i) properties of the unitary spectrum of $T$, which is defined in terms of semigroup characters on…

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

Let $\K$ be a field and $(f_1, \ldots, f_n)\subset \K[X_1, \ldots, X_n]$ be a sequence of quasi-homogeneous polynomials of respective weighted degrees $(d_1, \ldots, d_n)$ w.r.t a system of weights $(w_{1},\dots,w_{n})$. Such systems are…

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…

We compare several versions of the quantitative Schur property of Banach spaces. We establish their equivalence up to multiplicative constants and provide examples clarifying when the change of constants is necessary. We also give exact…

The Bernstein approximation problem is to determine whether or not the space of all polynomials is dense in a given weighted $C_0$-space on the real line. A theorem of L. de Branges characterizes non--density by existence of an entire…

Erd\H{o}s and Graham found it conceivable that the best $n$-term Egyptian underapproximation of almost every positive number for sufficiently large $n$ gets constructed in a greedy manner, i.e., from the best $(n-1)$-term Egyptian…

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…

A greedy embedding of a graph $G = (V,E)$ into a metric space $(X,d)$ is a function $x : V(G) \to X$ such that in the embedding for every pair of non-adjacent vertices $x(s), x(t)$ there exists another vertex $x(u)$ adjacent to $x(s)$ which…

An $n$-vertex graph $G$ of edge density $p$ is considered to be quasirandom if it shares several important properties with the random graph $G(n,p)$. A well-known theorem of Chung, Graham and Wilson states that many such `typical'…

We establish estimates for the Lebesgue parameters of the Chebyshev Weak Thresholding Greedy Algorithm in the case of general bases in Banach spaces. These generalize and slightly improve earlier results in [9], and are complemented with…

We study a class of quasi-variational inequality problems defined over infinite dimensional Banach space and deduce sufficient conditions for ensuring solutions to such problems under the upper semi-continuity and pseudomonotonicity…

We introduce the notion of cotype of a metric space, and prove that for Banach spaces it coincides with the classical notion of Rademacher cotype. This yields a concrete version of Ribe's theorem, settling a long standing open problem in…

The aim of the paper is to highlight some open problems concerning approximation properties of Hardy spaces. We also present some results on the bounded compact and the dual compact approximation properties (shortly, BCAP and DCAP) of such…

We present convergence estimates of two types of greedy algorithms in terms of the metric entropy of underlying compact sets. In the first part, we measure the error of a standard greedy reduced basis method for parametric PDEs by the…

Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…

Let $k$ be a field of characteristic $0$, let $\mathsf{C}$ be a finite split category, let $\alpha$ be a 2-cocycle of $\mathsf{C}$ with values in the multiplicative group of $k$, and consider the resulting twisted category algebra…

We analyze the performance of the greedy algorithm, and also a discrete semi-gradient based algorithm, for maximizing the sum of a suBmodular and suPermodular (BP) function (both of which are non-negative monotone non-decreasing) under two…