Duality and Biorthogonality for Weyl-Heisenberg Frames

Let and let In this paper we investigate the relation between the frame operator and the matrix whose entries are given by for Here , for any We show that is bounded as a mapping of into if and only if is bounded as a mapping of into Also we show that if and only if where denotes the identity operator of and respectively, and Next, when generates a frame, we have that has an upper frame bound, and the minimal dual function can be computed as The results of this paper extend, generalize, and rigourize results of Wexler and Raz and of Qian, D. Chen, K. Chen, and Li on the computation of dual functions for finite, discrete-time Gabor expansions to the infinite, continuous-time case. Furthermore, we present a framework in which one can show that certain smoothness and decay properties of a generating a frame are inherited by In particular, we show that when generates a frame Schwartz space). The proofs of the main results of this paper rely heavily on a technique introduced by Tolimieri and Orr for relating frame bound questions on complementary lattices by means of the Poisson summation formula.     

Interassociates of the Free Commutative Semigroup on n Generators

The interassociates of the free commutative semigroup on n generators, for n > 1, are identified. For fixed n, let (S, ·) denote this semigroup. We show that every interassociate can be written in the form , depending only on a n-tuple . Next, if and are isomorphic interassociates of (S, ·) such that , for x_ii and x_j in the generating set of S, then . Moreover, if and only if is a permutation of .     

Spherical Perturbations of Schrödinger Equations

We give conditions on radial nonnegative weights $W_1We give conditions on radial nonnegative weights and on , for which the a priori inequality holds with constant independent of . Here is the Laplace-Beltrami operator on the sphere . Due to the relation between and the tangential component of the gradient, , we obtain some "Morawetz-type" estimates for on . As a consequence we establish some new estimates for the free Schr?dinger propagator , which may be viewed as certain refinements of the -(super)smoothness estimates of Kato and Yajima. These results, in turn, lead to the well-posedness of the initial value problem for certain time dependent first order spherical perturbations of the dimensional Schr?dinger equation.     

Approximation of Modulus Semigroups and their Generators

The central result of this paper is a sandwiching theorem for semigroups acting on Banach lattices with order continuous norm. As a preparation we show that the norm of a Banach lattice is order continuous if and only if every order bounded weak null sequence in is a norm null sequence. From the sandwiching result we deduce approximation formulas for the modulus semigroup and its generator. For example, if generates a dominated -semigroup we show that converges to the modulus semigroup of as , and converges (in the strong resolvent sense) to the generator of the modulus semigroup of as .     

Line Transversals to Translates of Unit Discs

Let be a family of convex figures in the plane. We say that has property T if there exists a line intersecting every member of . Also, the family has property T(k) if every k-membered subfamily of has property T. Let B be the unit disc centered at the origin. In this paper we prove that if a finite family of translates of B has property T(4) then the family , where , has property T. We also give some results concerning families of translates of the unit disc which has either property T(3) or property T(5).     

Invariance Theorems in Approximation Theory and their Applications

Let B be a closed linear subspace of a Banach space F and let be a group of continuous linear operators , where G is a compact topological group. We prove that if is invariant under , then under some conditions on f, F, B, and G, there exists an element of best approximation to f that has the same property. As applications, we compute the bivariate Bernstein constant for polynomial approximation of and solve a Braess problem on the exponential order of decay of the error of polynomial approximation of . Other examples and applications are discussed as well.     

Row Space Cardinalities

Let be the set of all Boolean matrices. Let R(A) denote the row space of , let , and let . By extensive computation we found that

Density, Overcompleteness, and Localization of Frames. I. Theory

Frames have applications in numerous fields of mathematics and engineering. The fundamental property of frames which makes them so useful is their overcompleteness. In most applications, it is this overcompleteness that is exploited to yield a decomposition that is more stable, more robust, or more compact than is possible using nonredundant systems. This work presents a quantitative framework for describing the overcompleteness of frames. It introduces notions of localization and approximation between two frames and ( a discrete abelian group), relating the decay of the expansion of the elements of in terms of the elements of via a map . A fundamental set of equalities are shown between three seemingly unrelated quantities: The relative measure of , the relative measure of — both of which are determined by certain averages of inner products of frame elements with their corresponding dual frame elements — and the density of the set in . Fundamental new results are obtained on the excess and overcompleteness of frames, on the relationship between frame bounds and density, and on the structure of the dual frame of a localized frame. In a subsequent article, these results are applied to the case of Gabor frames, producing an array of new results as well as clarifying the meaning of existing results. The notion of localization and related approximation properties introduced in this article are a spectrum of ideas that quantify the degree to which elements of one frame can be approximated by elements of another frame. A comprehensive examination of the interrelations among these localization and approximation concepts is presented.     

Smaller Coresets for k-Median and k-Means Clustering

In this paper we show that there exists a -coreset for k-median and k-means clustering of n points in which is of size independent of n. In particular, we construct a -coreset of size for k-median clustering, and of size for k-means clustering.     

Generating Self-Map Monoids of Infinite Sets

Let be a countably infinite set, the group of permutations of , and the monoid of self-maps of . Given two subgroups , let us write if there exists a finite subset such that the groups generated by and are equal. Bergman and Shelah showed that the subgroups which are closed in the function topology on S fall into exactly four equivalence classes with respect to . Letting denote the obvious analog of for submonoids of E, we prove an analogous result for a certain class of submonoids of E, from which the theorem for groups can be recovered. Along the way, we show that given two subgroups which are closed in the function topology on S, we have if and only if (as submonoids of E), and that for every subgroup (where denotes the closure of G in the function topology in S and its closure in the function topology in E).     

Fourier Inequalities and Moment Subspaces in Weighted Lebesgue Spaces

For define where Pointwise estimates and weighted inequalities describing the local Lipschitz continuity of are established. Sufficient conditions are found for the boundedness of from into and a spherical restriction property is proved. A study of the moment subspaces of is next developed in the one-variable case, for locally integrable, a.e. It includes a decomposition theorem and a complete classification of all possible sequences of moment subspaces in Characterizations are also given for each class. Applications related to the approximation and decomposition of are discussed.     

Ideals of Ultrafilters on the Collection of Finite Subsets of an Infinite Set

Let J be an infinite set and let , i.e., I is the collection of all non empty finite subsets of J. Let denote the collection of all ultrafilters on the set I and let be the compact (Hausdorff) right topological semigroup that is the Stone-Cech Compactification of the semigroup equipped with the discrete topology. This paper continues the study of that was started in [3] and [5]. In [5], Koppelberg established that (where K( S) is the smallest ideal of a semigroup S) and for non empty she established . In this note, we show that for such that is infinite, is a proper subset of and , where .     

The Cayley Transform of the Generator of a Bounded C<Subscript>0</Subscript>-Semigroup

Let A be the generator of a uniformly bounded C₀-semigroup on the Banach space X. We present sufficient conditions on the resolvent , under which the Cayley transform is a power-bounded operator, i.e., .     

Numerical Integration over Spheres of Arbitrary Dimension

In this paper we study the worst-case error (of numerical integration) on the unit sphere for all functions in the unit ball of the Sobolev space where More precisely, we consider infinite sequences of m(n)-point numerical integration rules where: (i) is exact for all spherical polynomials of degree and (ii) has positive weights or, alternatively to (ii), the sequence satisfies a certain local regularity property. Then we show that the worst-case error (of numerical integration) in has the upper bound where the constant c depends on s and d (and possibly the sequence This extends the recent results for the sphere by K. Hesse and I.H. Sloan to spheres of arbitrary dimension by using an alternative representation of the worst-case error. If the sequence of numerical integration rules satisfies an order-optimal rate of convergence is achieved.     

The Entropy in Learning Theory. Error Estimates

We continue the investigation of some problems in learning theory in the setting formulated by F. Cucker and S. Smale. The goal is to find an estimator on the base of given data that approximates well the regression function of an unknown Borel probability measure defined on We assume that belongs to a function class It is known from previous works that the behavior of the entropy numbers of in the uniform norm plays an important role in the above problem. The standard way of measuring the error between a target function and an estimator is to use the norm ( is the marginal probability measure on X generated by ). This method has been used in previous papers. We continue to use this method in this paper. The use of the norm in measuring the error has motivated us to study the case when we make an assumption on the entropy numbers of in the norm. This is the main new ingredient of thispaper. We construct good estimators in different settings: (1) we know both and ; (2) we know but we do not know and (3) we only know that is from a known collection of classes but we do not know An estimator from the third setting is called a universal estimator.     

Improved Approximation Algorithms for Geometric Set Cover

Given a collection S of subsets of some set and the set cover problem is to find the smallest subcollection that covers that is, where denotes We assume of course that S covers While the general problem is NP-hard to solve, even approximately, here we consider some geometric special cases, where usually Combining previously known techniques [4], [5], we show that polynomial-time approximation algorithms with provable performance exist, under a certain general condition: that for a random subset and nondecreasing function f(·), there is a decomposition of the complement into an expected at most f(|R|) regions, each region of a particular simple form. Under this condition, a cover of size O(f(|C|)) can be found in polynomial time. Using this result, and combinatorial geometry results implying bounding functions f(c) that are nearly linear, we obtain o(log c) approximation algorithms for covering by fat triangles, by pseudo-disks, by a family of fat objects, and others. Similarly, constant-factor approximations follow for similar-sized fat triangles and fat objects, and for fat wedges. With more work, we obtain constant-factor approximation algorithms for covering by unit cubes in and for guarding an x-monotone polygonal chain.     

Coefficients of Orthogonal Polynomials on the Unit Circle and Higher-Order Szego Theorems

Let be a nontrivial probability measure on the unit circle the density of its absolutely continuous part, its Verblunsky coefficients, and its monic orthogonal polynomials. In this paper we compute the coefficients of in terms of the . If the function is in , we do the same for its Fourier coefficients. As an application we prove that if and if is a polynomial, then with and S the left-shift operator on sequences we have

Kernel and Trace Operators for Extensions of Brandt Semigroups

Let S be an (ideal) extension of a Brandt semigroup S₀ by a Brandt semigroup S₁ and let denote the congruence lattice of S. For denote by and the least and the greatest congruences on S with the same kernel as respectively, and let and have the analogous meaning relative to trace. We establish necessary and sufficient conditions on S in order that one or more of the operators

Hardy Spaces on the Plane and Double Fourier Transforms

We provide a direct computational proof of the known inclusion where is the product Hardy space defined for example by R. Fefferman and is the classical Hardy space used, for example, by E.M. Stein. We introduce a third space of Hardy type and analyze the interrelations among these spaces. We give simple sufficient conditions for a given function of two variables to be the double Fourier transform of a function in and respectively. In particular, we obtain a broad class of multipliers on and respectively. We also present analogous sufficient conditions in the case of double trigonometric series and, as a by-product, obtain new multipliers on and respectively.