Iterates of expanding maps

The iterates of expanding maps of the unit interval into itself have many of the properties of a more conventional stochastic process, when the expanding map satisfies some regularity conditions and when the starting point is suitably chosen at random. In this paper, we show that the sequence of iterates can be closely tied to an m-dependent process. This enables us to prove good bounds on the accuracy of Gaussian approximations. Our main tools are coupling and Stein's method. Received: 27 June 1997 / Revised version: 21 September 1998     

On the iterative solution of the algebraic equations in fully implicit Runge-Kutta methods

This paper deals with the iterative solution of stage equations which arise when some fully implicit Runge-Kutta methods, in particular those based on Gauss, Radau and Lobatto points, are applied to stiff ordinary differential equations. The error behaviour in the iterates generated by Newton-type and, particularly, by single-Newton schemes which are proposed for the solution of stage equations is studied. We consider stiff systems y'(t) = f(t,y(t)) which are dissipative with respect to a scalar product and satisfy a condition on the relative variation of the Jacobian of f(t,y) with respect to y, similar to the condition considered by van Dorsselaer and Spijker in [7] and [17]. We prove new convergence results for the single-Newton iteration and derive estimates of the iteration error that are independent of the stiffness. Finally, some numerical experiments which confirm the theoretical results are presented. This revised version was published online in June 2006 with corrections to the Cover Date.     

The number of elliptic curves over ℚ with conductorNwith conductorN

We prove that the number of elliptic curves E/ℚ with conductorN isO(N ^1/2+ε). More generally, we prove that the number of elliptic curves E/ℚ with good reduction outsideS isO(M ^1/2+ε), whereM is the product of the primes inS. Assuming various standard conjectures, we show that this bound can be improved toO(M ^c/loglogM ). Research partially supported by NSF DMS-9424642.     

Convex nonagons with five intervertex distances

The vertices of a convex planar nonagon determine exactly five distances if and only if they are nine vertices of a regular 10-gon or a regular 11-gon. This result has important ties to related concerns, including the maximum number of points in the plane that determine exactly five distances and, for each n7, the samllest t for which there exists a convex n-gon whose vertices determine t distances and are not all on one circle.     

Crowns,cutsets, and valuable partial orders

We consider the problem of recognizing those partial orders which admit a valuation: this is a linear-algebraic condition which arises naturally in an algebraic/geometric context. We show that a partial order has at most one valuation (which is integer-valued) and present various structural conditions which are either necessary or sufficient for a partial order to be valuable. The first main result is a reduction theorem which allows us to restrict attention to those partial orders which do not have a bounded cutset. We use this and a theorem of Kelly and Rival to prove the second main result: that every contraction of a bounded partial order is fibre-valuable if and only if the partial order is a dismantlable lattice. This result has a geometric interpretation.This research was supported by the Natural Sciences and Engineering Research Council of Canada under operating grant OGP0105392.     

Asymptotic properties of nonparametric curve estimates

We consider a class of nonparametric estimators for the regression functionm(t) in the model:y _i =m(t _i ) + _i , 1 i n, t _i [0, 1], which are linear in the observationsy _i . Several limit theorems concerning local and global stochastic and a.s. convergence and limit distributions are given.     

Thirteen ways to estimate global error

Summary Various techniques that have been proposed for estimating the accumulated discretization error in the numerical solution of differential equations, particularly ordinary differential equations, are classified, described, and compared. For most of the schemes either an outline of an error analysis is given which explains why the scheme works or a weakness of the scheme is illustrated.This research is partially supported by NSF Grant No. MCS-8107046     

Flocks and ovals

An infinite family of q-clans, called the Subiaco q-clans, is constructed for q=2^e. Associated with these q-clans are flocks of quadratic cones, elation generalized quadrangles of order (q ², q), ovals of PG(2, q) and translation planes of order q ² with kernel GF(q). It is also shown that a q-clan, for q=2^e, is equivalent to a certain configuration of q+1 ovals of PG(2, q), called a herd.W. Cherowitzo gratefully acknowledges the support of the Australian Research Council and has the deepest gratitude and warmest regards for the Combinatorial Computing Research Group at the University of Western Australia for their congenial hospitality and moral support. I. Pinneri gratefully acknowledges the support of a University of Western Australia Research Scholarship.     

A strongly regularN-full graph of small order

For every positive integern we show the construction of a strongly regular graph of order at most 2 ⁿ⁺² which contains every graph of ordern as a subgraph. The estimation concerning the construction is best possible.