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     

Delaunay graphs are almost as good as complete graphs

LetS be any set ofN points in the plane and let DT(S) be the graph of the Delaunay triangulation ofS. For all pointsa andb ofS, letd(a, b) be the Euclidean distance froma tob and let DT(a, b) be the length of the shortest path in DT(S) froma tob. We show that there is a constantc (≤((1+√5)/2) π≈5.08) independent ofS andN such that $$\frac{{DT(a,b)}}{{d(a,b)}}< c.$$      

On the long term behavior of some finite particle systems

Summary We consider the problem of comparing large finite and infinite systems with locally interacting components, and present a general comparison scheme for the case when the infinite system is nonergodic. We show that this scheme holds for some specific models. One of these is critical branching random walk onZ ^d . Let _t denote this system, and let _t ^N denote a finite version of _t defined on the torus [–N,N] ^d Z ^d . Ford3 we prove that for stationary, shift ergodic initial measures with density , that ifT(N) andT(N)/(2N+1)^d s[0,] asN, then {v }, 0 is the set of extremal invariant measures for the infinite system _t andQ _s is the transition function of Feller's branching diffusion. We prove several extensions and refinements of this result. The other systems we consider are the voter model and the contact process.Work supported in part by the National Science Foundation under Grant DMS-8802055, by the U.S. Army Research Office through the Mathematical Sciences Institute at Cornell University and by the Deutsche Forschungsgemeinschaft through the SFB 123 at the Universität Heidelberg     

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.     

Primitive points on constant elliptic curves over function fields

Letf:CE be a non-constant rational map between curves over a finite field, whereE is elliptic. We estimate the number of rational points ofC whose image underf generate the group of rational points ofE.