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 usual method of dealing with delay differential equations such as
is the method of steps [1, 2]. In this, y(x) is assumed to be known for − α < x < 0, thereby defining over 0 < x < α. As a result of integration, the value of y is now known over 0 < x < α, and the integration proceeds thereon by a succession of steps.
In the last three decades there appeared a number of elementary proofs of the prime number theorem (PNT) in the literature (see [3] for a survey). Most of these proofs are based, at least in part, on ideas from the original proof by Erdős [5] and Selberg [12]. In particular, one of the main ingredients of the Erdős-Selberg proof, Selberg's formula
(where p and q run through primes) appears, in some form, in almost all these proofs.
In a recent paper Taylor and Tricot [10] introduced packing measures in ℝd. We modify their definition slightly to extend it to a general metric space. Our main concern is to show that in any complete separable metric space every analytic set of non-σ-finite h-packing measure contains disjoint compact subsets each of non-σ-finite measure. The corresponding problem for Hausdorff measures is discussed, but not completely resolved, in Rogers' book [7]. We also show that packing measure cannot be attained by taking the Hausdorff measure with respect to a different increasing function using another metric which generates the same topology. This means that the class of pacing measures is distinct from the class of Hausdorff measures.
We continue the study of approximate subdifferentials initiated in [3], this time for functions on arbitrary locally convex spaces. The complexity of the infinite dimensional theory is in particular determined by the fact that various approaches and definitions which are equivalent in the finite dimensional situation are, in general, no longer equivalent if the space is infinite dimensional.
E. Cartan's famous isoparametric hypersurface in S4 with three distinct constant principal curvatures is geometrically a parallel hypersurface of the Veronese surface, and topologically it is an 8-fold quotient of the 3-sphere. In the present paper we describe a polyhedral analogue with only 15 vertices. Combinatorially this is an 8-fold quotient of the boundary complex of the 600-cell, and geometrically it is a quite regular subcomplex of a certain almost convex simplicial 4-sphere in E5. The euclidean symmetry group of this embedding is isomorphic to the icosahedral group A5 acting transitively on the 15 vertices.
It is well-known that if R is a commutative ring with identity, M is a Noetherian R-module and I is an ideal of R such that M/IM has finite length, then the function n → lR (M /InM) is a polynomial function for n large (cf. [3], p. II-25), where lR denotes length as an R-module. In this note we are concerned with the function
where a1, … , ar is a multiplicity system for has finite length.
In a series of papers we have analysed the embedding of certain groups H as normal subgroups of absolutely irreducible skew linear groups G, see [7], [8], [9] and [10]. Here we drop the absolutely irreducibility assumption on G. If H is locally finite we derive relatively strong conditions on G, although not as strong as when G is absolutely irreducible. If H is abelian, very much in contrast to the absolutely irreducible case, we show that nothing can be said. The phrase “bounded by an integer-valued function of n only” we abbreviate to “n-bounded”.
In 1979 Montgomery and Vaughan [3] showed that for each k > 0
the sum being over the non-principal characters χ modulo q. As a corollary they deduced that, if 0 < θ < 1 then there is a constant c(θ) such that at least θφ(q) of the non-principal characters χ modulo q satisfy
Let k denote a fixed natural number with k > 2, let ℛs(n) denote the number of representations of n as the sum of sk-th powers of natural numbers, and let
be a real quadratic form in n variables with integral coefficients (i.e., 2fij ε ℤ, fiiε ℤ.) and determinant D ≠ O. A well-known theorem of Cassels [1] states that if the equation f = 0 is properly soluble in integers x1 … , xn then there is a solution satisfying
where F = max |fij and we use the «-notation with an implicit factor depending only on n. More recently it has been shown that f has n linearly independent zeros x1 …, xn satisfying
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 (local) Lie loop is a real analytic manifold M with a base point e and three analytic functions (x, y) → x° y, x\y, x/y: M × M → M (respectively, U × U → M for an open neighbourhood U of e in M) such that the following conditions are satisfied: (i) x ° e = e ° x = e, (ii) x ° (x\y) = y, and (iii) (x/y)° y = x for all x, y ε M (respectively, U). If the multiplication ° is associative, then M is a (local) Lie group. The tangent vector space L(M) in e is equipped with an anticommutative bilinear operation (X, Y) →[X, Y] and a trilinear operation (X, Y, Z) →〈X, Y, Z〉. These are defined as follows: Let B be a convex symmetric open neighbourhood of 0 in L(M) such that the exponential function maps B diffeomorphically onto an open neighbourhood V of e in M and transport the operation ° into L(M) by defining X ° Y = (exp|B)−1((exp X)° (exp Y)) for X and Y in a neighbourhood C of 0 in B such that (exp C) ° (exp C) ⊂ V. Similarly, we transport / and \.
Let UK = [0, 1)K be the K-dimensional unit cube, where K ≥ 2. Suppose that we have a distribution ℘ of N points in UK. For × = ( x1, … , xK) ε UK, let A(x) denote the box
and write
Note that since N is the cardinality of ℘ and x1 … xK is the K-dimensional volume of A(x), the term Nx1 … xK represents the “expected number” of, points of ℘ in A(x).
The purpose of this paper is to give some natural examples of Borel-inseparable pairs of coanalytic sets in Polish spaces.
A Polish space is a topological space homeomorphic to a separable complete metric space. In this paper, all spaces are uncountable Polish spaces. A pointset is analytic (or ) if it is the continuous image of a Borel set (in any space), or equivalently, the projection of a Borel set, and is coanalytic (or ) if it is the complement of an analytic set. The class of analytic sets is closed under countable unions and intersections, images and preimages by Borel measurable functions, and projections; it is not closed under complements, hence there is an analytic set which is not Borel.
The two fundamental examples in Whitney's seminal paper on independence theory (Whitney 1935) were vector matroids and graphic matroids. It is therefore not surprising that so many aspects of matroid theory are extensions and developments of concepts that were originally introduced in vector spaces or in graphs. In this chapter we shall study in detail the class of graphic matroids. The first section will consider the polygon and bond matroids of a graph, that is, those matroids on the edge-set of a graph Г whose circuits are respectively the circuits and the bonds of Г. The main result of Section 6.1 characterizes those graphs whose bond matroids are graphic. The polygon and bond matroids are not the only matroids that can be defined on the edge-set of a graph. Several other such matroids will be considered in detail in a chapter on matroidal families in a later volume.
In Section 6.2 we shall consider the concept of connectivity in matroid theory, indicating its relationship to various notions of connectivity for graphs. These ideas will be used in Section 6.3, where the main result of this chapter is proved. This result, due to Whitney (1933), characterizes precisely when two graphs have isomorphic polygon matroids. In the final section we shall investigate two graph-theoretic operations having their origins in electrical-network theory. One of the important aspects of these operations in the present context is the fact that they have been very successfully generalized to matroids.
This book had its beginnings over a decade ago, as a simple rewriting of Crapo and Rota's preliminary edition of Combinatorial Geometries, to be accomplished by Crapo, Rota, and White. We soon realized that the subject had grown enough, even then, that a more comprehensive compendium would be of greater benefit. This led, in turn, to the idea of soliciting contributions from many of the workers in matroid theory. Consequently, this work has grown too lengthy to be contained in a single volume. This is but the first of a projected three-volume series, although we are giving separate titles to each of the volumes. We are planning to call the remaining volumes Combinatorial Geometries, and Advances in Matroid Theory.
This first volume is a primer in the basic axioms and constructions of matroids. It will prove useful as a text because exposition has been kept a prime consideration throughout. Proofs of theorems are often omitted, with references given to the original works, and exercises are included. This volume will also be useful as a reference work for matroid theorists, especially Brylawski's encyclopedic chapter “Constructions” and his cryptomorphism appendix.
The volume starts with Crapo's chapter “Examples and Basic Concepts.” This chapter is a very informal introduction to matroids, with lots of examples, that provides an overview of the subject. The next chapter is “Axiom Systems,” by Nicoletti and White. This gets into the necessary work of proving the equivalence of some of the major axiom systems, a chore made easier by keeping in mind the familiar analogous concepts from linear algebra.