arXiv subjects
Publications and source records attributed to Boaz A. Slomka.
In this paper we deal with generalizations of the Mahler volume product for log-concave functions. We show that the polarity transform $\mathcal A$ can be rescaled so that the Mahler product it induces has upper and lower bounds of the same asymptotics. We discuss a similar result for the $\mathcal J$ transform. As an application, we extend the König-Milman duality of entropy result to the class of geometric log-concave functions.
We formulate a complex analog of the celebrated Levi-Hadwiger-Boltyanski illumination (or covering) conjecture for complex convex bodies in C^n, as well as its (non-comparable) fractional version. A key element in posing these problems is computing the classical and fractional illumination numbers of the complex analog of the hypercube, i.e., the polydisc. We prove that the illumination number of the polydisc in C^n is equal to 2^(n+1)-1 and that the fractional illumination number of the polydisc in C^n is 2^n. In addition, we verify both conjectures for the classes of complex zonotopes and zonoids.
In this paper we define and investigate a class of polytopes which we call "vertex generated" consisting of polytopes which are the average of their $0$ and $n$ dimensional faces. We show many results regarding this class, among them: that the class contains all zonotopes, that it is dense in dimension $n=2$, that any polytope can be summed with a zonotope so that the sum is in this class, and that a strong form of the celebrated "Maurey Lemma" holds for polytopes in this class. We introduce for every polytope a parameter which measures how far it is from being vertex-generated, and show that when this parameter is small, strong covering properties hold.
In this paper we explore questions regarding the Minkowski sum of the boundaries of convex sets. Motivated by a question suggested to us by V.~Milman regarding the volume of $\partial K+ \partial T$ where $K$ and $T$ are convex bodies, we prove sharp volumetric lower bounds for the Minkowski average of the boundaries of sets with connected boundary, as well as some related results.
We give an alternative proof for discrete Brunn-Minkowski type inequalities, recently obtained by Halikias, Klartag and the author. This proof also implies somewhat stronger weighted versions of these inequalities. Our approach generalizes ideas of Gozlan, Roberto, Samson and Tetali from the theory of measure transportation and provides new displacement convexity of entropy type inequalities for the lattice point enumerator.
A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most $N\left(n\right)$ of its translates. Despite continuous efforts, the best general upper bound known for this number remains as it was more than sixty years ago, of the order of ${2n \choose n}n\ln n$. In this note, we improve this bound by a sub-exponential factor. That is, we prove a bound of the order of ${2n \choose n}e^{-c\sqrt{n}}$ for some universal constant $c>0$. Our approach combines ideas from previous work by Artstein-Avidan and the second named author with tools from Asymptotic Geometric Analysis. One of the key steps is proving a new lower bound for the maximum volume of the intersection of a convex body $K$ with a translate of $-K$; in fact, we get the same lower bound for the volume of the intersection of $K$ and $-K$ when they both have barycenter at the origin. To do so, we make use of measure concentration, and in particular of thin-shell estimates for isotropic log-concave measures. Using the same ideas, we establish an exponentially better bound for $N\left(n\right)$ when restricting our attention to convex bodies that are $ψ_{2}$. By a slightly different approach, an exponential improvement is established also for classes of convex bodies with positive modulus of convexity.
We present an alternative, short proof of a recent discrete version of the Brunn-Minkowski inequality due to Lehec and the second named author. Our proof also yields the four functions theorem of Ahlswede and Daykin as well as some new variants.
We study a new construction of bodies from a given convex body in $\mathbb{R}^{n}$ which are isomorphic to (weighted) floating bodies. We establish several properties of this new construction, including its relation to $p$-affine surface areas. We show that these bodies are related to Ulam's long-standing floating body problem which asks whether Euclidean balls are the only bodies that can float, without turning, in any orientation.
Given a Borel measure $μ$ on ${\mathbb R}^{n}$, we define a convex set by \[ M(μ)=\bigcup_{\substack{0\le f\le1,\\ \int_{{\mathbb R}^{n}}f\,{\rm d}μ=1 } }\left\{ \int_{{\mathbb R}^{n}}yf\left(y\right)\,{\rm d}μ\left(y\right)\right\} , \] where the union is taken over all $μ$-measurable functions $f:{\mathbb R}^{n}\to\left[0,1\right]$ with $\int_{{\mathbb R}^{n}}f\,{\rm d}μ=1$. We study the properties of these measure-generated sets, and use them to investigate natural variations of problems of approximation of general convex bodies by polytopes with as few vertices as possible. In particular, we study an extension of the vertex index which was introduced by Bezdek and Litvak. As an application, we provide a lower bound for certain average norms of centroid bodies of non-degenerate probability measures.
We define covering and separation numbers for functions. We investigate their properties, and show that for some classes of functions there is exact equality of separation and covering. We provide analogues for various geometric inequalities on covering numbers, such as volume bounds, bounds connected with Hadwiger's conjecture, and inequalities about M-positions for geometric log-concave functions. In particular, we obtain strong versions of M-positions for geometric log-concave functions.
The fundamental theorem of affine geometry is a classical and useful result. For finite-dimensional real vector spaces, the theorem roughly states that a bijective self-mapping which maps lines to lines is affine. In this note we prove several generalizations of this result and of its classical projective counterpart. We show that under a significant geometric relaxation of the hypotheses, namely that only lines parallel to one of a fixed set of finitely many directions are mapped to lines, an injective mapping of the space must be of a very restricted polynomial form. We also prove that under mild additional conditions the mapping is forced to be affine-additive or affine-linear. For example, we show that five directions in three dimensional real space suffice to conclude affine-additivity. In the projective setting, we show that n+2 fixed projective points in real n-dimensional projective space , through which all projective lines that pass are mapped to projective lines, suffice to conclude projective-linearity.
We define new natural variants of the notions of weighted covering and separation numbers and discuss them in detail. We prove a strong duality relation between weighted covering and separation numbers and prove a few relations between the classical and weighted covering numbers, some of which hold true without convexity assumptions and for general metric spaces. As a consequence, together with some volume bounds that we discuss, we provide a bound for the famous Levi-Hadwiger problem concerning covering a convex body by homothetic slightly smaller copies of itself, in the case of centrally symmetric convex bodies, which is qualitatively the same as the best currently known bound. We also introduce the weighted notion of the Levi-Hadwiger covering problem, and settle the centrally-symmetric case, thus also confirm Naszódi's equivalent fractional illumination conjecture in the case of centrally symmetric convex bodies (including the characterization of the equality case, which was unknown so far).