English
Related papers

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

200 papers

The minimal spherical cap dispersion ${\rm disp}_{\mathcal{C}}(n,d)$ is the largest number $\varepsilon\in (0,1]$ such that, for every $n$ points on the $d$-dimensional Euclidean unit sphere $\mathbb{S}^d$, there exists a spherical cap with…

Metric Geometry · Mathematics 2025-12-10 Alexander E. Litvak , Mathias Sonnleitner , Tomasz Szczepanski

Let $S$ be a $k$-colored (finite) set of $n$ points in $\mathbb{R}^d$, $d\geq 3$, in general position, that is, no {$(d + 1)$} points of $S$ lie in a common $(d - 1)$}-dimensional hyperplane. We count the number of empty monochromatic…

Combinatorics · Mathematics 2012-10-29 Oswin Aichholzer , Ruy Fabila-Monroy , Thomas Hackl , Clemens Huemer , Jorge Urrutia

Theorem A. Let $M^n$ denote a closed Riemannian manifold with nonpositive sectional curvature and let $\tilde M^n$ be the universal cover of $M^n$ with the lifted metric. Suppose that the universal cover $\tilde M^n$ contains no totally…

Differential Geometry · Mathematics 2009-02-16 Jianguo Cao , Xiaoyang Chen

We study the following basic machine learning task: Given a fixed set of $d$-dimensional input points for a linear regression problem, we wish to predict a hidden response value for each of the points. We can only afford to attain the…

Machine Learning · Computer Science 2018-06-07 Michał Dereziński , Manfred K. Warmuth

Pick a sequence of uniform points on the $d$-dimensional sphere. Then, link the $n$th point to its closest one that arrives in the past. This constructs a labelled tree called the nearest neighbour tree on the $d$-dimensional sphere. These…

Probability · Mathematics 2023-02-22 Jérôme Casse

We study the generic volume rigidity of $(d-1)$-dimensional simplicial complexes in $\mathbb R^{d-1}$, and show that the volume rigidity of a complex can be identified in terms of its exterior shifting. In addition, we establish the volume…

Combinatorics · Mathematics 2023-05-10 Denys Bulavka , Eran Nevo , Yuval Peled

We consider growing spheres seeded by random injection in time and space. Growth stops when two spheres meet leading eventually to a jammed state. We study the statistics of growth limited by packing theoretically in d dimensions and via…

Soft Condensed Matter · Physics 2007-05-23 Peter Sheridan Dodds , Joshua S. Weitz

Let $M_n$ be a simple triangulation of the sphere $S^2$, drawn uniformly at random from all such triangulations with n vertices. Endow $M_n$ with the uniform probability measure on its vertices. After rescaling graph distance on $V(M_n)$ by…

Probability · Mathematics 2016-01-20 Louigi Addario Berry , Marie Albenque

Let $M^d$ denote the $d$-dimensional Euclidean, hyperbolic, or spherical space. The $r$-dual set of given set in $M^d$ is the intersection of balls of radii $r$ centered at the points of the given set. In this paper we prove that for any…

Metric Geometry · Mathematics 2018-02-12 Karoly Bezdek

We compute the asymptotic expansion of the volume of small sub-Riemannian balls in a contact 3-dimensional manifold, and we express the first meaningful geometric coefficients in terms of geometric invariants of the sub-Riemannian structure

Differential Geometry · Mathematics 2018-12-05 Davide Barilari , Ivan Beschastnyi , Antonio Lerario

The degree of a map between orientable manifolds is a fundamental concept in topology, providing deep insights into the structure of manifolds and the behavior of maps between them. Recently, this notion has been extensively studied,…

Geometric Topology · Mathematics 2026-03-24 Biplab Basak , Raju Kumar Gupta , Ayushi Trivedi

We study the asymptotic behavior of least-squares cross-validation bandwidth selection in kernel density estimation on the $d$-dimensional hypersphere, $d\geq 1$. We show that the exact rate of convergence with respect to the optimal…

Statistics Theory · Mathematics 2026-01-29 José E. Chacón , Eduardo García-Portugués , Andrea Meilán-Vila

We study the scaling limit of essentially simple triangulations on the torus. We consider, for every $n\geq 1$, a uniformly random triangulation $G_n$ over the set of (appropriately rooted) essentially simple triangulations on the torus…

Discrete Mathematics · Computer Science 2019-05-07 Vincent Beffara , Cong Bang Huynh , Benjamin Lévêque

Let $\mathcal{X}$ be a complex projective manifold of dimension $n$ defined over the reals and let $M$ denote its real locus. We study the vanishing locus $Z\_{s\_d}$ in $M$ of a random real holomorphic section $s\_d$ of $\mathcal{E}…

Metric Geometry · Mathematics 2019-12-20 Thomas Letendre

We consider the minimum spanning tree problem on a weighted complete bipartite graph $K_{n_R, n_B}$ whose $n=n_R+n_B$ vertices are random, i.i.d. uniformly distributed points in the unit cube in $d$ dimensions and edge weights are the…

Probability · Mathematics 2021-07-20 Mario Correddu , Dario Trevisan

We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…

Combinatorics · Mathematics 2024-03-14 Dmitrii Zakharov

We review an approach which aims at studying discrete (pseudo-)manifolds in dimension $d\geq 2$ and called random tensor models. More specifically, we insist on generalizing the two-dimensional notion of $p$-angulations to higher…

Mathematical Physics · Physics 2016-07-26 Valentin Bonzom

Suppose we choose $N$ points uniformly randomly from a convex body in $d$ dimensions. How large must $N$ be, asymptotically with respect to $d$, so that the convex hull of the points is nearly as large as the convex body itself? It was…

Probability · Mathematics 2020-09-22 Alan Frieze , Wesley Pegden , Tomasz Tkocz

We address the following generalization $P$ of the Lowner-John ellipsoid problem. Given a (non necessarily convex) compact set $K\subset R^n$ and an even integer $d$, find an homogeneous polynomial $g$ of degree $d$ such that $K\subset…

Optimization and Control · Mathematics 2014-12-24 Jean-Bernard Lasserre

We determine the minimum number of vertices needed to provide balanced triangulations of $\mathbb S^{d-2}$-bundles over $\mathbb S^1$. If $d$ is odd and the bundle is orientable, or $d$ is even and the bundle is non-orientable, the minimum…

Combinatorics · Mathematics 2016-07-21 Hailun Zheng