Related papers: Maximal Volume Ideal Polyhedra and the Arithmetic …
We investigate the asymptotic best approximation of a smooth, strictly convex body $K$ in $\mathbb{R}^d$ by inscribed polytopes with a restricted number of vertices under the intrinsic volume difference. We prove rigidity phenomena in both…
The aim of this paper is to study asymptotic geometric properties almost surely or/and in probability of extreme order statistics of an i.i.d. random field (potential) indexed by sites of multidimensional lattice cube, the volume of which…
A ball polyhedron is a finite intersection of congruent balls in $\mathbb{R}^3$. These shapes arise in various contexts in discrete and convex geometry. We focus on Reuleaux polyhedra, the subclass of ball polyhedra whose centers and…
We determine the minimal volume of arithmetic hyperbolic orientable n-dimensional orbifolds (compact and non-compact) for every odd dimension n>3. Combined with the previously known results it solves the minimal volume problem for…
We consider a shape optimization problem for the persistence threshold of a biological species dispersing in a periodically fragmented environment, the unknown shape corresponding to the portion of the habitat which is favorable to the…
We are interested in the fast computation of the exact value of integrals of polynomial functions over convex polyhedra. We present speed ups and extensions of the algorithms presented in previous work. We present the new software…
Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints…
We study the problem of finding the Lowner-John ellipsoid, i.e., an ellipsoid with minimum volume that contains a given convex set. We reformulate the problem as a generalized copositive program, and use that reformulation to derive…
The approximability of a convex body is a number which measures the difficulty to approximate that body by polytopes. We prove that twice the approximability is equal to the volume entropy for a Hilbert geometry in dimension two end three…
We prove a discrete analogue to a classical isoperimetric theorem of Weil for surfaces with non-positive curvature. It is shown that hexagons in the triangular lattice have maximal volume among all sets of a given boundary in any…
We provide two algorithms for computing the volume of a convex polytope with half-space representation {x>=0; Ax <=b} for some (m,n) matrix A and some m-vector b. Both algorithms have a O(n^m) computational complexity which makes them…
We characterize the volume entropy of an arbitrary regular building as the topological pressure of the geodesic flow on an apartment. We show that the Liouville measure is not entropy maximizing measure for regular hyperbolic buildings. As…
In his paper "On the Schlafli differential equality", J. Milnor conjectured that the volume of n-dimensional hyperbolic and spherical simplices, as a function of the dihedral angles, extends continuously to the closure of the space of…
The geometry of the dual amplituhedron is generally described in reference to a particular triangulation. A given triangulation manifests only certain aspects of the underlying space while obscuring others, therefore understanding this…
Let $K$ be a $d$ dimensional convex body with a twice continuously differentiable boundary and everywhere positive Gauss-Kronecker curvature. Denote by $K_n$ the convex hull of $n$ points chosen randomly and independently from $K$ according…
The intrinsic volumes of a convex cone are geometric functionals that return basic structural information about the cone. Recent research has demonstrated that conic intrinsic volumes are valuable for understanding the behavior of random…
Volumetry is one of the principal downstream applications of 3D medical image segmentation, for example, to detect abnormal tissue growth or for surgery planning. Conformal Prediction is a promising framework for uncertainty quantification,…
We study the problem of learning a high-density region of an arbitrary distribution over $\mathbb{R}^d$. Given a target coverage parameter $\delta$, and sample access to an arbitrary distribution $D$, we want to output a confidence set $S…
We present an efficient framework for solving algebraically-constrained global non-convex polynomial optimization problems over subsets of the hypercube. We prove the existence of an equivalent nonlinear reformulation of such problems that…
This work puts forward a form finding problem of designing a least-volume vault that is a surface structure spanning over a plane region, which via pure compression transfers a vertically tracking load to the supporting boundary. Through a…