Related papers: A quantitative program for Hadwiger's covering con…
We survey results on the problem of covering the space ${\mathbb R}^n$, or a convex body in it, by translates of a convex body. Our main goal is to present a diverse set of methods. A theorem of Rogers is a central result, according to…
We prove a functional version of the additive kinematic formula as an application of the Hadwiger theorem on convex functions together with a Kubota-type formula for mixed Monge-Amp\`ere measures. As an application, we give a new…
We prove bounds for the covering numbers of classes of convex functions and convex sets in Euclidean space. Previous results require the underlying convex functions or sets to be uniformly bounded. We relax this assumption and replace it…
In 1957, Hadwiger conjectured that every convex body in $\mathbb{R}^d$ can be covered by $2^d$ translates of its interior. For over 60 years, the best known bound was of the form $O(4^d \sqrt{d} \log d)$, but this was recently improved by a…
Computing the closed convex envelope or biconjugate is the core operation that bridges the domain of nonconvex with convex analysis. We focus here on computing the conjugate of a bivariate piecewise quadratic function defined over a…
We give a characterization of smooth, rotation and dually epi-translation invariant valuations and use this result to obtain a new proof of the Hadwiger theorem on convex functions. We also give a description of the construction of the…
We show that every $3$-dimensional convex body can be covered by $14$ smaller homothetic copies. The previous result was $16$ copies established by Papadoperakis in 1999, while a conjecture by Hadwiger is $8$. We modify Papadoperakis's…
Covering numbers of convex bodies based on homothetical copies and related illumination numbers are well-known in combinatorial geometry and, for example, related to Hadwiger's famous covering problem. Similar numbers can be defined by…
We consider the problem of approximating partition functions for Ising models. We make use of recent tools in combinatorial optimization: the Sherali-Adams and Lasserre convex programming hierarchies, in combination with variational methods…
In this paper we study certain variational aspects of the volume product functional restricted to the space of small projective deformations of a fixed convex body. In doing so, we provide a short proof of a theorem by Klartag: a strong…
Quadratic systems with lossless quadratic terms arise in many applications, including models of atmosphere and incompressible fluid flows. Such systems have a trapping region if all trajectories eventually converge to and stay within a…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…
In this work we survey four classic problems: Borsuk's partition problem, Tarski's plank problem, the Kneser--Poulsen problem on the monotonicity of the union of balls under a contraction of their centers, and the Hadwiger--Levi problem on…
Hadwiger's conjecture in convex geometry, formulated in 1957, states that every convex body in $\mathbb{R}^n$ can be covered by $2^n$ translations of its interior. Despite significant efforts, the best known bound related to this problem…
We revisit two NP-hard geometric partitioning problems - convex decomposition and surface approximation. Building on recent developments in geometric separators, we present quasi-polynomial time algorithms for these problems with improved…
Let $H_n$ be the minimal number such that any $n$-dimensional convex body can be covered by $H_n$ translates of interior of that body. Similarly $H_n^s$ is the corresponding quantity for symmetric bodies. It is possible to define $H_n$ and…
We study a few approaches to identify inclusion (up to a shift) between two convex bodies in ${\mathbb R}^n$. To this goal we use mixed volumes and fractional linear maps. We prove that inclusion may be identified by comparing volume or…
We use symplectic techniques to obtain partial results on Mahler's conjecture about the product of the volume of a convex body and the volume of its polar. We confirm the conjecture for hyperplane sections or projections of $\ell_p$-balls…
A conjecture is given that, if true, could lead to an algorithm for computing definite sums of rational functions.
This paper improves the algorithms based on supporting halfspaces and quadratic programming for convex set intersection problems in our earlier paper in several directions. First, we give conditions so that much smaller quadratic programs…