Related papers: Random triangulations of the d-sphere with minimum…
We show that, the solutions of the isoperimetric problem for small volumes are $C^{2,\alpha}$-close to small spheres. On the way, we define a class of submanifolds called pseudo balls, defined by an equation weaker than constancy of mean…
We introduce and study a universal model of random geometry in two dimensions. To this end, we start from a discrete graph drawn on the sphere, which is chosen uniformly at random in a certain class of graphs with a given size $n$, for…
We study the $d$-dimensional Vector Bin Packing ($d$VBP) problem, a generalization of Bin Packing with central applications in resource allocation and scheduling. In $d$VBP, we are given a set of items, each of which is characterized by a…
In this survey article we will consider universal lower bounds on the volume of a Riemannian manifold, given in terms of the volume of lower dimensional objects (primarily the lengths of geodesics). By `universal' we mean without curvature…
We consider the volume of the largest axis-parallel box in the $d$-dimensional torus that contains no point of a given point set $\mathcal{P}_n$ with $n$ elements. We prove that, for all natural numbers $d, n$ and every point set…
In this article, we show that, for any compact 3-manifold, there is a $C^{1}$ volume-minimizing one-dimensional foliation. More generally, we show the existence of mass-minimizing rectifiable sections of sphere bundles without isolated…
Permutons, which are probability measures on the unit square $[0, 1]^2$ with uniform marginals, are the natural scaling limits for sequences of (random) permutations. We introduce a $d$-dimensional generalization of these measures for all…
The minimum spanning tree (MST) is a combinatorial optimization problem: given a connected graph with a real weight ("cost") on each edge, find the spanning tree that minimizes the sum of the total cost of the occupied edges. We consider…
We introduce the $k$-stellated spheres and consider the class ${\cal W}_k(d)$ of triangulated $d$-manifolds all whose vertex links are $k$-stellated, and its subclass ${\cal W}^{\ast}_k(d)$ consisting of the $(k+1)$-neighbourly members of…
The notion of the Urysohn $d$-width measures to what extent a metric space can be approximated by a $d$-dimensional simplicial complex. We investigate how local Urysohn width bounds on a riemannian manifold affect its global width. We bound…
We study the statistics of the number of connected components and the volume of a random real algebraic hypersurface in RP^n defined by a Real Bombieri-Weyl distributed homogeneous polynomial of degree d. We prove that the expectation of…
The $g$-vector of a simplicial complex contains a lot of information about the combinatorial and topological structure of that complex. Several classification results regarding the structure of normal pseudomanifolds and homology manifolds…
We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only…
We give the first nontrivial upper and lower bounds on the maximum volume of an empty axis-parallel box inside an axis-parallel unit hypercube in $\RR^d$ containing $n$ points. For a fixed $d$, we show that the maximum volume is of the…
This paper discusses the topic of dimensionality reduction for $k$-means clustering. We prove that any set of $n$ points in $d$ dimensions (rows in a matrix $A \in \RR^{n \times d}$) can be projected into $t = \Omega(k / \eps^2)$…
Products of simplices, called simplotopes, and their triangulations arise naturally in algorithmic applications in game theory and optimization. We develop techniques to derive lower bounds for the size of simplicial covers and…
Volume approximation is an important problem found in many applications of computer graphics, vision, and image processing. The problem is about computing an accurate and compact approximate representation of 3D volumes using some simple…
We construct $d$-dimensional pure simplicial complexes and pseudo-manifolds (without boundary) with $n$ vertices whose combinatorial diameter grows as $c_d n^{d-1}$ for a constant $c_d$ depending only on $d$, which is the maximum possible…
We investigate the minimum cost of a wide class of combinatorial optimization problems over random bipartite geometric graphs in $\mathbb{R}^d$ where the edge cost between two points is given by a $p$-th power of their Euclidean distance.…
Rudnick and Wigman (Ann. Henri Poincar\'{e}, 2008; arXiv:math-ph/0702081) conjectured that the variance of the volume of the nodal set of arithmetic random waves on the $d$-dimensional torus is $O(E/\mathcal{N})$, as $E\to\infty$, where $E$…