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.     

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.     

A characterization theorem for certain unions of two starshaped sets in R 2

Let S be a compact set in R ². For S simply connected, S is a union of two starshaped sets if and only if for every F finite, F bdry S, there exist a set G bdry S arbitrarily close to F and points s, t depending on G such that each point of G is clearly visible via S from one of s, t. In the case where S has at most finitely many components, the necessity of the condition still holds while the sufficiency fails.     

Simply connected orthogonal polygons as unions of two orthogonally starshaped sets

Let S be a simply connected orthogonal polygon in the plane. The set S is a union of two sets which are starshaped via staircase paths (i.e., orthogonally starshaped) if and only if for every three points of S, at least two of these points see (via staircase paths) a common point of S. Moreover, the simple connectedness condition cannot be deleted.     

An example concerning unions of two starshaped sets in the plane

LetS be a closed, simply connected subset of the plane,J a line segment (or a one-pointed set),J⊂S. If for every three points ofS there is a point ofJ seeing at least two of these points viaS, thenS is a union of two starshaped sets. IfJ⊈S or ifS is not simply connected, the result fails.     

Points of local nonconvexity and sets which are almost starshaped

Let Sø be a bounded connected set in R ², and assume that every 3 or fewer lnc points of S are clearly visible from a common point of S. Then for some point p in S, the set A{s : s in S and [p, s] S} is nowhere dense in S. Furthermore, when S is open, then S in starshaped.     

Sets in a euclidean space which are not a countable union of convex subsets

We prove that if a closed planar setS is not a countable union of convex subsets, then exactly one of the following holds:

d-Collapsing and nerves of families of convex sets

Archiv der Mathematik -     

Measure of segments which intersect a convex body from rotational formulae

Classical problems in integral geometry and geometric probability involve the kinematic measure of congruent segments of fixed length within a convex body in R³. We give this measure from rotational formulae; that is, from isotropic plane sections through a fixed point. From this result we also obtain a new rotational formula for the volume of a convex body; which is proved to be equivalent to the wedge formula for the volume.     

Distance sets that are a shift of the integers and Fourier basis for planar convex sets

The aim of this paper is to prove that if a planar set A has a difference set Δ(A) satisfying Δ(A) ? ?⁺ + s for suitable s then A has at most 3 elements. This result is motivated by the conjecture that the disk has no more than 3 orthogonal exponentials. Further, we prove that if A is a set of exponentials mutually orthogonal with respect to any symmetric convex set K in the plane with a smooth boundary and everywhere non-vanishing curvature, then #(A ∩ [?q, q]²) ≦ C(K) _q where C(K) is a constant depending only on K. This extends and clarifies in the plane the result of Iosevich and Rudnev. As a corollary, we obtain the result from [8] and [9] that if K is a centrally symmetric convex body with a smooth boundary and non-vanishing curvature, then L ²(K) does not possess an orthogonal basis of exponentials.     

Frank separation of two convex sets and Hahn-Banach theorem

First we give some elementary properties of the core of a subset relative to a linear subspace. Then we prove a theorem on the frank separation of two convex sets. This theorem admits as particular cases the known theorems on the frank separation and introduces new cases. Finally, we provide a very general version of the Hahn-Banach theorem in an analytic form.     

Suitable families of boxes and kernels of staircase starshaped sets in {\mathbb{R}^d}

Let S be an orthogonal polytope in ${\mathbb{R}^d}$ . There exists a suitable family ${\mathcal{C}}$ of boxes with ${S = \cup \{C : C {\rm in} \mathcal{C}\}}$ such that the following properties hold:

The staircase kernel Ker S is a union of boxes in ${\mathcal{C}}$ . Let ${\mathcal{V}}$ be the family of vertices of boxes in ${\mathcal{C}}$ , and let ${v_o\, \epsilon \mathcal{V}}$ . Point v _o belongs to Ker S if and only if v _o sees via staircase paths in S every point w in ${\mathcal{V}}$ . Moreover, these staircase paths may be selected to consist of edges of boxes in ${\mathcal{C}}$ . Let B be a box in ${\mathcal{C}}$ with vertices of B in Ker S. Box B lies in Ker S if and only if, for some b in rel int B and for every translate H of a coordinate hyperplane at ${b, b \epsilon}$ Ker (H ∩ S). For point p in S, p belongs to Ker S if and only if, for every x in S, there exist some p ? x geodesic λ (p, x) and some corresponding ${\mathcal{C}}$ - chain D containing λ (p, x) such that D is staircase starshaped at p.

     

Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets

A total dominating set of a graph is a set of vertices such that every vertex is adjacent to a vertex in the set. We show that given a graph of order n with minimum degree at least 2, one can add at most edges such that the resulting graph has two disjoint total dominating sets, and this bound is best possible.