Related papers: Random triangulations of the d-sphere with minimum…

We show that in any $d$-dimensional real normed space, unit balls can be packed with density at least \[\frac{(1-o(1))d\log d}{2^{d+1}},\] improving a result of Schmidt from 1958 by a logarithmic factor and generalizing the recent result of…

Consider a random geometric 2-dimensional simplicial complex $X$ sampled as follows: first, sample $n$ vectors $\boldsymbol{u_1},\ldots,\boldsymbol{u_n}$ uniformly at random on $\mathbb{S}^{d-1}$; then, for each triple $i,j,k \in [n]$, add…

The densest local packings of N identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained using a nonlinear programming method operating in conjunction with a stochastic search of…

We provide a detailed proof of the following folklore theorem: Let mu > 0 be a Margulis constant for 3-dimensional hyperbolic space. Then for any d>0 there exists a constant K>0, depending on mu and d, so that for any complete finite volume…

Methodology is provided towards the solution of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the d-dimensional Euclidean…

For $d\in\mathbb{N}$, a compact sphere packing of Euclidean space $\mathbb{R}^{d}$ is a set of spheres in $\mathbb{R}^{d}$ with disjoint interiors so that the contact hypergraph of the packing is the vertex scheme of a homogeneous…

Studies of random close packing of spheres have advanced our knowledge about the structure of systems such as liquids, glasses, emulsions, granular media, and amorphous solids. When these systems are confined their structural properties…

This paper provides triangular spherical designs for the complex unit sphere $\Omega^d$ by exploiting the natural correspondence between the complex unit sphere in $d$ dimensions and the real unit sphere in $2d-1$. The existence of…

Irreversible adsorption of spheres on flat collectors having dimension $d<2$ is studied. Molecules are adsorbed on Sierpinski's Triangle and Carpet like fractals ($1<d<2$), and on General Cantor Set ($d<1$). Adsorption process is modeled…

For every fixed dimension $d$ and sufficiently large $n$, we determine the maximum possible diameter of a strongly connected $d$-dimensional simplicial complex on $n$ vertices. This improves on a sequence of previous results and settles a…

We derive a lower bound on the smallest singular value of a random $d$-regular matrix, that is, the adjacency matrix of a random $d$-regular directed graph. More precisely, let $C_1<d< c_1 n/\log^2 n$ and let $\mathcal{M}_{n,d}$ be the set…

Let M be a hyperbolic n-manifold whose cusps have torus cross-sections. In arXiv:0901.0056, the authors constructed a variety of nonpositively and negatively curved spaces as "2\pi-fillings" of M by replacing the cusps of M with compact…

Given $d\in \mathbb{Z}_{\geq 2}$, for every $\kappa=(k_1,\dots,k_n) \in \mathbb{Z}^{n}$ such that $k_i\geq 1-d$ and $k_1+\dots+k_n=-2d$, denote by $\Omega^d\mathcal{M}_{0,n}(\kappa)$ and $\mathbb{P}\Omega^d\mathcal{M}_{0,n}(\kappa)$ the…

Let $T$ be the triangle in the plane with vertices $(0, 0)$, $(0,1)$ and $(0, 1)$. The convex hull $T_n$ of points $(0, 1)$, $(1, 0)$ and $n$ independent random points uniformly distributed in $T$ is the random convex chain. In this paper…

Pick $d+1$ points uniformly at random on the unit sphere in $\mathbb R^d$. What is the expected value of the angle sum of the simplex spanned by these points? Choose $n$ points uniformly at random in the $d$-dimensional ball. What is the…

We prove that in any finite set of $\mathbb Z^d$ with $d\ge 3$, there is a subset whose capacity and volume are both of the same order as the capacity of the initial set. As an application we obtain estimates on the probability of {\it…

The random packing fraction of binary particles in D-dimensional Euclidean space R^D is studied using a geometric approach. First, the binary packing fraction of assemblies with small size difference are studied, using the excluded volume…

The maximum volume $j$-simplex problem asks to compute the $j$-dimensional simplex of maximum volume inside the convex hull of a given set of $n$ points in $\mathbb{Q}^d$. We give a deterministic approximation algorithm for this problem…

For every $n\ge 2$, we construct a body $U_n$ of constant width $2$ in $\mathbb{E}^n$ with small volume and symmetries of a regular $n$-simplex. $U_2$ is the Reuleaux triangle. To the best of our knowledge, $U_3$ was not previously…

For a fixed $k\in\{1,\dots,d\}$ consider random vectors $X_0,\dots, X_{k}\in\mathbb R^d$ with an arbitrary spherically symmetric joint density function. Let $A$ be any non-singular $d\times d$ matrix. We show that the $k$-dimensional volume…