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.
Let K be an algebraic number field. By a. full module in K [l,p.83] we mean a finitely-generated (necessarily free) subgroup M of the additive group of K whose rank is equal to the degree [K : ℚ] of K over the rational field ℚ. The intersection of M with ℤK, the ring of integers of K, is also a full module I, and we shall concern ourselves chiefly with the latter, in that we wish to count the number of rational integers in a given interval which can be expressed as the norms of elements of I. More precisely, we shall adapt the methods of [2] to prove the following
THEOREM 1. Let α1, …, αn be any positive algebraic numbers and let u1…, un, ν be positive integers, relatively prime in pairs, such that ν ≥ 2 and ui > v for at least one i (1 ≤ i ≤ n). Then for every ε > 0 there are only a finite number of positive integers v such that the inequality
is satisfied, where for real α we understand by ‖α‖ the distance of α from the nearest integer.
Let q be a power of an odd prime, [q] denote the Galois field GF(q) and write X(x) = xq − x. Let f(x) be a polynomial, having no linear factors, over [q], of positive degree, and write . Consider the continued fraction expansions
and
where the Ai(x) and aj,(x) are polynomials over [q] of degree ≥ 1 (if i ≥ 1, j ≥ 1). Plainly A0(x) = ao(x). Suppose that n = nf is the integer denned uniquely as the largest m such that
In this note we derive an implicit representation of the solution to the problem of plane, inviscid, irrotational flow from a symmetric nozzle of arbitrary wall shape. For the case in which the nozzle wall has a slope which is everywhere much less than unity, we are able to convert this implicit representation into an explicit one in an asymptotic sense (based upon the smallness of the wall slope). Particular attention is paid to the contraction ratio of the jet. This work is complementary to that of Lesser [2] and Larock [l].
Let K, K′ be two centrally symmetric convex bodies in En, with their centres at the origin o. Let Vr denote the r-dimensional volume function. A problem of H. Busemann and C. M. Petty [1], see also, H. Busemann [2] asks:—
“If, for each (n − 1)-dimensional subspace L of En,
does it follow that
If n = 2 or, if K is an ellipsoid, then Busemann [3] shows that it does follow. However we will show that, at least for n ≥ 12, the result does not hold for general centrally symmetric convex bodies K, even if K′ is an ellipsoid. We do not construct the counter example explicitly; instead we use a probabilistic argument to establish its existence.
Davies and Rogers [5] constructed a compact metric space Ω which is singular for a certain Hausdorff measure μh, in the sense that all subsets of Ω have μh-measure zero or infinity and μh(Ω) = ∞. (For a further study of this example see Boardman [3]). The interest lies in its extremely good descriptive character, which was lacking in the earlier examples given by Besicovitch [2] (a plane set singular for linear measure) and Choquet [4] (a plane set singular for any Hausdorff measure for which a segment has positive measure).
Motivated by questions of computational complexity, Rabin [7] introduced the notion of a complete proof of a system of inequalities. His work and the related paper of Spira [8] should interest geometers as well as computer scientists, for both papers involve convexity in an essential way. Spira's results concern the possibility of covering the intersection of a convex set C and a convex polyhedron Q with a finite collection P of polyhedra subject to certain conditions, while in Rabin's work the members of P may be more general than polyhedra. Both papers are interesting and treat important questions, but only Rabin's paper is correct in all respects. The present note contains counterexamples to some of Spira's results and establishes a correct version of one of them.
Let k be a knot of type K and with group πK. Let θ: nK → PSL(ℂ) = PSL (2, ℂ) be a parabolic representation (p-rep) as defined in [14]. We shall call the representation discrete when its image πKθ is a discrete subgroup of PSL(ℂ). It is known that PSL(ℂ) can be identified with the group of orientation preserving isometries of hyperbolic 3-space , and that each discrete subgroup of PSL(ℂ) acts discontinuously on . Hence each discrete p-rep θ has an associated orbit space . The present paper is a study of the general relations between the algebraic properties of a discrete image πKθ and the geometric properties of its orbit space.
Let G be any enumerable subset of the positive real numbers, with infinity as its only limit point. The purpose of this paper is to give a construction for a Lebesgue measurable set E ⊂ R+, with the following properties:
At high frequency, the leading terms in the virtual mass and wavemaking coefficients for a heaving, axisymmetric body depend only on the limit potential (Rhodes-Robinson, 1971). Here this result is applied to closed and open tori and solutions found in closed form. Some numerical values of the coefficients are tabulated.
Let Λ be a lattice in Cn such that the field of Abelian functions on the quotient space Cn/Λ is of transcendence degree n. This implies that is an algebraic extension of a field o of pure transcendence degree n. Thus there exists a vector A = (A1 …, An) of algebraically independent functions of the variable z = (z1, …, zn) and a function B = B(z), algebraic over
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 [21].
Association schemes were introduced by Bose and Shimamoto [13] 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, …, Γn, satisfying the conditions
(i) given p ϵ X, the number ni of q ϵ X with {p, q} ϵΓi depends only on i;
(ii) given p, q ϵ X with {p, q} ϵ Γk the number aijk of r ϵ X with {p, r} ϵ Γi, {q, r} ϵ Γj 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.
The theory of designs concerns itself with questions about subsets of a set (or relations between two sets) possessing a high degree of symmetry. By contrast, the large and amorphous area called ‘graph theory’ is mainly concerned with questions about ‘general’ relations on a set. This generality means that usually either the questions answered are too particular, or the results obtained are not powerful enough, to have useful consequences for design theory. There are some places where the two theories have interacted fruitfully; in the next five chapters, several of these areas will be considered The unifying theme is provided by a class of graphs, the ‘strongly regular graphs’, introduced by Bose [11], whose definition reflects the symmetry inherent in t-designs. First, however, we shall mention an example of the kind of situation we shall not be discussing.
A graph consists of a finite set of vertices together with a set of edges, where each edge is a subset of the vertex set of cardinality 2. (In classical terms, our graphs are undirected, without loops or multiple edges.) As with designs, there is an alternative definition: a graph consists of a finite set of vertices and a set of edges, with an ‘incidence’ relation between vertices and edges, with the properties that any edge is incident with two vertices and any two vertices with at most one edge.