No Arabic abstract
We show that for any compact convex set $K$ in $mathbb{R}^d$ and any finite family $mathcal{F}$ of convex sets in $mathbb{R}^d$, if the intersection of every sufficiently small subfamily of $mathcal{F}$ contains an isometric copy of $K$ of volume $1$, then the intersection of the whole family contains an isometric copy of $K$ scaled by a factor of $(1-varepsilon)$, where $varepsilon$ is positive and fixed in advance. Unless $K$ is very similar to a disk, the shrinking factor is unavoidable. We prove similar results for affine copies of $K$. We show how our results imply the existence of randomized algorithms that approximate the largest copy of $K$ that fits inside a given polytope $P$ whose expected runtime is linear on the number of facets of $P$.
A zone diagram is a relatively new concept which was first defined and studied by T. Asano, J. Matousek and T. Tokuyama. It can be interpreted as a state of equilibrium between several mutually hostile kingdoms. Formally, it is a fixed point of a certain mapping. These authors considered the Euclidean plane and proved the existence and uniqueness of zone diagrams there. In the present paper we generalize this concept in various ways. We consider general sites in m-spaces (a simple generalization of metric spaces) and prove several existence and (non)uniqueness results in this setting. In contrast to previous works, our (rather simple) proofs are based on purely order theoretic arguments. Many explicit examples are given, and some of them illustrate new phenomena which occur in the general case. We also re-interpret zone diagrams as a stable configuration in a certain combinatorial game, and provide an algorithm for finding this configuration in a particular case.
The classical 1966 theorem of Tverberg with its numerous variations was and still is a motivating force behind many important developments in convex and computational geometry as well as the testing ground for methods from equivariant algebraic topology. In 2018, Barany and Soberon presented a new variation, the Tverberg plus minus theorem. In this paper, we give a new proof of the Tverberg plus minus theorem, by using a projective transformation. The same tool allows us to derive plus minus analogues of all known affine Tverberg type results. In particular, we prove a plus minus analogue of the optimal colored Tverberg theorem.
Let $V$ be a Banach space where for fixed $n$, $1<n<dim(V)$, all of its $n$-dimensional subspaces are isometric. In 1932, Banach asked if under this hypothesis $V$ is necessarily a Hilbert space. Gromov, in 1967, answered it positively for even $n$ and all $V$. In this paper we give a positive answer for real $V$ and odd $n$ of the form $n=4k+1$, with the possible exception of $n=133.$ Our proof relies on a new characterization of ellipsoids in ${mathbb{R}}^n$, $ngeq 5$, as the only symmetric convex bodies all of whose linear hyperplane sections are linearly equivalent affine bodies of revolution.
We consider a general notion of snowflake of a metric space by composing the distance by a nontrivial concave function. We prove that a snowflake of a metric space $X$ isometrically embeds into some finite-dimensional normed space if and only if $X$ is finite. In the case of power functions we give a uniform bound on the cardinality of $X$ depending only on the power exponent and the dimension of the vector space.
We prove that if a framework of a graph is neighborhood affine rigid in $d$-dimensions (or has the stronger property of having an equilibrium stress matrix of rank $n-d-1$) then it has an affine flex (an affine, but non Euclidean, transform of space that preserves all of the edge lengths) if and only if the framework is ruled on a single quadric. This strengthens and also simplifies a related result by Alfakih. It also allows us to prove that the property of super stability is invariant with respect to projective transforms and also to the coning and slicing operations. Finally this allows us to unify some previous results on the Strong Arnold Property of matrices.