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.     

Density of the Set of Generators of Wavelet Systems

Given a function ψ in the affine (wavelet) system generated by ψ, associated to an invertible matrix a and a lattice Γ, is the collection of functions In this paper we prove that the set of functions generating affine systems that are a Riesz basis of ${\cal L}^2({\Bbb R}^d)$ is dense in We also prove that a stronger result is true for affine systems that are a frame of In this case we show that the generators associated to a fixed but arbitrary dilation are a dense set. Furthermore, we analyze the orthogonal case in which we prove that the set of generators of orthogonal (not necessarily complete) affine systems, that are compactly supported in frequency, are dense in the unit sphere of with the induced metric. As a byproduct we introduce the p-Grammian of a function and prove a convergence result of this Grammian as a function of the lattice. This result gives insight in the problem of oversampling of affine systems.     

Local Growth Envelopes of Triebel-Lizorkin Spaces of Generalized Smoothness

The concept of local growth envelope of the quasi-normed function space is applied to the Triebel-Lizorkin spaces of generalized smoothness In order to achieve this, a standardization result for these and corresponding Besov spaces is derived.     

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.     

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.     

Nonlinear Approximation by Trigonometric Sums

We investigate the -error of approximation to a function by a linear combination of exponentials on where the frequencies are allowed to depend on We bound this error in terms of the smoothness and other properties of and show that our bounds are best possible in the sense of approximation of certain classes of functions.     

Approximation and Spanning in the Hardy Space,by Affine Systems

We show that every function in the Hardy space can be approximated by linear combinations of translates and dilates of a synthesizer , provided only that and satisfies a mild regularity condition. Explicitly, we prove scale averaged approximation for each ,

Hypoelliptic Dunkl Convolution Equations in the Space of Distributions on {\Bbb R}^d

In this article we define and study the Dunkl convolution product and the Dunkl transform on spaces of distributions on By using the main results obtained, we study the hypoelliptic Dunkl convolution equations in the space of distributions.     

Homogenization of Non-Linear Variational Problems with Thin Low-Conducting Layers

This paper deals with the homogenization of a sequence of non-linear conductivity energies in a bounded open set The energy density is of the same order as where is periodic, u is a vector-valued function in and The conductivity is equal to 1 in the "hard" phases composed by two by two disjoint-closure periodic sets while tends uniformly to 0 in the "soft" phases composed by periodic thin layers which separate the hard phases. We prove that the limit energy, according to γ-convergence, is a multi-phase functional equal to the sum of the homogenized energies (of order 1) induced by the hard phases plus an interaction energy (of order 0) due to the soft phases. The number of limit phases is less than or equal to N and is obtained by evaluating the γ-limit of the rescaled energy of density in the torus. Therefore, the homogenization result is achieved by a double γ-convergence procedure since the cell problem depends on ε.     

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.     

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.     

Divergence of Spherical General Terms of Double Fourier Series

We prove the following theorem: For arbitrary there exists a nonnegative function such that and

Old and New Morrey Spaces with Heat Kernel Bounds

Given p ∈ [1,∞) and λ ∈ (0, n), we study Morrey space of all locally integrable complex-valued functions f on such that for every open Euclidean ball B ⊂ with radius r_B there are numbers C = C(f ) (depending on f ) and c = c(f,B) (relying upon f and B) satisfying

Convolution Products in Naturally Ordered Semigroups

In this paper new equalities between two different convolution products in cancellative naturally ordered semigroups (but not in groups) are given. We also give several applications in particular cases and      

Isometry-Invariant Valuations on Hyperbolic Space

Hyperbolic area is characterized as the unique continuous isometry-invariant simple valuation on convex polygons in We then show that continuous isometry-invariant simple valuations on polytopes in for are determined uniquely by their values at ideal simplices. The proofs exploit a connection between valuation theory in hyperbolic space and an analogous theory on the Euclidean sphere. These results lead to characterizations of continuous isometry-invariant valuations on convex polytopes and convex bodies in the hyperbolic plane a partial characterization in and a mechanism for deriving many fundamental theorems of hyperbolic integral geometry, including kinematic formulas, containment theorems, and isoperimetric and Bonnesen-type inequalities.     

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.     

On the Least Median Square Problem

We consider the exact and approximate computational complexity of the multivariate least median-of-squares (LMS) linear regression estimator. The LMS estimator is among the most widely used robust linear statistical estimators. Given a set of n points in and a parameter k, the problem is equivalent to computing the narrowest slab bounded by two parallel hyperplanes that contains k of the points. We present algorithms for the exact and approximate versions of the multivariate LMS problem. We also provide nearly matching lower bounds for these problems. These lower bounds hold under the assumptions that k is Ω(n) and that deciding whether n given points in are affinely non-degenerate requires Ω(n^d) time.     

Regular Semigroups with Inverse Transversals

Let C be a semiband with an inverse transversal . In [7], G.T. Song and F.L. Zhu construct a fundamental regular semigroup with an inverse transversal . is isomorphic to a subsemigroup of the Hall semigroup of C but it is easier to handle. Its elements are partial transformations, and the operation-although not the usual composition-is defined by means of composition. Any full regular subsemigroup T of is a fundamental regular semigroup with inverse transversal . Moreover, any regular semigroup S with an inverse transversal is proved to be an idempotent-separating coextension of a full regular subsemigroup T of some . By means of a full regular subsemigroup T of some and by means of an inverse semigroup K satisfying some conditions, in this paper, we construct a regular semigroup with inverse transversal such that is isomorphic to K and to T. Furthermore, it is proved that if S is a regular semigroup with an inverse transversal then S can be constructed from the corresponding T and from in this way.     

On the Reproducing Formula of Calderon

Let and Under certain conditions on we shall prove that converges nontangentially to at for