In an article [2] in a volume of papers dedicated to the memory of Edmund Landau, Heilbronn investigates the following problem on continued fractions, posed by Dr. J. Gillis:

Let a and N be natural numbers such that 1 ≤ a < N and (a, N) = 1. Then there exist unique natural numbers ci such that

J. E. Jayne and C. A. Rogers in [7] introduced the following notion.

Let X be a topological space and p be a metric defined on X × X. X is said to be fragmented by the metric p if, for every ε > 0 and each nonempty subset Y of X there is a nonempty relatively open subset U of Y such that ρ-diam (U)≤ ε.

It is shown that the equations governing the motion of a set of circular vortex rings, separated by distances large compared with their dimensions, can be written in canonical form.

Let X be a completely regular Hausdorff topological space and let C(X) (the set of all real-valued bounded and continuous in X functions) be endowed with the sup-norm. Let ßX, as usual, denotes the Stone-Čech compactification of X. We give a characterization of those X for which the set

contains a dense -subset of C(X). These are just the spaces X which contain a dense Čech complete subspace. We call such spaces almost Čech complete. We also prove that X contains a dense completely metrizable subspace, if, and only if, C(X) contains a dense -subset of functions which determine Tykhonov well-posed optimization problems over X. For a compact Hausdorff topological space X the latter result was proved by Čoban and Kenderov [CK1.CK2]. Relations between the well-posedness and Gâteaux and Fréchet differentiability of convex functionals in C(X) are investigated. In particular it is shown that the sup-norm in C(X) is Frechet differentiable at the points of a dense -subset of C(X), if, and only if, the set of isolated points of X is dense in X. Conditions and examples are given when the set of points of Gateaux differentiability of the sup-norm in C(X) is a dense and Baire subspace of C(X) but does not contain a dense -subset of C(X).

In a paper [1] published in 1956, David Gale introduced the idea of representing a convex polytope by a diagram (now called a Gale diagram). Later work by Gale, T. S. Motzkin, and more recently by M. A. Perles and B. Grünbaum, has shown the importance of this idea. Using it, a large number of results which were formerly inaccessible have been proved. For an account of Gale diagrams and their applications, the reader is referred to Grünbaum's recent book [2; §5.4 and §6.3] and we shall largely follow the notations used there.

We show that the number of combinatorially distinct labelled d-polytopes on n vertices is at most , as n/d → ∞. A similar bound for the number of simplicial polytopes has previously been proved by Goodman and Pollack. This bound improves considerably the previous known bounds. We also obtain sharp upper and lower bounds for the numbers of real oriented and unoriented matroids with n elements of rank d. Our main tool is a theorem of Milnor and Thorn from real algebraic geometry.

A transversely isotropic elastic material can transmit three body waves in each direction, a quasi-longitudinal (QL) wave, a quasi-transverse (QT) wave, and a purely transverse wave. When the material is able to conduct heat the properties of small amplitude QL and QT waves are modified and we consider here the analysis of such thermo-elastic interactions in plane harmonic disturbances. The modified QL and QT waves are both found to exhibit frequency-dependent dispersion and damping of the kind known to affect dilatational waves in isotropic heat-conducting elastic materials, and in addition we show that the particle paths in the associated motions are ellipses with their axes inclined to the wave normal. This latter effect is peculiar to body waves travelling in anisotropic heat-conducting elastic materials and seems not to have been studied in detail hitherto. Numerical results referring to the propagation of plane harmonic body waves in a single crystal of zinc are presented and discussed.

For each natural number m, let N(m) denote the number of integers n with ø(n) = m, where ø denotes Euler's function. There are many interesting problems connected with the function N(m), such as the conjecture of Carmichael that N(m) is never 1 (see [9], for example) and the study of the distribution of the m for which N(m) > 0 (see Erdős and Hall [5]). In this note we shall be concerned with the maximal order of N(m).

The stability of a non-rotating column of liquid was discussed by Rayleigh [1] who showed that axisymmetric disturbances of wave-lengths greater than the circumference of the column decreased the surface area and the consequent release of surface energy enabled the disturbance to grow. Rayleigh [2] also considered the effect of viscosity on the same problem and found that for high viscosity the range of stability was unaltered. For disturbances which are the same in all planes perpendicular to the axis of the column, it is clear that any disturbance increases the length of the boundary of a plane section of the column and hence increases the surface energy. Thus the column is stable for these disturbances.

Trees are basic in graph theory and its applications to many fields, such as chemistry, electric network theory, and the theory of games. König [7; 47-48] gives an interesting historical account of independent discoveries of trees by Kirchhoff, Cayley, Sylvester, Jordan, and others who were working in a variety of fields.

There are many equivalent ways of defining trees, the most common being: A tree is a graph which is connected and has no circuits. Figure 1 shows the trees with up to six vertices; those with up to 10 vertices can be found in Harary [5; 233–234]. Some other possible definitions of a tree are the following: (1) A tree is a graph which is connected and has one more vertex than edge. (2) A tree is a graph which has no circuits and has one more vertex than edge. For these and other characterizations see Berge [4; 152ff.] and Harary [5; 32ff.]. A less common definition is by induction: The graph consisting of a single vertex is a tree, and a tree with n + 1 vertices is obtained from a tree with n vertices by adding a new vertex adjacent to exactly one other vertex.

Let

It is proved that for suitable a and b, n≥7, one can have Vn(An) = Vn(Bn) and for every (n–1)-dimensional subspace H of ℝn, where Bn is the unit ball of ℝn. This strengthens previous negative results on a problem of H. Busemann and C. M. Petty.

In [4] we have given a simple method of estimating trigonometrical sums over prime numbers. Here we show how the argument can be adapted in order to give estimates for the distribution of αp modulo 1 which are sharper than those obtained by I. M. Vinogradov [5], [6]. Vinogradov uses the sieve of Eratosthenes to relate the sum

to the bilinear form

the function μ being the Mobius function. When d1 … ds is small compared with N this can be treated in a fairly straightforward manner. However, in order to treat the terms with d1 …ds close to N, Vinogradov has to introduce an argument of a rather recondite combinatorial nature.

Let K ⊂ Rd be a convex body and choose points xl, x2, …, xn randomly, independently, and uniformly from K. Then Kn = conv {x1, …, xn} is a random polytope that approximates K (as n → ∞) with high probability. Answering a question of Rolf Schneider we determine, up to first order precision, the expectation of vol K – vol Kn when K is a smooth convex body. Moreover, this result is extended to quermassintegrals (instead of volume).

Analogues of the classical inequalities from the Brunn-Minkowski theory for rotation intertwining additive maps of convex bodies are developed. Analogues are also proved of inequalities from the dual Brunn-Minkowski theory for intertwining additive maps of star bodies. These inequalities provide generalizations of results for projection and intersection bodies. As a corollary, a new Brunn-Minkowski inequality is obtained for the volume of polar projection bodies.

Sets of the general form

where U is a subset of ℛk and is a family of subsets of U indexed by a set J, are common in the theory of Diophantine approximation [4, 7, 18, 19]. They are also closely connected with exceptional sets arising in analysis and with sets of “small divisors” in dynamical systems [1, 8, 15”. When J is the set of positive integers ℕ, the set Λ(ℱ) is of course the lim-sup of the sequence of sets Fj, j = 1, 2,… [11, p. 1]. We will also call sets of the form (1), with the more general index set J, lim-sup sets. When such lim-sup sets have Lebesgue measure zero, it is of interest to determine their Hausdorff dimension. It is usually difficult to obtain a good lower bound for the Hausdorff dimension (and it can be much harder to determine than an upper bound). In this paper we will obtain a lower bound for the dimension of lim-sup sets of the form (1) for a fairly general class of families ℕ which includes a range of results in the theory of Diophantine approximation. This lower bound depends explicitly on the geometric structure and distribution in U of the sets Fα in ℕ.

Let A and B be two compact, convex sets in ℝn, each symmetric with respect to the origin 0. L is any (n - l)-dimensional subspace. In 1956 H. Busemann and C. M. Petty (see [6]) raised the question: Does vol (A ⌒ L) < vol (B ⌒ L) for every L imply vol (A) < vol(B)? The answer in case n = 2 is affirmative in a trivial way. Also in 1953 H. Busemann (see [4]) proved that if A is any ellipsoid the answer is affirmative. In fact, as he observed in [5], the answer is still affirmative if A is an ellipsoid with 0 as center of symmetry and B is any compact set containing 0.

It has been known for many years that a laminar boundary layer adjoining a supersonic stream is in principle capable of spontaneously evolving from an unseparated to a separated form in which the boundary layer is detached from the wall and in between a slowly moving reversed flow is set up. The phenomenon arises because any thickening of the boundary layer tends to induce an adverse pressure gradient which in turn accelerates the thickening of the boundary layer and hence its evolution from the normal (Blasius) form.

It was proved in a recent paper that if α is any algebraic number, not rational, then for any ζ > 0 the inequality

has only a finite number of solutions in relatively prime integers h, q. Our main purpose in the present note is to deduce, from the results of that paper, an explicit estimate for the number of solutions.

The main result concerning the stability of an inviscid liquid column, which is at rest, is due to Rayleigh [1], who showed that, taking account of capillarity at the surface, the column will be unstable to small axisymmetric disturbances whose wavelengths in the axial direction are greater than the circumference of the cross-section. The reason for such instabilities is simply that disturbances of these wavelengths decrease the surface area of the column and hence make available excess surface energy which goes into building up the disturbance. The effects of rotation on the stability of a column having a free surface do not appear to have been studied and this note establishes some simple results concerning the effect of plane two-dimensional disturbances on a rotating column. With regard to the stability of rotating fluids in general there is another result due to Rayleigh [2] stating that the fluid will be unstable if the numerical value of the circulation decreases with the radius at any point. But this result is again for axisymmetric disturbances, and hence does not necessarily bear any relationship to the results for plane disturbances which, in the case of an incompressible liquid as is assumed here, cannot be axisymmetric. A result more closely related to this work is that of Kelvin [3] who considered the stability of a column of uniform vorticity in a fluid otherwise free of vorticity. Such a column is stable to two-dimensional and to three-dimensional disturbances.

In a recent paper Rogers [13] has discussed packings of equal spheres in n-dimensional space and has shown that the density of such a packing cannot exceed a certain ratio σn. In this paper, we discuss coverings of space with equal spheres and, by using a method which is in some respects dual to that used by Rogers, we show that the density of such a covering must always be at least