To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
The concept of uniform regularity of a measure on a compact space—a property which allows uniform approximation of the measure on all compact sets—was introduced and discussed in [1], [2] and [3]. Further some extensions of the notion of uniform regularity are given in [4] and [6].
Consider a homogeneous linear viscoelastic filament, one of whose ends is held fixed, while the other is subjected to a given traction τ(t) (t ≤ 0). I shall prove first that the total energy E(t), which is the sum of the kinetic and free energies, its derivative E′(t), and the rate of working W(t) satisfy
Let U0 = [(0, 1); and U1 = (0,1)]. Suppose we have a distribution of N points in , where, for k ≥ 1, is the unit cube consisting of the points y = (y1, … , yk+1) with 0 ≤ yi < 1 (i = 1 , … , k + 1). For X = (x1 ,…, xk + 1) in , let B(x) denote the box consisting of all y such that 0 ≤ yi < xi (i = 1 ,…, k + 1), and let denote the number of points of which lie in B(x).
The celebrated theorem of Bombieri and A. I. Vinogradov states that
for any ε > 0 and A ε 0, the implied constant in the symbol «ε depending at most on ε and A (see [1] and [14]). The original proofs of Bombieri and Vinogradov were greatly simplified by P. X. Gallagher [4]. An elegant proof has been given recently by R. C. Vaughan [13]. For other references see H. L. Montgomery [10] and H. -E. Richert [12]. Estimates of type (1) are required in various applications of sieve methods. Having this in mind distinct generalizations have been investigated (see for example [15] and [2]). Y. Motohashi established a general theorem which, roughly speaking, says that if (1) holds for two arithmetic functions then it also holds for their Dirichlet convolution; for precise assumptions and statement see [11]. So far, all methods depend on the large sieve inequality (see [10])
which sets the limit x1/2 for the modulus q in (1) and in its generalizations.
In an earlier paper [11] we have discussed the diophantine equation
and the more general equation
when l is an odd prime > 3, c a natural number (or more generally a rational number) satisfying several conditions, n also a natural number and x, y, z, non-zero rational integers. Other investigators have obtained quite a number of results concerning particularly the case n = 1. Obviously, without an essential restriction, we may assume that the natural number c contains no divisor a1n (since such a divisor can be absorbed in the power of z) and furthermore that x, y, z in (1) are relatively prime in pairs.
The quasigeostrophic equations describe large scale motion in the atmosphere and oceans at middle latitudes. Being considerably simpler than the primitive equations, they have been widely used for modelling atmospheric and oceanic circulation, and for studies of stability, frontogenesis and turbulence. A number of assertions have been made about these equations; first, that finite element approximate solutions converge in an open flow region [7]; secondly, that solutions depend discontinuously or nondeterministically on initial data [13]; and thirdly, that the energy wave number spectra of the solutions asymptote to the statistical equilibrium spectra of the spectrally truncated equations [12].
Problems about partitions of cartesian products are common in mathematics. For example, in finite and infinite combinatorics, they keep emerging in Ramsay theory, where one seeks to show that, if a product is partitioned into finitely many parts, one part at least must contain a subset of a certain specified kind. In the transition from finite to infinite products, one usually imposes restrictions of a topological nature on the partition, in order to obtain theorems analogous to those which are valid in the finite case. (See, e.g., [G-P], [Si], [E].)
In recent work [2] we have investigated Borel isomorphisms at the first level, i.e. mappings that together with their inverses map Fσ-sets to Fσ-sets. We are grateful to Dr. F. Topsøe for writing to point out errors in the proofs of our Theorems 2.1, 2.2 and 2.3. The errors escaped our attention because we only wrote out the first step of a complicated inductive argument and carelessly and falsely claimed that the general step of the induction was similar to the first. To be more specific, in the proof of Theorem 2.1, although we do have
Let FN be the set of real numbers x whose continued fraction expansion x = [a0; a1, a2,…, an,…] contains only elements ai = 1,2,…, N. Here N ≥ 2. Considerable effort, [1,3], has centred on metrical properties of FN and certain measures carried by FN. A classification of sets of measure zero, as venerable as the dimensional theory, depends on Fourier-Stieltjes transforms: a closed set E of real numbers is called an M0-set, if E carries a probability measure λ whose transform vanishes at infinity. Aside from the Riemann-Lebesgue Lemma, no purely metrical property of E can ensure that E is an M0-set. For the sets FN, however, metrical properties can be used to construct the measure λ.
This paper concerns conditions under which the classifying space functor transforms a fibre square of topological monoids into a fibre square of spaces. Before stating our results precisely, we first develop some relevant points concerning the continuity of functors.
A positive integer n is called a square-full integer, if p2 divides n, whenever p is a prime divisor of n. It is clear that each square-full integer can be written in the form a2b3, where a and b are positive integers; moreover, this representation is unique if we stipulate that b is square-free.
The result of my paper with the title given above (Mathematika, 26 (1979), 72–75) is not new; it was proved by Delone, see [2] and [3]. I have not been able to refer to either of these papers, but the result is given in [1], A similar problem was considered by Kitaoka in [5]. Professor Kneser of Göttingen tells me that he solved the problem about ten years ago in an unpublished manuscript; also that Schering's result [4] is less general and weaker than mine. I am obliged to Professor Peters of Münster for a copy of [1], giving the references [2] to [4], and also for the reference [5].
After a short account of the theory of association schemes, this final chapter contains an outline of part of the thesis of P. Delsarte, in which many of the concepts of classical coding theory and design theory are generalised to classes of association schemes. For proofs, we refer the reader to [39].
Association schemes were introduced by Bose and Shimamoto [18] as a generalisation of strongly regular graphs. An association scheme consists of a set X together with a partition of the set of 2-element subsets of X into n classes Γ1,…, Γnsatisfying the conditions
(i)given p ε X, the number ni. of q ε X with {p, q}εΓ1 depends only on i;
(ii) given p, q ε X with {p, q } ε εΓk, the number of rε X with {p, r} εΓi εΓi {q, r } εΓi depends only on i, j, and k. It is convenient to take a set of n ‘colours’ c1, …, cn, and colour an edge of the complete graph on X with colour ci if it belongs to Γi; so Γi. is the ci.-coloured subgraph. The first condition asserts that each graph Γi. is regular; the second, that the number of triangles with given colouring on a given base depends only on the colouring and not on the base. A complementary pair of strongly regular graphs forms an association scheme with two classes, and conversely.