Typical curvature behaviour of bodies of constant width

It is known that an n-dimensional convex body, which is typical in the sense of Baire category, shows a simple, but highly non-intuitive curvature behaviour: at almost all of its boundary points, in the sense of measure, all curvatures are zero, but there is also a dense and uncountable set of boundary points at which all curvatures are infinite. The purpose of this paper is to find a counterpart to this phenomenon for typical convex bodies of given constant width. Such bodies cannot have zero curvatures. A main result says that for a typical n-dimensional convex body of constant width 1 (without loss of generality), at almost all boundary points, in the sense of measure, all curvatures are equal to 1. (In contrast, note that a ball of width 1 has radius 1/2, hence all its curvatures are equal to 2.) Since the property of constant width is linear with respect to Minkowski addition, the proof requires recourse to a linear curvature notion, which is provided by the tangential radii of curvature.     

Projection problems for symmetric polytopes

Let K⊂Rn be a convex body (a compact, convex subset with non-empty interior), ΠK its projection body. Finding the least upper bound, as K ranges over the class of origin-symmetric convex bodies, of the affine-invariant ratio V(ΠK)/V(K)ⁿ⁻¹, being called Schneider's projection problem, is a well-known open problem in the convex geometry. To study this problem, Lutwak, Yang and Zhang recently introduced a new affine invariant functional for convex polytopes in Rn. For origin-symmetric convex polytopes, they posed a conjecture for the new functional U(P). In this paper, we give an affirmative answer to the conjecture in Rn, thereby, obtain a modified version of Schneider's projection problem.     

Separable subspaces of affine function spaces on convex compact sets

Let K be a compact convex subset of a separated locally convex space (over R) and let Ap(K) denote the space of all continuous real-valued affine mappings defined on K, endowed with the topology of pointwise convergence on the extreme points of K. In this paper we shall examine some topological properties of Ap(K). For example, we shall consider when Ap(K) is monolithic and when separable compact subsets of Ap(K) are metrizable.     

On the vertex index of convex bodies

We introduce the vertex index, vein(K), of a given centrally symmetric convex body K⊂Rd, which, in a sense, measures how well K can be inscribed into a convex polytope with small number of vertices. This index is closely connected to the illumination parameter of a body, introduced earlier by the first named author, and, thus, related to the famous conjecture in Convex Geometry about covering of a d-dimensional body by d² smaller positively homothetic copies. We provide asymptotically sharp estimates (up to a logarithmic term) of this index in the general case. More precisely, we show that for every centrally symmetric convex body K⊂Rd one has

     

Expectation of random polytopes

A random polytopeP _n in a convex bodyC is the convex hull ofn identically and independently distributed points inC. Its expectation is a convex body in the interior ofC. We study the deviation of the expectation ofP _n fromC asn→∞: while forC of classC ^k+1,k≥1, precise asymptotic expansions for the deviation exist, the behaviour of the deviation is extremely irregular for most convex bodiesC of classC ¹. Dedicated to my teacher and friend Professor Edmund Hlawka on the occasion of his 80^th birthday     

On the existence of a point subset with three or five interior points

An interior point of a finite planar point set is a point of the set that is not on the boundary of the convex hull of the set. For any integer k ≥ 1, let h(k) be the smallest integer such that every point set in the plane, no three collinear, with at least h(k) interior points, has a subset with k or k + 2 interior points of P. We prove that h(3) = 8.     

More on planar point subsets with a specified number of interior points

An interior point of a finite planar point set is a point of the set that is not on the boundary of the convex hull of the set. For any integer k ≥ 1, let g(k) be the smallest integer such that every set P of points in the plane with no three collinear points and with at least g(k) interior points has a subset containing precisely k interior point of P. We prove that g(k) ≥ 3k for k ≥ 3, which improves the known result that g(k) ≥ 3k ? 1 for k ≥ 3.     

Convex polarities over ordered fields

We use tools and methods from real algebraic geometry (spaces of ultrafilters, elimination of quantifiers) to formulate a theory of convexity in K^N over an arbitrary ordered field. By defining certain ideal points (which can be viewed as generalizations of recession cones) we obtain a generalized notion of polar set. These satisfy a form of polar duality that applies to general convex sets and does not reduce to classical duality if K is the field of real numbers. As an application we give a partial classification of total orderings of Artinian local rings and two applications to ordinary convex geometry over the real numbers.     

The cross-section body, plane sections of convex bodies and approximation of convex bodies, I

For a convex body K ^d we investigate three associated bodies, its intersection body IK (for 0int K), cross-section body CK, and projection body IIK, which satisfy IKCKIIK. Conversely we prove CKconst₁(d)I(K–x) for some xint K, and IIKconst₂ (d)CK, for certain constants, the first constant being sharp. We estimate the maximal k-volume of sections of 1/2(K+(-K)) with k-planes parallel to a fixed k-plane by the analogous quantity for K; our inequality is, if only k is fixed, sharp. For L ^d a convex body, we take n random segments in L, and consider their Minkowski average D. We prove that, for V(L) fixed, the supremum of V(D) (with also nN arbitrary) is minimal for L an ellipsoid. This result implies the Petty projection inequality about max V((IIM)*), for M ^d a convex body, with V(M) fixed. We compare the volumes of projections of convex bodies and the volumes of the projections of their sections, and, dually, the volumes of sections of convex bodies and the volumes of sections of their circumscribed cylinders. For fixed n, the pth moments of V(D) (1p<) also are minimized, for V(L) fixed, by the ellipsoids. For k=2, the supremum (nN arbitrary) and the pth moment (n fixed) of V(D) are maximized for example by triangles, and, for L centrally symmetric, for example by parallelograms. Last we discuss some examples for cross-section bodies.Research (partially) supported by Hungarian National Foundation for Scientific Research, Grant No. 41.     

Existence of equilibria of set-valued maps on bounded epi-Lipschitz domains in Hilbert spaces without invariance conditions

In this paper, we provide a new result of the existence of equilibria for set-valued maps on bounded closed subsets K of Hilbert spaces. We do not impose either convexity or compactness assumptions on K but we assume that K has epi-Lipschitz sections, i.e. its intersection with suitable finite dimensional spaces is locally the epigraph of Lipschitz functions. In finite dimensional spaces, the famous Brouwer theorem asserts the existence of a fixed point for a continuous function from a compact convex set K to itself. Our result could be viewed as a kind of generalization of this classical result in the context of Hilbert spaces and when the function (or the set-valued map) does not necessarily map K into itself (K is not invariant under the map). Our approach is based firstly on degree theory for compact and for condensing set-valued maps and secondly on flows generated by trajectories of differential inclusions.     

Sets determined by finitely many X-rays

A measurable set in _n which is uniquely determined among all measurable sets (modulo null sets) by its X-rays in a finite set L of directions, or more generally by its X-rays parallel to a finite set L of subspaces, is called L-unique, or simply unique. Some subclasses of the L-unique sets are known. The L-additive sets are those measurable sets E which can be written E {x _n : _i f _i (x) * 0}. Here, denotes equality modulo null sets, * is either or >, and the terms in the sum are the values of ridge functions f _i orthogonal to subspaces S _i in L. If n=2, the L-inscribable convex sets are those whose interiors are the union of interiors of inscribed convex polygons, all of whose sides are parallel to the lines in L. Relations between these classes are investigated. It is shown that in _n each L-inscribable convex set is L-additive, but L-additive convex sets need not be L-inscribable. It is also shown that every ellipsoid in _n is unique for any set of three directions. Finally, some results are proved concerning the structure of convex sets in _n , unique with respect to certain families of coordinate subspaces.     

Constructing a polytope to approximate a convex body

We develop an algorithm to construct a convex polytopeP withn vertices, contained in an arbitrary convex bodyK inR ^d , so that the ratio of the volumes |K/P|/|K| is dominated byc ·. d/n ^2/(d–1).Supported in part by the fund for the promotion of research in the Technion     

Parallel X-ray tomography of convex domains as a search problem in two dimensions

In 1961, at A.M.S. Symposium on Convexity, P.C. Hammer proposed the following problem: how many X-ray pictures of a convex planar domain D must be taken to permit its exact reconstruction? Richard Gardner writes in his fundamental 2006 book [4] that X-rays in four different directions would do the job. The present paper points at the possibility that in certain asymptotical sense X-rays in only three different directions can be enough for approximate reconstruction of centrally symmetric convex domains. The accuracy of reconstruction would tend to become perfect in the limit, as the directions of the three X-rays change, all three converging to some given direction. The analysis leading to that conclusion is based on two lemmas of Section 1 and Pleijel type identity for parallel X-rays derived in Sections 2 and 3. These tools together supply a systemof two differential equations with respect to two unknown functions that describe the two branches of the domain boundary D. The system is easily resolved. The solution intended to provide a complete tomography reconstruction of D, happens however to depend on a two dimensional parameter, whose “real value” remains unknown. So tomography reconstruction of D becomes possible if a satisfactory approximation to that unknown “real value” can be found. In the last section a test procedure for the individual candidates for “approximate real value” of the parameter is described. A uniqueness theorem concerning tomography of circular discs is proved.     

Capacities, surface area, and radial sums

A dual capacitary Brunn-Minkowski inequality is established for the (n−1)-capacity of radial sums of star bodies in Rn. This inequality is a counterpart to the capacitary Brunn-Minkowski inequality for the p-capacity of Minkowski sums of convex bodies in Rn, 1?p<n, proved by Borell, Colesanti, and Salani. When n?3, the dual capacitary Brunn-Minkowski inequality follows from an inequality of Bandle and Marcus, but here a new proof is given that provides an equality condition. Note that when n=3, the (n−1)-capacity is the classical electrostatic capacity. A proof is also given of both the inequality and a (different) equality condition when n=2. The latter case requires completely different techniques and an understanding of the behavior of surface area (perimeter) under the operation of radial sum. These results can be viewed as showing that in a sense (n−1)-capacity has the same status as volume in that it plays the role of its own dual set function in the Brunn-Minkowski and dual Brunn-Minkowski theories.     

More on an Erdős–Szekeres-Type Problem for Interior Points

An interior point of a finite planar point set is a point of the set that is not on the boundary of the convex hull of the set. For any integer k≥1, let g(k) be the smallest integer such that every planar point set in general position with at least g(k) interior points has a convex subset of points with exactly k interior points of P. In this article, we prove that g(3)=9.     

On Polygons Excluding Point Sets

By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respectively, in the plane such that ${B\cup R}$ is in general position, and the convex hull of B contains k interior blue points and l interior red points. Hurtado et al. found sufficient conditions for the existence of a blue polygonization that encloses all red points. We consider the dual question of the existence of a blue polygonization that excludes all red points R. We show that there is a minimal number K = K(l), which is bounded from above by a polynomial in l, such that one can always find a blue polygonization excluding all red points, whenever k ≥ K. Some other related problems are also considered.     

Constructions from empty polygons

Let P denote a finite set of points, in general position in the plane. In this note we study conditions which guarantee that P contains the vertex set of a convex polygon that has exactly k points of P in its interior.     

Successive Determination and Verification of Polytopes by their X-Rays

It is shown that each convex polytope P in ^d can be verifiedby ([d/(d–k)] + 1) k-dimensional X-rays. This means thatP is uniquely determined by these X-rays and the choice of thedirection of each X-ray depends only on P. Examples are constructedto show that in general this number cannot be reduced. Further,it is shown that each convex polytope P in ³ can be successivelydetermined by only two one-dimensional X-rays. This means thatP is uniquely determined by one X-ray taken in an arbitrarydirection together with another whose direction depends onlyon the first X-ray. The results extend those for the case d= 2 of Giering and of Edelsbrunner and Skiena.     

Computing the radius of pointedness of a convex cone

Let Ξ(H) denote the set of all nonzero closed convex cones in a finite dimensional Hilbert space H. Consider this set equipped with the bounded Pompeiu-Hausdorff metric δ. The collection of all pointed cones forms an open set in the metric space (Ξ(H),δ). One possible way of measuring the degree of pointedness of a cone K is by evaluating the distance from K to the set of all nonpointed cones. The number ρ(K) obtained in this way is called the radius of pointedness of the cone K. The evaluation of this number is, in general, a very cumbersome task. In this note, we derive a simple formula for computing ρ(K), and we propose also a method for constructing a nonpointed cone at minimal distance from K. Our results apply to any cone K whose maximal angle does not exceed 120°. Dedicated to Clovis Gonzaga on the occassion of his 60th birthday.