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.
In Theorem 7.13 of [1], Proposition 3.1 of [5], and Theorem 1 of [10], minimal group actions on R-trees are considered. If a group G acts on a tree T, then a Lyndon length function lu is associated with each point u∈T. Abstract minimal length functions are defined in Section 2 of this paper by a simple reduction process, where lengths of elements are reduced by a fixed amount (except that any length must remain non-negative). It is shown in Theorem 2.3 that minimal length functions correspond to minimal actions by following Chiswell's construction of actions on trees from length functions, given in [4]. A parallel result to Theorem 1 of [10] is given for minimal length functions in Theorem 2.2. One outcome of these results is that to determine which length functions can arise from an action of a group on the same tree, it suffices to consider only minimal length functions. Section 1 is concerned with some preparatory properties on lengths of products of elements. These lead in Proposition 1.6 to an alternative description of the maximal trivializable subgroup associated with a length function, defined in [3].
§1. Introduction. Let X be a Hausdorff space and let ρ be a metric, not necessarily related to the topology of X. The space X is said to be fragmented by the metric ρ if each non-empty set in X has non-empty relatively open subsets of arbitrarily small ρ-diameter. The space X is said to be a σ-fragmented by the metric ρ if, for each ε>0, it is possible to write
where each set Xi, i≥1, has the property that each non-empty subset of Xi, has a non-empty relatively open subset of ρ-diameter less than ε. If is any family of subsets of X, we say that X is σ-fragmented by the metric ρ, using sets from, if, for each ε>0, the sets Xi, i ≥ 1, in (1.1) can be taken from
Let R be a commutative, Noetherian ring and let Q be the total quotient ring of R. We shall call B an intermediate ring if R ⊂ B ⊂ Q. In [S] it is proved, for an integral domain R, that if R ⊂ B ⊂ Rf where B is flat over R, then B is a finitely generated R-algebra. We observe that the result holds for any commutative, Noetherian ring where f is a non-zero divisor. Our proof [Theorem 1.1] is a little different and straight; it is given for completeness. The idea of the proof in [S] lies in finding an ideal I of R such that IB = B, and for any λ∈I, b∈B there exists m ≥ 1 such that λmb ∈ R. We shall show that even if an intermediate ring B is finitely generated R-algebra, there may not exist any ideal I of R such that IB = B, moreover, if B is not finitely generated R-algebra, we may have IB = B for some ideal I in R.
An explicit formula is given for the volume of the polar dual of a polytope. Using this formula, we prove a geometric criterion for critical (w.r.t. volume) sections of a regular simplex.
§1. Introduction. In 1985, Sárkõzy [11] proved a conjecture of Erdõs [2] by showing that the greatest square factor s(n)2 of the “middle” binomial coefficient satisfies for arbitrary ε > 0 and sufficiently large n
Abstract. We show that the set of T-numbers in Mahler's classification of transcendental numbers supports a measure whose Fourier transform vanishes at infinity. A similar argument shows that U-numbers also support such a measure.
Abstract. We consider the structure of the Kac modules V(Λ) for dominant integral doubly atypical weights Λ of the Lie superalgebra s1(2/2). Primitive vectors of V(Λ) are constructed and it is shown that the number of composition factors of V(Λ) for such Λ is in exact agreement with the conjectures of [HKV]. These results are used to show that the extended Kac-Weyl character formula which was proved in [VHKTl] for singly atypical simple modules of s1(m/n), and conjectured to be valid for all finite dimensional irreducible representations of sl(m/n) in [VHKT2] is in fact valid for all finite-dimensional doubly atypical simple modules of s1(2/2).
Let K ⊂ Rd be a convex body and choose points xl, x2, …, xn randomly, independently, and uniformly from K. Then Kn = conv {x1, …, xn} is a random polytope that approximates K (as n → ∞) with high probability. Answering a question of Rolf Schneider we determine, up to first order precision, the expectation of vol K – vol Kn when K is a smooth convex body. Moreover, this result is extended to quermassintegrals (instead of volume).
Abstract. Sufficient conditions are derived for all bounded solutions of general classes of integrodifferential equations of arbitrary order with variable coefficients to be either oscillatory or convergent to zero asymptotically.
Abstract. For F a field we compute, explicitly and directly, the right Krull dimension of the algebra Qop⊗FQ for certain semisimple Artinian F-algebras Q. (Here Qop denotes the opposite ring of Q.) We use our calculation to give alternative proofs of some theorems of J. T. Stafford and A. I. Lichtman. Our methods involve a detailed study of skew polynomial rings.
Abstract. Let Φ be in the disc algebra H∞ ∩ C(T) with its restriction to T in the Zygmund space of smooth functions λ*(T). If P(Φ') ⊂ T is the set of Plessner points of Φ' and if F = Φ + Ψ, where Ψ∈C1(T), it is shown that F(P(Φ')) ⊆ C is a set of zero linear Hausdorff measure. Applications are given to the spectral theory of multiplication operators.
Greedoids were invented around 1980 by B. Korte and L. Lovász. Originally, the main motivation for proposing this generalization of the matroid concept came from combinatorial optimization. Korte and Lovász had observed that the optimality of a ‘greedy’ algorithm could in several instances be traced back to an underlying combinatorial structure that was not a matroid – but (as they named it) a ‘greedoid’. In subsequent research greedoids have been shown to be interesting also from various non-algorithmic points of view.
The basic distinction between greedoids and matroids is that greedoids are modeled on the algorithmic construction of certain sets, which means that the ordering of elements in a set plays an important role. Viewing such ordered sets as words, and the collection of words as a formal language, we arrive at the general definition of a greedoid as a finite language that is closed under the operation of taking initial substrings and satisfies a matroid-type exchange axiom. It is a pleasant feature that greedoids can also be characterized in terms of set systems (the unordered version), but the language formulation (the ordered version) seems more fundamental.
Consider, for instance, the algorithmic construction of a spanning tree in a connected graph. Two simple strategies are: (1) pick one edge at a time, making sure that the current edge does not form a circuit with those already chosen; (2) pick one edge at a time, starting at some given node, so that the current edge connects a visited node with an unvisited node.
The connections between graph theory and matroid theory can be traced back to the study of graphic matroids, which were introduced by Whitney (1935) and have been extensively investigated (see Chapters 1, 2, and 6 of White, 1986). We recall that a matroid is graphic if it is isomorphic to the polygon matroid of some graph.
In this chapter we present some recent results that give a new setting to the relations between graphs and matroids. In the light of this setting, the polygon matroid appears as the simplest and best known object among an uncountably infinite collection of similar objects.
The fundamental concept that we want to introduce is the concept of a ‘matroidal family of graphs’. The precise definition is given below. According to this definition, the collection of all polygons is a matroidal family of graphs, the simplest among the non-trivial ones. Another example of a matroidal family of graphs is the collection of all bicycles, where a bicycle is a connected graph with two independent cycles and no vertex of degree less than two, that is to say, a bicycle is a graph homeomorphic to one of the graphs J00, J0.0, or J0.0 pictured in Figure 4.1.
As we shall see, there are uncountably many matroidal families of graphs; the subject is virtually unexplored and this chapter is just a brief introduction to this fascinating new field.