S. J. Dilworth, David Mitra
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 not quasi-greedy.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
It is known that for a conditional quasi-greedy basis $\mathcal{B}$ in a Banach space $\mathbb{X}$, the associated sequence $(k_{m}[\mathcal{B}])_{m=1}^{\infty}$ of its conditionality constants verifies the estimate $k_{m}[\mathcal{B}]=\mathcal{O}(\log m)$ and that if the reverse inequality $\log m =\mathcal{O}(k_m[\mathcal{B}])$ holds then $\mathbb{X}$ is non-superreflexive. Indeed, it is known that a quasi-greedy basis in a superreflexive quasi-Banach space fulfils the estimate $k_{m}[\mathcal{B}]=\mathcal{O}(\log m)^{1-ε}$ for some $ε>0$. However, in the existing literature one finds very f…
It is known that for a conditional quasi-greedy basis $\mathcal{B}$ in a Banach space $\mathbb{X}$, the associated sequence $(k_{m}[\mathcal{B}])_{m=1}^{\infty}$ of its conditionality constants verifies the estimate $k_{m}[\mathcal{B}]=\mathcal{O}(\log m)$ and that if the reverse inequality $\log m =\mathcal{O}(k_m[\mathcal{B}])$ holds then $\mathbb{X}$ is non-superreflexive. However, in the existing literature one finds very few instances of non-superreflexive spaces possessing quasi-greedy basis with conditionality constants as large as possible. Our goal in this article is to fill this gap.…
We construct for each $0<p\le 1$ an infinite collection of subspaces of $\ell_p$ that extend the example from [J. Lindenstrauss, On a certain subspace of $\ell_{1}$, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 12 (1964), 539-542] of a subspace of $\ell_{1}$ with no unconditional basis. The structure of this new class of $p$-Banach spaces is analyzed and some applications to the general theory of $\mathcal{L}_{p}$-spaces for $0<p<1$ are provided. The introduction of these spaces serves the purpose to develop the theory of conditional quasi-greedy bases in $p$-Banach spaces for $p<1$…
A semi-greedy Markushevich basis which is not quasi-greedy
构造拟 Banach 空间中的半贪婪 Markushevich 基，证明其非拟贪婪，否定等价性推广。
For a conditional quasi-greedy basis $\mathcal{B}$ in a Banach space the associated conditionality constants $k_{m}[\mathcal{B}]$ verify the estimate $k_{m}[\mathcal{B}]=\mathcal{O}(\log m)$. Answering a question raised by Temlyakov, Yang, and Ye, several authors have studied whether this bound can be improved when we consider quasi-greedy bases in some special class of spaces. It is known that every quasi-greedy basis in a superreflexive Banach space verifies $k_{m}[\mathcal{B}]=(\log m)^{1-ε}$ for some $0<ε<1$, and this is optimal. Our first goal in this paper will be to fill the gap in betw…
We introduce the notion of a \textit{weight-almost greedy} basis and show that a basis for a real Banach space is $w$-almost greedy if and only if it is both quasi-greedy and $w$-democratic. We also introduce the notion of \textit{weight-semi-greedy} basis and show that a $w$-almost greedy basis is $w$-semi-greedy and that the converse holds if the Banach space has finite cotype.
We construct a uniformly bounded orthonormal almost greedy basis for $L_p([0,1])$, $1<p<\infty$. The example shows that it is not possible to extend Orlicz's theorem, stating that there are no uniformly bounded orthonormal unconditional bases for $L_p([0,1])$, $p\not=2$, to the class of almost greedy bases.
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 characterizations for $1$-partially greedy and $1$-reverse partially greedy bases.
In this paper, motivated by the notion of $w$-Property $(A)$ defined in [2], we introduce the notions of $w$-left Property $(A)$ and $w$-right Property $(A)$. We also introduce the notions of $w$-partially greedy basis (using a characterization of partially greedy basis from [4]) and $w$-reverse partially greedy basis. The main aim of this paper is to study $(i)$ some characterizations of $w$-partially greedy and $w$-reverse partially greedy basis $(ii)$ conditions on the weight sequences when $w$-left Property $(A)$ and (or) $w$-right Property $(A)$ implies $w$-Property $(A)$.
We give a complete characterization of $2π$-periodic weights $w$ for which the usual trigonometric system forms a quasi-greedy basis for $L^p(\bT;w)$, i.e., bases for which simple thresholding approximants converge in norm. The characterization implies that this can happen only for $p=2$ and whenever the system forms a quasi-greedy basis, the basis must actually be a Riesz basis.
We study the problem of improving the greedy constant or the democracy constant of a basis of a Banach space by renorming. We prove that every Banach space with a greedy basis can be renormed, for a given $\vare>0$, so that the basis becomes $(1+\vare)$-democratic, and hence $(2+\vare)$-greedy, with respect to the new norm. If in addition the basis is bidemocratic, then there is a renorming so that in the new norm the basis is $(1+\vare)$-greedy. We also prove that in the latter result the additional assumption of the basis being bidemocratic can be removed for a large class of bases. Applicat…
We consider the $X$-Greedy Algorithm and the Dual Greedy Algorithm in a finite-dimensional Banach space with a strictly monotone basis as the dictionary. We show that when the dictionary is an initial segment of the Haar basis in $L_p[0,1]$ ($1 < p < \infty$) then the algorithms terminate after finitely many iterations and that the number of iterations is bounded by a function of the length of the initial segment. We also prove a more general result for a class of strictly monotone bases.
We show that, for quasi-greedy bases in Hilbert spaces, the associated conditionality constants grow at most as $O(\log N)^{1-ε}$, for some $ε>0$, answering a question by Temlyakov. We show the optimality of this bound with an explicit construction, based on a refinement of the method of Olevskii. This construction leads to other examples of quasi-greedy bases with large $k_N$ in Banach spaces, which are of independent interest.
Lower-Order Refinements of Greedy Approximation
本文研究了在β≤α+1条件下，构建满足特定无条件和民主性质的(α,β)-准贪心基的方法与结果。
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 $λ\geqslant 1$. We introduce the so-called $λ$-almost greedy and $λ$-partially greedy bases. The case when $λ= 1$ gives us the classical definitions of almost greedy and (strong) partially greedy bases. We show that a basis is almost greedy if and only if it is $λ$-almost greedy for all (some) $λ\geqslant 1$. However, for each $λ> 1$, there exists an unconditional basis that is $λ$-partially greedy but is not $1$-partially greedy. Furthermo…
We continue with the study of greedy-type bases in quasi-Banach spaces started in [3]. In this paper, we study partially-greedy bases focusing our attention in two main results: -Characterization of partially-greedy bases in quasi-Banach spaces in terms of quasi-greediness and different conservative-like properties. -Given a $C$-partially-greedy basis in a quasi-Banach space, there exists a "renorming" such that the basis is $1$-partially-greedy.
Our aim is to investigate the properties of existence and uniqueness of greedy bases in Banach spaces. We show the non-existence of greedy basis in some Nakano spaces and Orlicz sequence spaces and produce the first-known examples of non-trivial spaces (i.e., different from $c_0$, $\ell_1$, and $\ell_2$) with a unique greedy basis.
We show that for quasi-greedy bases in real or complex Banach spaces the error of the thresholding greedy algorithm of order N is bounded by the best N- term error of approximation times a function of N which depends on the democracy functions and the quasi-greedy constant of the basis. If the basis is democratic this function is bounded by C logN. We show with two examples that this bound is attained for quasi-greedy democratic bases.
We define a family of weak thresholding greedy algorithms for the multivariate Haar basis for $L_1[0,1]^d$ ($d \ge 1$). We prove convergence and uniform boundedness of the weak greedy approximants for all $f \in L_1[0,1]^d$.
Quasi-greedy Markushevich bases, duality and norming subspaces
本文证明拟贪婪 Markushevich 基的对偶基张成赋范子空间，并将结果推广至较弱形式及文献中的其他类贪婪性质。
Conditional bases with Property~(A)
本文构造具有性质 (A) 但非无条件的 Schauder 基，解决长期难题，并以改进反例推进等距贪婪基理论。
This article closes the cycle of characterizations of greedy-like bases in the isometric case initiated in [F. Albiac and P. Wojtaszczyk, Characterization of $1$-greedy bases, J. Approx. Theory 138 (2006)] with the characterization of $1$-greedy bases and continued in [F. Albiac and J. L. Ansorena, Characterization of $1$-quasi-greedy bases, arXiv:1504.04368v1 [math.FA] (2015)] with the characterization of $1$-quasi-greedy bases. Here we settle the problem of providing a characterization of $1$-almost greedy bases in Banach spaces. We show that a (semi-normalized) basis in a Banach space is al…
We show that a (semi-normalized) basis in a Banach space is quasi-greedy with quasi-greedy constant equal to 1 if and only if it is unconditional with suppression-unconditional constant equal to 1.
Let $\mathcal{F}$ be a hereditary collection of finite subsets of $\mathbb{N}$. In this paper, we introduce and characterize $\mathcal{F}$-(almost) greedy bases. Given such a family $\mathcal{F}$, a basis $(e_n)_n$ for a Banach space $X$ is called $\mathcal{F}$-greedy if there is a constant $C\geqslant 1$ such that for each $x\in X$, $m \in \mathbb{N}$, and $G_m(x)$, we have $$\|x - G_m(x)\|\ \leqslant\ C \inf\left\{\left\|x-\sum_{n\in A}a_ne_n\right\|\,:\, |A|\leqslant m, A\in \mathcal{F}, (a_n)\subset \mathbb{K}\right\}.$$ Here $G_m(x)$ is a greedy sum of $x$ of order $m$, and $\mathbb{K}$ i…
Isometric renormings for greedy bases in Banach spaces, with applications to the Haar System in $L_p[0,1]$, $1<p<\infty$
研究通过等距重范数改进基的贪婪常数，证明若Banach空间具有无条件和双民主基且基本函数满足特定正则性，则可重范使其成为等距贪婪基，并应用于Haar系统等。
The fact that finite direct sums of two or more mutually different spaces from the family $\{\ell_{p} : 1\le p<\infty\}\cup c_{0}$ fail to have greedy bases is stated in [Dilworth et al., Greedy bases for Besov spaces, Constr. Approx. 34 (2011), no. 2, 281-296]. However, the concise proof that the authors give of this fundamental result in greedy approximation relies on a fallacious argument, namely the alleged uniqueness of unconditional basis up to permutation of the spaces involved. The main goal of this note is to settle the problem by providing a correct proof. For that we first show that…
We show that for quasi-greedy bases in real Banach spaces the error of the thresholding greedy algorithm of order N is bounded by the best N-term error of approximation times a constant which depends on the democracy functions and the quasi-greedy constant of the basis.
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$.
We continue the study undertaken in \cite{GHN} of left democracy function $h_l(N)=\inf_{#Λ=N}\left\|\sum_{n\in Λ_N} x_n\right\| $ of an unconditional basis in a Banach space $X$. We provide an example of a basis with $h_l$ non-doubling. Then we show that for bases with non-doubling $h_l$ the greedy projection is not optimal. Together with results from \cite{GHN} and improved by C. Cabrelli, G. Garrigós, E. Hernandez and U. Molter we get that the basis is greedy if and only if the greedy projection is optimal.
When Greedy Approximation Breaks: Counterexamples in Quasi-Banach Spaces
本文构造两个反例，解决贪婪逼近理论中关于基的长期开放问题，证明Banach包络和局部凸性会破坏拟贪婪性，揭示拟Banach空间与Banach空间的结构性差异。
In nonlinear greedy approximation theory, bidemocratic bases have traditionally played the role of dualizing democratic, greedy, quasi-greedy, or almost greedy bases. In this article we shift the viewpoint and study them for their own sake, just as we would with any other kind of greedy-type bases. In particular we show that bidemocratic bases need not be quasi-greedy, despite the fact that they retain a strong unconditionality flavor which brings them very close to being quasi-greedy. Our constructive approach gives that for each $1<p<\infty$ the space $\ell_p$ has a bidemocratic basis which …
The Thresholding Greedy Algorithm versus Approximations with Sizes Bounded by Certain Functions $f$
本文在 Banach 空间中引入并刻画了 $f$-贪婪基与 $f$-几乎贪婪基，证明了非恒等 $f$ 下两者等价，并用例子说明非几乎贪婪基可为 $f$-贪婪。
Garling sequence spaces admit a renorming with respect to which their standard unit vector basis is 1-greedy. We also discuss some additional properties of these Banach spaces related to uniform convexity and superreflexivity. In particular, our approach to the study of the superreflexivity of Garling sequence space provides an example of how essentially non-linear tools from greedy approximation can be used to shed light into the linear structure of the spaces.
The list of known Banach spaces whose linear geometry determines the (nonlinear) democracy functions of their quasi-greedy bases to the extent that they end up being democratic, reduces to $c_0$, $\ell_2$, and all separable $\mathcal{L}_1$-spaces. Oddly enough, these are the only Banach spaces that, when they have an unconditional basis, it is unique. Our aim in this paper is to study the connection between quasi-greediness and democracy of bases in nonlocally convex spaces. We prove that all quasi-greedy bases in $\ell_p$ for $0<p<1$ (which also has a unique unconditional basis) are democrati…
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 work, we give applications of this result to the study of conditional Schauder bases and conditional almost greedy bases in this new class of Banach spaces.
We show that the decreasing rearrangement of the Fourier series with respect to the Jacobi polynomials for functions in $L_p$ does not converge unless $p=2$. As a by-product of our work on quasi-greedy bases in $L_{p}(μ)$, we show that no normalized unconditional basis in $L_p$, $p\not=2$, can be semi-normalized in $L_q$ for $q\not=p$, thus extending a classical theorem of Kadets and Pełczy{ń}ski from 1968.
Rate of convergence of Thresholding Greedy Algorithms
本文研究了经典阈值贪婪算法相对于基的收敛速度，将逼近误差界定为$f$的范数与$A_1$-范数的乘积，并证明了针对三角基和Haar基的误差界是最优的。
The purpose of this paper is to quantify the size of the Lebesgue constants $(L_m)_{m=1}^{\infty}$ associated with the thresholding greedy algorithm in terms of a new generation of parameters that modulate accurately some features of a general basis. This fine-tuning of constants allows us to provide an answer to the question raised by Temlyakov in 2011 to find a natural sequence of greedy-type parameters for arbitrary bases in Banach (or quasi-Banach) spaces which combined linearly with the sequence of unconditionality parameters $(k_m)_{m=1}^{\infty}$ determines the growth of $(L_m)_{m=1}^{\…
We use new methods, specific of non-locally convex quasi-Banach spaces, to investigate when the quasi-greedy bases of a $p$-Banach space for $0<p<1$ are democratic. The novel techniques we obtain permit to show in particular that all quasi-greedy bases of the Hardy space $H_p(\mathbb{D})$ for $0<p<1$ are democratic while, in contrast, no quasi-greedy basis of $H_p(\mathbb{D}^d)$ for $d\ge 2$ is, solving thus a problem that was raised in [F. Albiac, J. L. Ansorena, and P. Wojtaszczyk, \textit{Quasi-greedy bases in $\ell_p$ ($0<p<1$) are democratic}, J. Funct. Anal. \textbf{280} (2021), no. 7, 1…
We prove that the sequence spaces $\ell_p\oplus\ell_q$ and the spaces of infinite matrices $\ell_p(\ell_q)$, $\ell_q(\ell_p)$ and $(\bigoplus_{n=1}^\infty \ell_p^n)_{\ell_q}$, which are isomorphic to certain Besov spaces, have an almost greedy basis whenever $0<p<1<q<\infty$. More precisely, we custom-build almost greedy bases in such a way that the Lebesgue parameters grow in a prescribed manner. Our arguments critically depend on the extension of the Dilworth-Kalton-Kutzarova method from [S. J. Dilworth, N. J. Kalton, and D. Kutzarova, On the existence of almost greedy bases in Banach spaces…
On sequential greedy-type bases
本文通过固定序列$(a_n)_{n=1}^\infty$，比较阈值贪心算法与投影到该序列及其移位连续项的结果，提出$\mathcal{F}_{(a_n)}$-几乎贪心性质，揭示其与经典性质的等价条件，并建立相关类似结论及介于两类性质间的新条件。
Greedy sampling designs via reduced basis methods: optimal recovery in the uniform norm
该研究针对再生核希尔伯特空间的最优采样恢复，通过降基方法建立线性采样宽度与Gelfand宽度的新比较，克服平方根间隙，经数值实验验证了方法的有效性。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。