The Thresholding Greedy Algorithm, Greedy Bases, and Duality

Some new conditions that arise naturally in the study of the Thresholding Greedy Algorithm are introduced for bases of Banach spaces. We relate these conditions to best n-term approximation and we study their duality theory. In particular, we obtain a complete duality theory for greedy bases.     

On sum-product bases

We investigate additive-multiplicative bases in . Let , s>2, and . It is proved that , provided min {|B| ^s/2|A|^(s−2)/2,|A| ^s/2|B|^(s−2)/2}>p ^s/2. This note is supported by “Balaton Program Project” and OTKA grants K 61908, K 67676.     

On convergence of Weak Thresholding Greedy Algorithm in

For any 0<t<1 we construct a Weak Thresholding Greedy Algorithm with weakness parameter t which converges in L¹(0,1) with respect to the Haar system, i. e. the Haar system is a ‘good non quasi-greedy basis’.     

On weak bases

In this paper, we give an affirmative answer to Tanaka's question: Is a space X with a σ-hereditarily closure-preserving weak base g-metrizable? [Proc. Aroc. Amer. Math. Soc. 112 (1991) 283] and a negative answer to S. Lin's question: Is every weak base of a topological space a k-network? [S. Lin, Generalized Metric Spaces and Maps, Science Press, 1995, Problem 1.6.20]. We also discuss mapping theorems on weak bases and the product of weak bases.     

On the growth of the counting function of Stanley sequences

Given a finite set of nonnegative integers A with no three-term arithmetic progressions, the Stanley sequence generated by A, denoted as S(A), is the infinite set created by beginning with A and then greedily including strictly larger integers which do not introduce a three-term arithmetic progression in S(A). Erd?s et al. asked whether the counting function, S(A,x), of a Stanley sequence S(A) satisfies for every ?>0 and x>x₀(?,A). In this paper we answer this question in the affirmative; in fact, we prove the slightly stronger result that for x≥x₀(?,A).     

On some riesz bases

In this paper we consider three problems concerning systems of vector exponentials. In the first part we prove a conjecture of V. Komornik raised in [14] on the independence of the movement of a rectangular membrane in different points. It was independently proved by M. Horváth [9] and S. A. Avdonin (personal communication). The analogous problem for the circular membrane was partly solved in [3] — the complete solution is given in [10]. In the second part we fill in a gap in the theory of Blaschke-Potapov products developed in the paper [19] of Potapov. Namely we prove that the Blaschke-Potapov product is determined by its kernel sets up to a multiplicative constant matrix. In the third part of the present paper we give a multidimensional generalization of the notion of sine type function developed by Levin [16], [17] and by our generalization we prove the multidimensional variant of the Levin-Golovin basis theorem [16], [6].     

On some characterizations of inner product spaces

We study some characterizations of inner product spaces given in the literature. Among other things, we give an example showing that one of the characterizations given in the classical book of Amir (1986) is not correct.     

On some characterizations of preinvex fuzzy mappings

Jeyakumar (Methods Oper. Res. 55:109–125, 1985) and Weir and Mond (J. Math. Anal. Appl. 136:29–38, 1988) introduced the concept of preinvex function. The preinvex functions have some interesting properties. For example, every local minimum of a preinvex function is a global minimum and nonnegative linear combinations of preinvex functions are preinvex. Invex functions were introduced by Hanson (J. Math. Anal. Appl. 80:545–550, 1981) as a generalization of differentiable convex functions. These functions are more general than the convex and pseudo convex ones. The type of invex function is equivalent to the type of function whose stationary points are global minima. Under some conditions, an invex function is also a preinvex function. Syau (Fuzzy Sets Syst. 115:455–461, 2000) introduced the concepts of pseudoconvexity, invexity, and pseudoinvexity for fuzzy mappings of one variable by using the notion of differentiability and the results proposed by Goestschel and Voxman (Fuzzy Sets Syst. 18:31–43, 1986). Wu and Xu (Fuzzy Sets Syst 159:2090–2103, 2008) introduced the concepts of fuzzy pseudoconvex, fuzzy invex, fuzzy pseudoinvex, and fuzzy preinvex mapping from \(\mathbb{R}^{n}\) to the set of fuzzy numbers based on the concept of differentiability of fuzzy mapping defined by Wang and Wu (Fuzzy Sets Syst. 138:559–591, 2003). In this paper, we present some characterizations of preinvex fuzzy mappings. The necessary and sufficient conditions for differentiable and twice differentiable preinvex fuzzy mapping are provided. These characterizations correct and improve previous results given by other authors. This fact is shown with examples. Moreover, we introduce additional conditions under which these results are valid.     

On a conjecture about MRA Riesz wavelet bases

Let be a compactly supported refinable function in such that the shifts of are stable and for a -periodic trigonometric polynomial . A wavelet function can be derived from by . If is an orthogonal refinable function, then it is well known that generates an orthonormal wavelet basis in . Recently, it has been shown in the literature that if is a -spline or pseudo-spline refinable function, then always generates a Riesz wavelet basis in . It was an open problem whether can always generate a Riesz wavelet basis in for any compactly supported refinable function in with stable shifts. In this paper, we settle this problem by proving that for a family of arbitrarily smooth refinable functions with stable shifts, the derived wavelet function does not generate a Riesz wavelet basis in . Our proof is based on some necessary and sufficient conditions on the -periodic functions and in such that the wavelet function , defined by , generates a Riesz wavelet basis in .

     

On subsymmetric bases in Fréchet spaces

It is proved that any non-normable Fréchet space with a semi-symmetric absolute basis is isomorphic to the space of all scalar sequences. A similar result is shown for quasi-homogeneous absolute bases. It is also proved that any nuclear Fréchet space with a semi-subsymmetric basis is isomorphic to .

     

关于完全强仿紧空间的刻画

在正则T1的条件下得到了完全强仿紧空间的一些等价刻画,并且利用获得的刻画证明了这类空间的一个可数乘积定理.     

On convergence of greedy algorithm by Walsh system in the space <Emphasis Type="Italic">C</Emphasis>(0, 1)

The paper studies convergence of the greedy algorithm by the Walsh system in the space C(0, 1). Some sufficient conditions for uniform convergence are given. It is proved that there exists a function satisfying more restrictive conditions, for which the sequence of the partial sums of the Fourier-Walsh series diverges at the point 0.     

Minimal expansions in redundant number systems: Fibonacci bases and Greedy algorithms

We study digit expansions with arbitrary integer digits in base q (q integer) and the Fibonacci base such that the sum of the absolute values of the digits is minimal. For the Fibonacci case, we describe a unique minimal expansion and give a greedy algorithm to compute it. Additionally, transducers to calculate minimal expansions from other expansions are given. For the case of even integer bases q, similar results are given which complement those given in [6].     

On some generalizations of Lorentz's almost convergence

We investigate an extension of the almost convergence of G.G. Lorentz, further weakening the notion of M-almost convergence we defined in [S. Mercourakis, G. Vassiliadis, An extension of Lorentz's almost convergence and applications in Banach spaces, Serdica Math. J. 32 (2006) 71–98] and requiring that the means of a bounded sequence restricted on a subset M of converge weakly in ℓ^∞(M). The case when M has density 1 is of special interest and in this case we derive a result in the direction of the Mean Ergodic Theorem (see Theorem 2).     

G-frames and g-Riesz bases

G-frames are generalized frames which include ordinary frames, bounded invertible linear operators, as well as many recent generalizations of frames, e.g., bounded quasi-projectors and frames of subspaces. G-frames are natural generalizations of frames and provide more choices on analyzing functions from frame expansion coefficients. We give characterizations of g-frames and prove that g-frames share many useful properties with frames. We also give a generalized version of Riesz bases and orthonormal bases. As an application, we get atomic resolutions for bounded linear operators.     

On the equivalence of brushlet and wavelet bases

We prove that the Meyer wavelet basis and a class of brushlet systems associated with exponential type partitions of the frequency axis form a family of equivalent (unconditional) bases for the Besov and Triebel-Lizorkin function spaces. This equivalence is then used to obtain new results on nonlinear approximation with brushlets in Triebel-Lizorkin spaces.     

On Lebesgue-type inequalities for greedy approximation

We study the efficiency of greedy algorithms with regard to redundant dictionaries in Hilbert spaces. We obtain upper estimates for the errors of the Pure Greedy Algorithm and the Orthogonal Greedy Algorithm in terms of the best m-term approximations. We call such estimates the Lebesgue-type inequalities. We prove the Lebesgue-type inequalities for dictionaries with special structure. We assume that the dictionary has a property of mutual incoherence (the coherence parameter of the dictionary is small). We develop a new technique that, in particular, allowed us to get rid of an extra factor m^1/2 in the Lebesgue-type inequality for the Orthogonal Greedy Algorithm.