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.
As we have already explained in Section 1.4, a planar graph is a graph which can be drawn in the plane so that the edges have no intersections except at the vertices. We also gave a number of illustrations of planar graphs. In Section 1.5, we analyzed the problem of the three houses and the three wells, and explained why the corresponding graph could not be planar. The graph of the problem (Figure 1.16) can be drawn in many ways, as is possible for all graphs. When we say “the graph,” we mean any graph isomorphic to a particular graph describing the situation. Therefore, the statement “the graph in Figure 1.16 is not planar” means it has no planar isomorph. For instance, the vertices may be placed in a hexagon as in Figure 8.1. The intersection in the center is not a vertex; the edges should be considered to pass over each other at this point.
There is even a graph with only 5 vertices which is not planar—namely, the complete graph on 5 vertices (Figure 8.2). Why this graph is not planar may be made clear by reasoning similar to that used in Section 1.5 to show that the graph in Figure 8.1 (or Figure 1.16) is not planar. The vertices in any representation of the graph must lie on a cycle C in some order—say, abcdea. There is an edge eb, and in our planar graph we have the choice of putting it on the inside or the outside of C.
If a scattered compact space K is such that its ω1-th derived set K(ω1) is empty then the Banach space ℒ(K) admits an equivalent locally uniformly convex norm.
In this paper some new Opial-type integrodifferential inequalities in one variable are established. These generalize the existing ones which have a wide range of applications in the study of differential and integral equations.
For each odd prime p there is a finite regular abstract 4-dimensional polytope of type {3, 3, p}. Its cells are simplices, and its vertex figures belong to an infinite family of regular polyhedra. We also give a geometric realization for these polytopes.
We determine what is the maximum possible (by volume) portion of the three-dimensional Euclidean space that can be occupied by a family of non-overlapping congruent circular cylinders of infinite length in both directions. We show that the ratio of that portion to the whole of the space cannot exceed π/√12 and it attains π/√12 when all cylinders are parallel to each other and each of them touches six others. In the terminology of the theory of packings and coverings, we prove that the space packing density of the cylinder equals π/√12, the same as the plane packing density of the circular disk.
The usual definition for vertex-criticality with respect to the chromatic index is that a multigraph G is vertex-critical if G is Class 2, connected, and χ'(G\υ) <χ'(G) for all υ ε V(G). We consider here an allied notion, that of vertex-criticality with respect to the chromatic class–in this case G is vertex critical if G is Class 2 and connected, but G\υ is Class 1 for all υ ε V(G). We also investigate the analogues of these two notions for edge-criticality.
Oler's lattice-point theorem gives a sharp upper bound for the lattice-point enumerator GΛ of a certain class of lattices in the plane. We give a sharp lower bound for GΛ of the corresponding class of lattices in all dimensions. This result is closely related to the Blichfeldt-van der Corputgeneralization of Minkowski's fundamental lattice-point theorem.
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).
Introduction. This paper describes a natural way to associate fractal setsto a certain class of absolutely convergent series in In Theorem 1 we give sufficient conditions for such series. Theorem 2 shows that each analytic function gives a different fractal series for each number in a certain open set. Theorem 3 gives the Hausdorff dimension of the associated sets to fractal series, under suitable conditions on the series. This theorem can be applied to some standard series in analysis, such as the binomial, exponential and trigonometrical complex series. The associated sets to geometrical complex series are selfsimilar sets previously studied by M. F. Barnsley from a different (dynamical) point of view (see refs. [5], [6]).
§1. Introduction. In [1], Odoni discusses the iterates of the polynomial x2 +1 and their Galois groups over the rationals (a problem initially proposed by J. McKay). Setting f1,(x) = x2+1 and fn(x) =f1(fn-1(X)) for n ≥ 2, write Kn for the splitting field of fn(x) over and Ωn = Gal (Kn/). Then Odoni proves that Ωn is isomorphic to a subgroup of [C2]n, the nth wreath power of the cyclic group C2 of order 2, and gives a simple rational criterion for Ωn [C2]n to hold. In this note we describe a computer implementation of Odoni's criterion, and state the result that Ωn [C2]n for n ≤ 5 × 107.
In this note, we investigate those Hausdorff measures which obey a simple scaling law. Consider a continuous increasing function θ defined on with θ(0)= 0 and let be the corresponding Hausdorff measure. We say that obeys an order α scaling law provided whenever K⊂ and c> 0, then
or, equivalently, if T is a similarity map of with similarity ratio c:
We show that for every smooth curve in Rn, there is a quadrilateral with equal sides and equal diagonals whose vertices lie on the curve. In the case of a smooth plane curve, this implies that the curve admits an inscribed square, strengthening a theorem of Schnirelmann and Guggenheimer. “Smooth” means having a continuously turning tangent. We give a weaker condition which is still sufficient for the existence of an inscribed square in a plane curve, and which is satisfied if the curve is convex, if it is a polygon, or (with certain restrictions) if it is piecewise of class C1. For other curves, the question remains open.
The nonlinear interactions that evolve between a planar or nearly planar Tollmien-Schlichting (TS) wave and the associated longitudinal vortices are considered theoretically, for a boundary layer at high Reynolds numbers. The vortex flow is either induced by the TS nonlinear forcing or is input upstream, and similarly for the nonlinear wave development. Three major kinds of nonlinear spatial evolution, Types I-III, are found. Each can start from secondary instability and then becomes nonlinear, Type I proving to be relatively benign but able to act as a pre-cursor to the Types II, III which turn out to be very powerful nonlinear interactions. Type II involves faster streamwise dependence and leads to a finite-distance blow-up in the amplitudes, which then triggers the full nonlinear three-dimensional triple-deck response, thus entirely altering the mean-flow profile locally. In contrast, Type III involves slower streamwise dependence but a faster spanwise response, with a small TS amplitude thereby causing an enhanced vortex effect which, again, is substantial enough to entirely alter the mean-flow profile, on a more global scale. Concentrated spanwise formations in which there is localized focussing of streamwise vorticity and/or wave amplitude can appear, and certain of the nonlinear features also suggest by-pass processes for transition and significant change in the flow structure downstream. The powerful nonlinear 3D interactions II, III seem potentially very relevant to experimental and computational findings in fully fledged transition; in particular, it is suggested in an appendix that the Type-Ill interaction can terminate in a form of 3D boundary-layer separation which appears possibly connected with the formation of lambda vortices in practice.
§1. Introduction. In this paper, as in [4], we are concerned with integer points (m, n) lying close to the curve
in the sense that
where ║t║ denotes the distance of the real number t from the nearest integer. We shall always suppose that
and that F(x) is at least twice continuously differentiable. Let R be the number of solutions of (1.1) with m an integer, O ≤ m ≤ L. The obvious method of estimating R uses the row-of-teeth or rounding error function