Related papers: Packing d-dimensional balls into a d+1-dimensional…
We present algorithms for the $(1+\epsilon)$-approximate version of the closest vector problem for certain norms. The currently fastest algorithm (Dadush and Kun 2016) for general norms has running time of $2^{O(n)} (1/\epsilon)^n$. We…
We study the maximum weight convex polytope problem, in which the goal is to find a convex polytope maximizing the total weight of enclosed points. Prior to this work, the only known result for this problem was an $O(n^3)$ algorithm for the…
In this paper, we study the problem of computing a minimum-width axis-aligned cubic shell that encloses a given set of $n$ points in a three-dimensional space. A cubic shell is a closed volume between two concentric and face-parallel cubes.…
The dispersion of a point set $P\subset[0,1]^d$ is the volume of the largest box with sides parallel to the coordinate axes, which does not intersect $P$. Here, we show a construction of low-dispersion point sets, which can be deduced from…
We give the sharp lower bound of the volume product of three dimensional convex bodies which are invariant under a discrete subgroup of $O(3)$ in several cases. We also characterize the convex bodies with the minimal volume product in each…
We generalise Wesson's procedure, whereby vacuum $(4+1)-$dimensional field equations give rise to $(3+1)-$dimensional equations with sources, to arbitrary dimensions. We then employ this generalisation to relate the usual…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
In this paper, we study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+\varepsilon)$-approximation algorithm with $O(n+ 1/\varepsilon^{d-1})$…
G. Fejes T\'oth posed the following problem: Determine the infimum of the densities of the lattices of closed balls in $\bR^n$ such that each affine $k$-subspace $(0 \le k \le n-1)$ of $\bR^n$ intersects some ball of the lattice. We give a…
The goal of this paper is to present a lower bound for the Mahler volume of at least 4-dimensional symmetric convex bodies. We define a computable dimension dependent constant through a 2-dimensional variational (max-min) procedure and…
For every large enough $n$, we explicitly construct a body of constant width $2$ that has volume less than $0.9^n \text{Vol}(\mathbb{B}^{n}$), where $\mathbb{B}^{n}$ is the unit ball in $\mathbb{R}^{n}$. This answers a question of…
Geometrical objects with integral sides have attracted mathematicians for ages. For example, the problem to prove or to disprove the existence of a perfect box, that is, a rectangular parallelepiped with all edges, face diagonals and space…
We discuss the computational complexity of special cases of the 3-dimensional (axial) assignment problem where the elements are points in a Cartesian space and where the cost coefficients are the perimeters of the corresponding triangles…
Let $K \subset \mathbb R^n$ be a convex body with barycenter at the origin. We show there is a simplex $S \subset K$ having also barycenter at the origin such that $\left(\frac{vol(S)}{vol(K)}\right)^{1/n} \geq \frac{c}{\sqrt{n}},$ where…
A variant of the Falconer distance problem asks for fixed $k\geq 1$ and $d\geq k+1$, how large does the Hausdorff dimension of a Borel set $E\subset\mathbb{R}^d$ need to be to guarantee that there exist $x_0,\ldots,x_{k}\in E$ such that…
We consider the problem of estimating the distance between two bodies of volume $\varepsilon$ located inside a $n$-dimensional ball $U$ of unit volume for $n\to\infty$. Let $A$ be a closed set with a smooth boundary of the volume…
Cutting and packing problems are present in many, at first glance unconnected, areas, therefore it's beneficial to have a good understanding of their underlying structure, to select proper techniques for finding solutions. Cutting and…
We show that the minimum distance projection in the L1-norm from an interior point onto the boundary of a convex set is achieved by a single, unidimensional projection. Application of this characterization when the convex set is a…
We develop in a systematic fashion the idea of gauging 1d-space translations with fixed Newtonian time for nonrelativistic matter (particles and fields). By starting with a nonrelativistic free theory we obtain its minimal gauge invariant…
Denote by ${\mathcal K}^d$ the family of convex bodies in $E^d$ and by $w(C)$ the minimal width of $C \in {\mathcal K}^d$. We ask for the greatest number $\Lambda_n ({\mathcal K}^d)$ such that every $C \in {\mathcal K}^d$ contains a…