Variations on the theme of repeated distances

We give an asymptotically sharp estimate for the error term of the maximum number of unit distances determined byn points in ^{d, d}4. We also give asymptotically tight upper bounds on the total number of occurrences of the favourite distances fromn points in ^{d, d}4. Related results are proved for distances determined byn disjoint compact convex sets in ².At the time this paper was written, both authors were visiting the Technion — Israel Institute of Technology.     

Monotone clones and the varieties they determine

A finite, nontrivial algebra is order-primal if its term functions are precisely the monotone functions for some order on the underlying set. We show that the prevariety generated by an order-primal algebra P is relatively congruence-distributive and that the variety generated by P is congruence-distributive if and only if it contains at most two non-ismorphic subdirectly irreducible algebras. We also prove that if the prevarieties generated by order-primal algebras P and Q are equivalent as categories, then the corresponding orders or their duals generate the same order variety. A large class of order-primal algebras is described each member of which generates a variety equivalent as a category to the variety determined by the six-element, bounded ordered set which is not a lattice. These results are proved by considering topological dualities with particular emphasis on the case where there is a monotone near-unanimity function.This research was carried out while the third author held a research fellowship at La Trobe University supported by ARGS grant B85154851. The second author was supported by a grant from the NSERC.     

Cardinal hermite interpolation with box splines II

Summary In the present work we extent the results in [RS] on CHIP, i.e. Cardinal Hermite Interpolation by the span of translates of directional derivatives of a box spline. These directional derivatives are that ones which define the type of the Hermite Interpolation. We admit here several (linearly independent) directions with multiplicities instead of one direction as in [RS]. Under the same assumptions on the smoothness of the box spline and its defining matrixT we can prove as in [RS]: CHIP has a system of fundamental solutions which are inL L ² together with its directional derivatives mentioned above. Moreover, for data sequences inl ^p ( ^d ), 1p2, there is a spline function inL ^p, 1/p+1/p=1, which solves CHIP.Research supported in part by NSERC Canada under Grant # A7687. This research was completed while this author was supported by a grant from the Deutscher Akademischer Austauschdienst     

Equiconvergence of some complex interpolatory polynomials

Summary Walsh showed the close relation between the Lagrange interpolant in then ^th roots of unity and the corresponding Taylor expansion for functions belonging to a certain class of analytic functions. Recent extensions of this phenomena to Hermite interpolation and other linear processes of interpolation have been surveyed in [3, 5]. Following a recent idea of L. Yuanren [7], we show how new relations between other linear operators can be derived which exhibit Walsh equiconvergence.Dedicated to R. S. Varga on the occasion of his sixtieth birthdayThese authors were supported by NSERC A3094     

A shape-optimization technique for the capillary surface problem

Summary The problem of the construction of an equilibrium surface taking the surface tension into account leads to Laplace-Young equation which is a nonlinear elliptic free-boundary problem. In contrast to Orr et al. where an iterative technique is used for direct solution of the equation for problems with simple geometry, we propose here an alternative approach based on shape optimization techniques. The shape of the domain of the liquid is varied to attain the optimality condition. Using optimal control theory to derive expressions for the gradient, a numerical scheme is proposed and simple model problems are solved to validate the scheme.     

Tracking poles and representing Hankel operators directly from data

Summary We propose and analyse a method of estimating the poles near the unit circleT of a functionG whose values are given at a grid of points onT: we give an algorithm for performing this estimation and prove a convergence theorem. The method is to identify the phase for an estimate by considering the peaks of the absolute value ofG onT, and then to estimate the modulus by seeking a bestL ² fit toG over a small arc by a first order rational function. These pole estimates lead to the construction of a basis ofL ² which is well suited to the numerical representation of the Hankel operator with symbolG and thereby to the numerical solution of the Nehari problem (computing the bestH , analytic, approximation toG relative to theL norm), as analysed in [HY]. We present the results of numerical tests of these algorithms.Partially supported by grants from the AFOSR and NSF     

Integrals involving Gegenbauer and Hermite polynomials on the imaginary axis

Summary The integral _- [C _2n (it)]^–2(1+t ²)^–-1/2 dt is evaluated for > –1/2 whereC _2n is the Gegenbauer polynomial of degree 2n. Letting gives the value _- [H _2n (it)]^–2 e ^{1-1/2t 2} dt involving the Hermite polynomialH _2n of degree 2n. The result is obtained using Gegenbauer functions of the second kind.     

Comparison theorems for weak splittings of bounded operators

Summary Comparison theorems for weak splittings of bounded operators are presented. These theorems extend the classical comparison theorem for regular splittings of matrices by Varga, the less known result by Wonicki, and the recent results for regular and weak regular splittings of matrices by Neumann and Plemmons, Elsner, and Lanzkron, Rose and Szyld. The hypotheses of the theorems presented here are weaker and the theorems hold for general Banach spaces and rather general cones. Hypotheses are given which provide strict inequalities for the comparisons. It is also shown that the comparison theorem by Alefeld and Volkmann applies exclusively to monotone sequences of iterates and is not equivalent to the comparison of the spectral radius of the iteration operators.This work was supported by the National Science Foundation grants DMS-8807338 and INT-8918502     

A survey of Sylvester's problem and its generalizations

Summary LetP be a finite set of three or more noncollinear points in the plane. A line which contains two or more points ofP is called aconnecting line (determined byP), and we call a connecting lineordinary if it contains precisely two points ofP. Almost a century ago, Sylvester posed the disarmingly simple question:Must every set P determine at least one ordinary line? No solution was offered at that time and the problem seemed to have been forgotten. Forty years later it was independently rediscovered by Erdös, and solved by Gallai. In 1943 Erdös proposed the problem in the American Mathematical Monthly, still unaware that it had been asked fifty years earlier, and the following year Gallai's solution appeared in print. Since then there has appeared a substantial literature on the problem and its generalizations.In this survey we review, in the first two sections, Sylvester's problem and its generalization to higher dimension. Then we gather results about the connecting lines, that is, the lines containing two or more of the points. Following this we look at the generalization to finite collections of sets of points. Finally, the points will be colored and the search will be for monochromatic connecting lines.