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

Hardy Spaces for Laguerre Expansions

Let be the standard Laguerre functions of type a. We denote . Let and be the semigroups associated with the orthonormal systems and . We say that a function f belongs to the Hardy space associated with one of the semigroups if the corresponding maximal function belongs to . We prove special atomic decompositions of the elements of the Hardy spaces.     

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.     

A Two-Dimensional Kinetic Triangulation with Near-Quadratic Topological Changes

A triangulation of a set S of points in the plane is a subdivision of the convex hull of S into triangles whose vertices are points of S. Given a set S of n points in each moving independently, we wish to maintain a triangulation of S. The triangulation needs to be updated periodically as the points in S move, so the goal is to maintain a triangulation with a small number of topological events, each being the insertion or deletion of an edge. We propose a kinetic data structure (KDS) that processes topological events with high probability if the trajectories of input points are algebraic curves of fixed degree. Each topological event can be processed in time. This is the first known KDS for maintaining a triangulation that processes a near-quadratic number of topological events, and almost matches the lower bound [1]. The number of topological events can be reduced to if only k of the points are moving.     

A Lattice of Quasivarieties of Normal Cryptogroups

A normal cryptogroup S is a completely regular semigroup in which is a congruence and is a normal band. We represent S as a strong semilattice of completely simple semigroups, and may set For each we set and represent by means of an h-quintuple These parameters are used to characterize certain quasivarieties of normal cryptogroups. Specifically, we construct the lattice of quasivarieties generated by the (quasi)varieties and This is the lattice generated by the lattice of quasivarieties of normal bands, groups and completely simple semigroups. We also determine the B-relation on the lattice of all quasivarieties of normal cryptogroups. Each quasivariety studied is characterized in several ways.     

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.     

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.     

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.     

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.     

Covering a Triangle with Positive and Negative Homothetic Copies

Let be a triangle and let be a set of homothetic copies of . We prove that implies that there are positive and negative signs and there exist translates of that cover .     

Frobenius Problem and the Covering Radius of a Lattice

Let and let be relatively prime integers. The Frobenius number of this N-tuple is defined to be the largest positive integer that cannot be expressed as are non-negative integers. The condition that implies that such a number exists. The general problem of determining the Frobenius number given N and is NP-hard, but there have been a number of different bounds on the Frobenius number produced by various authors. We use techniques from the geometry of numbers to produce a new bound, relating the Frobenius number to the covering radius of the null-lattice of this N-tuple. Our bound is particularly interesting in the case when this lattice has equal successive minima, which, as we prove, happens infinitely often.     

On Distinct Distances from a Vertex of a Convex Polygon

Given a set P of n points in convex position in the plane, we prove that there exists a point such that the number of distinct distances from p is at least The best previous bound, from 1952, is due to Moser.     

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

Autocorrelation Functions as Translation Invariants in L1 and L2

The Adler-Konheim theorem [Proc. Amer. Math. Soc. 13 (1962), 425-428] states that the collection of nth-order autocorrelation functions is a complete set of translation invariants for real-valued L¹ functions on a locally compact abelian group. It is shown here that there are proper subsets of that also form a complete set of translation invariants, and these subsets are characterized. Specifically, a subset is complete if and only if it contains infinitely many even-order autocorrelation functions. In addition, any infinite subset of is complete up to a sign. While stated here for functions on the proofs presented hold for functions on any locally compact abelian group that is not compact, in particular, on and the integer lattice      

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 .     

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.     

Perturbations of Roots under Linear Transformations of Polynomials

Let be the complex vector space of all polynomials of degree at most n. We give several characterizations of the linear operators for which there exists a constant C > 0 such that for all nonconstant there exist a root u of f and a root v of Tf with . We prove that such perturbations leave the degree unchanged and, for a suitable pairing of the roots of f and Tf, the roots are never displaced by more than a uniform constant independent on f. We show that such "good" operators T are exactly the invertible elements of the commutative algebra generated by the differentiation operator. We provide upper bounds in terms of T for the relevant constants.     

Orthogonal Algebraic Polynomial Schauder Bases of Optimal Degree

For any fixed we construct an orthonormal Schauder basis for C[-1,1] consisting of algebraic polynomials with The orthogonality is with respect to the Chebyshev weight.     

Distributional Point Values and Convergence of Fourier Series and Integrals

In this article we show that the distributional point values of a tempered distribution are characterized by their Fourier transforms in the following way: If and , and is locally integrable, then distributionally if and only if there exists k such that , for each a > 0, and similarly in the case when is a general distribution. Here means in the Cesaro sense. This result generalizes the characterization of Fourier series of distributions with a distributional point value given in [5] by . We also show that under some extra conditions, as if the sequence belongs to the space for some and the tails satisfy the estimate ,\ as , the asymmetric partial sums\ converge to . We give convergence results in other cases and we also consider the convergence of the asymmetric partial integrals. We apply these results to lacunary Fourier series of distributions.     

Asymptotics of Laurent Polynomials of Odd Degree Orthogonal with Respect to Varying Exponential Weights

Let denote the linear space over spanned by . Define the (real) inner product , where V satisfies: (i) V is real analytic on ; (ii) ; and (iii) . Orthogonalisation of the (ordered) base with respect to yields the even degree and odd degree orthonormal Laurent polynomials , and . Define the even degree and odd degree monic orthogonal Laurent polynomials: and . Asymptotics in the double-scaling limit such that of (in the entire complex plane), , and (in the entire complex plane) are obtained by formulating the odd degree monic orthogonal Laurent polynomial problem as a matrix Riemann-Hilbert problem on , and then extracting the large-n behaviour by applying the non-linear steepest-descent method introduced in [1] and further developed in [2],[3].