Related papers: Fixing and almost fixing a planar convex body

Recall that a convex body $K$ is in John's position if the unit Euclidean ball is the maximal volume ellipsoid contained in $K$. Approximating convex body in John's position by polytopes we obtain the following results. 1. Let $n>R_n\ge 1$…

For all $p>1$ and all centrally symmetric convex bodies $K\subset \mathbb{R}^d$ define $Mf$ as the centered maximal function associated to $K$. We show that when $d=1$ or $d=2$, we have $||Mf||_p\ge (1+\epsilon(p,K))||f||_p$. For $d\ge 3$,…

The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by k.

It is proved that every convex body in the plane has a point such that the union of the body and its image under reflection in the point is convex. If the body is not centrally symmetric, then it has, in fact, three affinely independent…

Central configurations play a fundamental role in the Newtonian $n$-body problem, as they give rise to motions in which the configuration evolves while preserving its shape up to rotation and scaling. These include relative equilibria,…

Finite unions of convex sets are a central object of study in discrete and computational geometry. In this paper we initiate a systematic study of complements of such unions -- i.e., sets of the form $S=\mathbb{R}^d \setminus (\cup_{i=1}^n…

The concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times. The local crossing number of a graph is the…

A pair of subsets of Euclidean space which nearly achieves equality in the Brunn-Minkowski inequality must nearly coincide with a pair of homothetic convex sets. The two-dimensional case was treated in a previous paper in this series by an…

In 1951, Bang posed the affine plank conjecture, which remains open: If a convex body in $\mathbb{R}^d$ is covered by planks, then the total relative width of the planks is at least one. We prove a lower bound of $2/(1+\sqrt{d})$ for this…

In a spherically complete ultrametric space, a strictly contracting mapping has a fixed point. We indicate in this paper how this fixed point can either be reached or approximated.

Coverings of convex bodies have emerged as a central component in the design of efficient solutions to approximation problems involving convex bodies. Intuitively, given a convex body $K$ and $\epsilon> 0$, a covering is a collection of…

We prove that there exists an absolute constant $\alpha >1$ with the following property: if $K$ is a convex body in ${\mathbb R}^n$ whose center of mass is at the origin, then a random subset $X\subset K$ of cardinality ${\rm…

We consider the problem of lower bounding a generalized Minkowski measure of subsets of a convex body with a log-concave probability measure, conditioned on the set size. A bound is given in terms of diameter and set size, which is sharp…

Given a convex set and an interior point close to the boundary, we prove the existence of a supporting hyperplane whose distance to the point is controlled, in a dimensionally quantified way, by the thickness of the convex set in the…

Let $K$ and $K_0$ be convex bodies in $\mathbb{R}^d$, such that $K$ contains the origin, and define the process $(K_n, p_n)$, $n \geq 0$, as follows: let $p_{n+1}$ be a uniform random point in $K_n$, and set $K_{n+1} = K_n \cap (p_{n+1} +…

We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…

A natural model for the approximation of a convex body $K$ in $\mathbb{R}^d$ by random polytopes is obtained as follows. Take a stationary Poisson hyperplane process in the space, and consider the random polytope $Z_K$ defined as the…

The covariogram of a compact set A contained in R^n is the function that to each x in R^n associates the volume of A intersected with (A+x). Recently it has been proved that the covariogram determines any planar convex body, in the class of…

A generalization of pairwise intersecting Minkowski arrangement of centrally symmetric convex bodies is the pairwise intersecting Minkowski arrangement of order $\mu$. Here, the homothetic copies of a centrally symmetric convex body are so…

Let $K$ be a convex body (a non-empty compact convex set) in $n$-dimensional Euclidean space. A set $B$ is called a barrier (or an `opaque set') for $K$ if every line that intersects $K$, also intersects $B$. Although this concept was…