The volume of the Lp-centroid body of a convex body K ⊂ ℝd is a convex function of a time-like parameter when each chord of K parallel to a fixed direction moves with constant speed. This fact is used to study extrema of some affine invariant functionals involving the volume of the Lp-centroid body and related to classical open problems like the slicing problem. Some variants of the Lp-Busemann-Petty centroid inequality are established. The reverse form of these inequalities is proved in the two-dimensional case.

Let v be a Henselian valuation of any rank of a field K and its unique prolongation to a fixed algebraic closure of K having value group . For any subfield L of , let R(L) denote the residue field of the valuation obtained by restricting to L. Using the canonical homomorphism from the valuation ring of v onto its residue field R(K), one can lift any monic irreducible polynomial with coefficients in R(K) to yield a monic irreducible polynomial with coefficients in K. In an attempt to generalize this concept, Popescu and Zaharescu introduced the notion of lifting with respect to a (K, v)-minimal pair (α, δ) belonging to × . As in the case of usual lifting, a given monic irreducible polynomial Q(y) belonging to R(K(α))[y] gives rise to several monic irreducible polynomials over K which are obtained by lifting with respect to a fixed (K, v)-minimal pair (α, δ). If F, F1 are two such lifted polynomials with coefficients in K having roots θ, θ1, respectively, then it is proved in the present paper that in case (K, v) is a tame field, it is shown that K(θ) and K(θ1) are indeed K-isomorphic.

Absolute curvature measures for locally finite unions of sets with positive reach are introduced, extending the definition of Zähle [13] by taking into account the absolute value of the index function. It is shown that this definition differs from that of Matheron [5] and Schneider [12]. An intersection formula of Crofton type for absolute curvature measures is proved. The role of absolute curvature measures in geometric statistics is illustrated by an example.

An instance of the square packing problem consists of n squares with independently, uniformly distributed side-lengths and independently, uniformly distributed locations on the unit d-dimensional torus. A packing is a maximum family of pairwise disjoint squares. The one-dimensional version of the problem is the classical random interval packing problem. This paper deals with the asymptotic behaviour of packings as n tends to infinity while d = 2. Coffman, Lueker, Spencer and Winkler recently proved that the average size of packing is Θ(nd/(d+1)). Using partitioning techniques, sub-additivity and concentration of measure arguments, we show first that, after normalization by n2/3, the size of two-dimensional square packings tends in probability toward a genuine limit γ. Straightforward concentration arguments show that large fluctuations of order n2/3 should have probability vanishing exponentially fast with n2/3. Even though γ remains unknown, using a change of measure argument we show that this upper bound on tail probabilities is qualitatively correct.

We define a space of random edge-coloured graphs [Gscr]n,m,κ which correspond naturally to edge κ-colourings of Gn,m. We show that there exist constants K0, K1 [les ] 21 such that, provided m [ges ] K0n log n and κ [ges ] K1n, then a random edge-coloured graph contains a multi-coloured Hamilton cycle with probability tending to 1 as the number of vertices n tends to infinity.

We show that, for every positive integer c*, there is an integer n such that, if M is a matroid whose largest cocircuit has size c*, then E(M) can be partitioned into two sets E1 and E2 such that every connected component of each of M[mid ]E1 and M[mid ]E2 has at most n elements.

Let λ(G) be the largest eigenvalue of the adjacency matrix of a graph G: We show that if G is Kp+1-free then

This inequality was first conjectured by Edwards and Elphick in 1983 and supersedes a series of previous results on upper bounds of λ(G).

Let Ti denote the number of all i-cliques of G, λ = λ(G) and p = cl(G): We show

Let δ be the minimal degree of G. We show

This inequality supersedes inequalities of Stanley and Hong. It is sharp for regular graphs and for a class of graphs which are in some sense maximally irregular.