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.
Every undergraduate course in graph theory mentions basic results about finite planar graphs – Kuratowski's criterion for embeddability, Euler's Theorem, and so on. However the corresponding results for infinite graphs seem to be little known. It turns out that the concept of embeddability in the plane has many ramifications and variants in the infinite case, and one of the purposes of this exposition is to survey these. For the most part results will only be quoted and no proofs given – for these the reader is referred to the literature listed in the bibliography.
In this survey we aim to show how fruitful is the interaction between the theories of finite and of infinite planar graphs. Results from one of these fields often inspire nontrivial problems in the other, and frequently suggest analogous questions about graphs embeddable in manifolds of arbitrary genus.
Although it may seem foreign to the subject, especially to those only interested in problems of a strictly combinatorial or topological nature, quite a large part of what we shall do will be metrical in character. There are several reasons for this. For example, in our discussion of Euler's Theorem and its variants in Section 3, the results are not true unless we impose quite strong restrictions on the kinds of graph we are considering – and we only know how to formulate these restrictions in metrical terms.
In [7[ a functor Ext is defined in terms of C*-extensions. It is a covariant functor from the homotopy category of compact, metrizable spaces to abelian groups. Further details are given in [7, 8, 9, 11]. From [7, 14] Ext extends to a Steenrod homology theory, Ext*, which may be identified with the one associated with unitary K-theory. Since Lie groups are fundamental to K-theory (see [2, p. 24]) one might expect Ext(G) to be of interest when G is a Lie group.
In 1963 Mathematika published a note [2[ in which I “proved” that the equation f(x1, …, xm) = 1 could always be solved in algebraic integers f(x1, …, xm), whenever f(x1, …, xm) was a homogeneous polynomial of degree n ≥ 1, with algebraic integers of greatest common divisor 1 as coefficients. This “proof” was so good that it had to be corrected in [3]. Since neither I nor anyone else had any use for this result, these papers dropped into the decent obscurity reserved for dead ends in mathematical research. They presumably would have remained there had not Cantor [1] recently started looking at similar results. He discovered, to his surprise and mine, that the entire article [2] had been anticipated by Skolem in a 1934 monograph ]4] which, apparently, had also languished in obscurity. The only consolation I can draw from this is the observation that, if I was unaware of Skolem's article, he was unaware of Steinitz's work [5] of 1911, which he duplicated in Theorems 5 and 6 of [4]. The moral of this story is that any working mathematician would rather prove something himself than try to find it in any but the most accessible literature.
I am grateful to Professor K. Prachar for pointing out to me that there is a mistake in the proof of Theorem 2 in my paper “On the distribution of primes in short intervals” [Mathematika, 23 (1976), 4–9]. The mistake is in the assertion on p. 6 that, if 1 ≤ μ/λ < 4, the result is trivial. The corrected version reads as follows.
Consider a slab which is made from a homogeneous and isotropic thermoelastic material and which occupies the region 0 ≤ x ≤ a, where x, y, z are the usual rectangular cartesian coordinates. Suppose that the slab undergoes a motion in which the displacement vector is parallel to the x-axis and the displacement and the temperature are functions of the coordinate x and the time t ( ≥ 0) only. Suppose too that the faces of the slab are clamped, that the face x = 0 is maintained at a constant temperature, and that heat is supplied to unit area of the face x = a at a prescribed rate h(t).
This note contains characterizations of those sigma-fields for which sigma-finiteness is a necessary condition in the Radon-Nikodym Theorem.
Our purpose is to consider those σ-fields for which σ-finiteness is a necessary condition in the Radon–Nikodym Theorem. We first prove a measure theoretic equivalence in the general case, and then use this to obtain an algebraic characterization in the case when the σ-field is the Borel field of a locally compact separable metric space. For undefined terminology we refer the reader to [1] for measure theoretic and [2] for algebraic properties.
By a measure, we mean a countably additive function from σ-field of sets or a Boolean σ-algebra into the non-negative extended real numbers. We will say that a measure μ on a σ-field of sets Σ is RN provided each μ-continuous finite measure on Σ has a Radon–Nikodym derivative in L1(μ).
Much recent attention has been given to geometric representation of elements of the stable homotopy groups of spheres, π*s A particular example concerns non-singular bilinear maps ℝm+1 × ℝn+1 → ℝm+n+1−p; on restriction and normalisation these become biskew maps Sm × Sn ℝ Sm+n-p;. Now the Hopf construction ℋ applied to any map f: Sm × Sn → Sm+n-p yields
analytic and univalent in U = {z: |z| < 1} is said to be starlike there, if f(U) is f starshaped with respect to the origin, that is, if w ε f(U) implies tw ε f(U) for 0 ≤t ≤ 1. We denote by S* the class of all such functions. The Koebe function; k(z) = z(l – z)-2, z ε U, maps U onto the complex plane minus a slit along the I negative real axis from - ¼ to ∞, and thus belongs to the class S*. Recently Leung [4] has shown that, if
Problems of classifying and enumerating types of plane patterns, tilings, and other repeating geometrical structures have interested mathematicians, crystallographers and others for many years. Recently we have formulated the general principles that seem to underlie many of the published treatments of these topics, and so have been able to put on a mathematical basis classification criteria often justified mainly on intuitive grounds. In other words, we can now decide whether or not two given patterns are of the same “type”, at one of a number of different possible levels of classification, without relying on some vaguely expressed distinction based on a “feeling” as to whether the objects in question should be regarded as of distinguishable kinds, or not.
In Section 1 below I describe two measures of the complexity of a binary relation. J The theorem says that these two measures never disagree very much. Both measures of complexity arose in connection with Saharon Shelah's notion [5] of a stable firstt order theory; Shelah showed in effect that one measure is finite, if, and only if, the other is finite too. This follows trivially from the theorem below. I confess my main aim was not to get the extra information which the theorem provides, but to eliminate Shelah's use of uncountable cardinals, which seemed strangely heavy machinery for proving a purely finitary result. Section 2 below explains the modeltheoretic setting.
The classification of conies in the real or complex projective plane under the action of the appropriate group is simple and well known. We consider here the more complicated question of classifying conies in the complex projective plane ℂℙ2 under the action of the real projective group PGL (3, ℝ).
Reid (1974) derived “first approximations” to solutions of the Orr–Sommerfeld equation, which are uniformly valid in a full neighbourhood of a critical point. This paper shows that such approximations may be calculated to higher order, and makes a first step towards placing the theory on a rigorous basis by providing error bounds for the dominant-recessive approximations. These are obtained by generalizing methods discussed by Olver (1974) for second order linear ordinary differential equations.
Many strongly regular graphs constructed from designs contain cliques with the property that every point not in the clique is adjacent to the same number of points of the clique. In the first section we give some examples and investigate various properties of such regular cliques. In particular, parameter relations and inequalities are discussed. Section two defines special 1½ designs as a certain class of designs with connection numbers 0 and Λ, generalizing partial geometries. Notable examples of special 1½-designs are transversal designs and classical polar spaces. It is shown that the point graph of a special 1½-design is strongly regular, and the blocks are regular cliques in the point graph.
As applications we reprove a result of Higman on partial geometries with isomorphic point graphs, and improve an inequality of Cameron and Drake concerning the parameters of partial Λ- geometries.
REGULAR CLIQUES
In this paper, all graphs are finite, undirected, without loops or multiple edges. A strongly regular graph (SRG) is a graph with v vertices (or points) such that
(Rl) every vertex is adjacent to k other vertices;
(R2) the number of vertices adjacent to two adjacent vertices is always ʎ;
(R3) the number of vertices adjacent to two nonadjacent vertices is always μ.
A graph is called regular, respectively edge-regular, if only (Rl), respectively (Rl) and (R2) holds. A clique C (i.e. a complete subgraph) is called regular if every point not in C is adjacent to the same number e > 0 of points in C; we call e the nexus of C. Of course, C is a maximal clique unless e equals the size of C.
THE PROBLEM: to find all translation planes A of order 81 which admit two collineations σ and τ of order 3 such that the fixed-point sets F(σ) and F(τ) are Baer subplanes (i.e. σ and τ are Baer 3-collineations) which properly overlap,
0 ≠ F(σ) ∩ F(τ) ≠ F(σ).
If A is a translation plane of characteristic p > 3, then it is known [2] that no such overlapping Baer p-collineations exist. However, the nearfield plane of order 9 does admit such collineations. The general problem then is the investigation of overlapping Baer 3-collineations in translation planes of order 32e, for e > 1.
THEOREM: There are (up to isomorphism) n planes of order 81 admitting such overlapping 3-collineations σ and τ, where 3 ≤ n ≤ 6. (Note: all examples but not necessarily all isomorphisms, are known.)
PROOF: Normalize extensively by hand; then compute all normalized cases by machine. In stage 1 of the computing, 96 × 812 cases were checked, resulting in approximately 5,000 successes. During stage 2, for each success in stage 1, approximately 100 cases were checked. Each of the approximately two dozen successes in stage 2 describes a plane of the given type, but there are many obvious isomorphisms, resulting in 3 to 6 isomorphism classes.