Illumination by translates of convex sets

Let S be a compact set in the plane. If every three points of S are illuminated clearly by some translate of the compact convex set T, then there is a translate of T which illumines every point of S. Various analogues hold for translates of flats in R ^das well.Supported in part by NSF grant DMS-8705336.     

A fractional Helly theorem for convex lattice sets

A set of the form , where is convex and denotes the integer lattice, is called a convex lattice set. It is known that the Helly number of d-dimensional convex lattice sets is 2^d. We prove that the fractional Helly number is only d+1: For every d and every α∈(0,1] there exists β>0 such that whenever F₁,…,F_n are convex lattice sets in such that for at least index sets I⊆{1,2,…,n} of size d+1, then there exists a (lattice) point common to at least βn of the F_i. This implies a (p,d+1)-theorem for every p?d+1; that is, if is a finite family of convex lattice sets in such that among every p sets of , some d+1 intersect, then has a transversal of size bounded by a function of d and p.     

Some Krasnosel'skii numbers for finitely starlike sets in the plane

Let S be a subset of the plane. In case (int cl S) S = , then S is finitely starlike if and only if every 4 points of S see via S a common point. In case (int cl S) S has at most countably many components, each a singleton set, then S is finitely starlike if and only if every 5 points of S see via S a common point. Each of the numbers 4 and 5 is best possible. Examples show that these results fail without suitable restrictions on (int cl S) S. Moreover, a final example shows that if a general Krasnosel'skii number . exists to characterize finitely starlike sets in the plane, then > 9.     

The dimension of the kernel in an intersection of starshaped sets

We establish the following Helly-type theorem: Let ${\cal K}$ be a family of compact sets in $\mathbb{R}^d$. If every d + 1 (not necessarily distinct) members of ${\cal K}$ intersect in a starshaped set whose kernel contains a translate of set A, then $\cap \{ K : K\; \hbox{in}\; {\cal K} \}$ also is a starshaped set whose kernel contains a translate of A. An analogous result holds when ${\cal K}$ is a finite family of closed sets in $\mathbb{R}^d$. Moreover, we have the following planar result: Define function f on $\{0, 1, 2\}$ by f(0) = f(2) = 3, f(1) = 4. Let ${\cal K}$ be a finite family of closed sets in the plane. For k = 0, 1, 2, if every f(k) (not necessarily distinct) members of ${\cal K}$ intersect in a starshaped set whose kernel has dimension at least k, then $\cap \{K : K\; \hbox{in}\; {\cal K}\}$ also is a starshaped set whose kernel has dimension at least k. The number f(k) is best in each case.Received: 4 June 2002     

The dimension of the kernel in finite and infinite intersections of starshaped sets

Summary. We establish the following Helly-type result for infinite families of starshaped sets in Define the function f on {1, 2} by f(1) = 4, f(2) = 3. Let be a fixed positive number, and let be a uniformly bounded family of compact sets in the plane. For k = 1, 2, if every f(k) (not necessarily distinct) members of intersect in a starshaped set whose kernel contains a k-dimensional neighborhood of radius , then is a starshaped set whose kernel is at least k-dimensional. The number f(k) is best in each case. In addition, we present a few results concerning the dimension of the kernel in an intersection of starshaped sets in Some of these involve finite families of sets, while others involve infinite families and make use of the Hausdorff metric.     

Reconstructing dimensions of intersections of convex sets

Denoting by dimA the dimension of the affine hull of the setA, we prove that if {K _i:i T} and {K _i ^j :i T} are two finite families of convex sets inR ⁿ and if dim {K _i :i S} = dim {K _i ^j :i S}for eachS T such that|S| n + 1 then dim {K _i :i T} = dim {K _i : {i T}}.     

On the equipartition of plane convex bodies and convex polygons

In this paper we consider the problem of partitioning a plane compact convex body into equal-area parts, i.e., an equipartition, by means of chords. We prove two basic results that hold with some specific exceptions: (a) When chords are pairwise non-crossing, the dual tree of the partition has to be a path, (b) A convex n-gon admits no equipartition produced by more than n chords having a common interior point.     

Flat transversals to flats and convex sets of a fixed dimension

Helly and Hadwiger type theorems for transversal m-flats to families of flats and, respectively, convex sets of dimension n are proved in the case of general position. The proofs rely on Helly type theorems for “linear partitions” and “convex partitions,” so that a general theory of Helly numbers is also developed.     

On the best estimate for perimeters of plane sets with the angle property

We investigate the problem of finding the maximum length of perimeters of plane sets with fixed diameter d, such that every point of the boundary of the set is a vertex of an open angle of opening which does not intersect the set. First we consider plane curves which satisfy such angle property in a finite number of directions, and among them we find the one of maximum length. Then we prove that the perimeter of any plane set with the angle property is less than or equal to d(sin /2)^-2; this is the best estimate when /2.     

On coverings of plane convex sets by translates of strips

In the euclidean planeE ² letS ₁,S ₂, ... be a sequence of strips of widthsw ₁,w ₂, .... It is shown thatE ² can be covered by translates of the stripsS _i if w ₁ ^3/2 = . Further results concern conditions in order that a compact convex domain inE ² can be covered by translates ofS ₁,S ₂, ....This research was supported by National Science Foundation Research Grant MCS 76-06111.     

A Helly theorem for intersections of orthogonally starshaped sets

Let $\cal{F}$ be a finite family of simply connected orthogonal polygons in the plane. If every three (not necessarily distinct) members of $\cal{F}$ have a nonempty intersection which is starshaped via staircase paths, then the intersection $\cap \{F : F\; \hbox{in}\; \cal{F}\}$ is a (nonempty) simply connected orthogonal polygon which is starshaped via staircase paths. Moreover, the number three is best possible, even with the additional requirement that the intersection in question be nonempty. The result fails without the simple connectedness condition.     

A Helly-type theorem for countable intersections of starshaped sets

Let k and d be fixed integers, 0kd, and let be a collection of sets in If every countable subfamily of has a starshaped intersection, then is (nonempty and) starshaped as well. Moreover, if every countable subfamily of has as its intersection a starshaped set whose kernel is at least k-dimensional, then the kernel of is at least k-dimensional, too. Finally, dual statements hold for unions of sets.Received: 3 April 2004     

On the addition of convex sets in the hyperbolic plane

Analogue to the definition $K + L := \bigcup_{x\in K}(x + L)$ of the Minkowski addition in the euclidean geometry it is proposed to define the (noncommutative) addition $K \vdash L := \bigcup_{0\, \leqsl\, \rho\,\leqsl\, a(\varphi),0\,\leqsl\,\varphi\,<\, 2\pi}T_{\rho}^{(\varphi)}(L)$ for compact, convex and smoothly bounded sets K and L in the hyperbolic plane $\Omega$ (Kleins model). Here $\rho = a(\varphi)$ is the representation of the boundary $\partial$ K in geodesic polar coordinates and $T_{\rho}^{(\varphi)}$ is the hyperbolic translation of $\Omega$ of length $\rho$ along the line through the origin o of direction $\varphi$. In general this addition does not preserve convexity but nevertheless we may prove as main results: (1) $o \in$ int $K, o \in$ int L and K,L horocyclic convex imply the strict convexity of $K \vdash L$, and (2) in this case there exists a hyperbolic mixed volume $V_h(K,L)$ of K and L which has a representation by a suitable integral over the unit circle.     

Unions of three starshaped sets in R2

LetS be a compact, simply connected set inR ². If every boundary point ofS is clearly visible viaS from at least one of the three pointsa, b, c, thenS is a union of three starshaped sets whose kernels containa, b, c, respectively. The result fails when the number three is replaced by four.As a partial converse, ifS is a union of three starshaped sets whose kernels containa, b, c, respectively, then the set of points in the boundary ofS clearly visible from at least one ofa, b, orc is dense in the boundary ofS.Supported in part by NSF grant DMS-8705336.     

Isoperimetric deficit and convex plane sets of maximum translative discrepancy

The paper deals with the following question: Among the convex plane sets of fixed isoperimetric deficit, which are the sets of maximum translative deviation from the circular shape? The answer is given for the cases in which the deviation is measured either by the translative Hausdorff metric or by the translative symmetric difference metric.     

Determining starshaped sets and unions of starshaped sets by their sections

Let S be a compact set in R^d. Let p be a fixed point of S and let k be a fixed integer, 1 k <d. Then S is starshaped with p ker S if and only if for every k-dimensional flat F through p, F S is starshaped. Moreover, an analogue of this result holds for unions of starshaped sets as well.     

Unions of orthogonally convex or orthogonally starshaped polygons

LetT be a simply connected orthogonal polygon having the property that for every three points ofT, at least two of these points see each other via staircases inT. ThenT is a union of three orthogonally convex polygons. The number three is best possible.ForT a simply connected orthogonal polygon,T is a union of two orthogonally convex polygons if and only if for every sequencev ₁,...,v _n,v _n+1 =v ₁ inT, n odd, at least one consecutive pairv _i ,v _i+1 sees each other via staircase paths inT, 1 i n. An analogous result says thatT is a union of two orthogonal polygons which are starshaped via staircase paths if and only if for every odd sequence inT, at least one consecutive pair sees a common point via staircases inT.Supported in part by NSF grants DMS-8908717 and DMS-9207019.     

Characterizing compact unions of two starshaped sets inR d

SetS inR ^d has propertyK ₂ if and only ifS is a finite union ofd-polytopes and for every finite setF in bdryS there exist points c₁,c₂ (depending onF) such that each point ofF is clearly visible viaS from at least one c_i,i = 1,2. The following characterization theorem is established: Let , d2. SetS is a compact union of two starshaped sets if and only if there is a sequence {S _j } converging toS (relative to the Hausdorff metric) such that each setS _j satisfies propertyK ₂. For , the sufficiency of the condition above still holds, although the necessity fails.     

Families of planar sets having starlike union

Let be a finite family of compact sets in the plane, and letk be a fixed natural number. If every three (not necessarily distinct) members of have a union which is simply connected and starshaped viak-paths, then and is starshaped viak-paths. Analogous results hold for paths of length at most , > 0, and for staircase paths, although not for staircasek-paths.Supported in part by NSF grant DMS-9504249