English
Related papers

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

200 papers

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…

Metric Geometry · Mathematics 2019-07-18 Daniel Galicer , Mariano Merzbacher , Damián Pinasco

We prove that random walks on a family of tilings of d-dimensional Euclidean space, with a canonical choice of conductances, converge to Brownian motion modulo time parameterization. This class of tilings includes Delaunay triangulations…

Probability · Mathematics 2025-08-29 Ahmed Bou-Rabee , Ewain Gwynne

Given a closed oriented manifold or more generally a group homology class, we introduce the spherical Plateau problem, which is a variational problem corresponding to a topological invariant called the spherical volume. In principle, its…

Differential Geometry · Mathematics 2025-04-09 Antoine Song

This paper deals with a variation of the classical isoperimetric problem in dimension $N\ge 2$ for a two-phase piecewise constant density whose discontinuity interface is a given hyperplane. We introduce a weighted perimeter functional with…

Differential Geometry · Mathematics 2020-11-10 Lorenzo Cavallina , Antoine Henrot , Shigeru Sakaguchi

We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…

Combinatorics · Mathematics 2024-04-24 Arnau Padrol , Eva Philippe , Francisco Santos

The classical double bubble theorem characterizes the minimizing partitions of $\mathbb{R}^n$ into three chambers, two of which have prescribed finite volume. In this paper we prove a variant of the double bubble theorem in which two of the…

Analysis of PDEs · Mathematics 2025-06-02 Lia Bronsard , Michael Novack

Consider a closed Riemannian $n$-manifold $M$ admitting a negatively curved Riemannian metric. We show that for every Riemannian metric on $M$ of sufficiently small volume, there is a point in the universal cover of $M$ such that the volume…

Differential Geometry · Mathematics 2020-06-02 Stéphane Sabourau

It is a well-known fact -- which can be shown by elementary calculus -- that the volume of the unit ball in $\mathbb{R}^n$ decays to zero and simultaneously gets concentrated on the thin shell near the boundary sphere as $n \nearrow…

History and Overview · Mathematics 2026-02-24 Siran Li

A model of simplicial quantum gravity in three dimensions is investigated numerically based on the technique of the dynamical triangulation (DT). We are concerned with the surfaces appearing on boundaries (i.e., sections) of…

High Energy Physics - Lattice · Physics 2009-10-30 H. S. Egawa , N. Tsuda

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…

Group Theory · Mathematics 2014-02-26 Mikhail Belolipetsky , Vincent Emery

Let the complexity of a closed manifold M be the minimal number of simplices in a triangulation of M. Such a quantity is clearly submultiplicative with respect to finite coverings, and by taking the infimum on all finite coverings of M…

Geometric Topology · Mathematics 2014-02-26 Stefano Francaviglia , Roberto Frigerio , Bruno Martelli

A minimal surface in a random environment (MSRE) is a $d$-dimensional surface in $(d+n)$-dimensional space which minimizes the sum of its elastic energy and its environment potential energy, subject to prescribed boundary values. Apart from…

Probability · Mathematics 2025-04-15 Barbara Dembin , Dor Elboim , Ron Peled

We present a systematic calculation of the volumes of compact manifolds which appear in physics: spheres, projective spaces, group manifolds and generalized flag manifolds. In each case we state what we believe is the most natural scale or…

Mathematical Physics · Physics 2009-11-07 Luis J. Boya , E. C. G. Sudarshan , Todd Tilma

Let $d \geq 2$. The Cheeger constant of a graph is the minimum surface-to-volume ratio of all subsets of the vertex set with relative volume at most 1/2. There are several ways to define surface and volume here: the simplest method is to…

Probability · Mathematics 2018-05-23 Tobias Müller , Mathew D. Penrose

This article deals with topological assumptions under which the minimal volume entropy of a closed manifold, and more generally of a finite simplicial complex, vanishes or is positive. In the first part of the article, we present…

Geometric Topology · Mathematics 2021-02-10 Ivan Babenko , Stephane Sabourau

We consider a volume maximization program to construct hyperbolic structures on triangulated 3-manifolds, for which previous progress has lead to consider angle assignments which do not correspond to a hyperbolic metric on each simplex. We…

Geometric Topology · Mathematics 2009-08-17 Feng Luo , Jean-Marc Schlenker

For any integers $n\geq 2$ and $1\leq r\leq n-1$ satisfying $3r\geq 2n-1$, we show that the expected volume fraction of a random degree $d$ complex submanifold of $\C\mathbb{P}^n$ of codimension $r$ where the bisectional holomorphic…

Probability · Mathematics 2024-12-04 Michele Ancona , Damien Gayet

This paper introduces a novel method for the efficient second-order accurate computation of normal fields from volume fractions on unstructured polyhedral meshes. Locally, i.e. in each mesh cell, an averaged normal is reconstructed by…

Numerical Analysis · Mathematics 2023-08-16 Johannes Kromer , Fabio Leotta , Dieter Bothe

The dimer problem arose in a thermodynamic study of diatomic molecules, and was abstracted into one of the most basic and natural problems in both statistical mechanics and combinatoric mathematics. Given a rectangular lattice of volume V…

Statistical Mechanics · Physics 2015-05-13 Paul Federbush

Let G = (V,E) be an n-vertex graph and M_d a d-vertex graph, for some constant d. Is M_d a subgraph of G? We consider this problem in a model where all n processes are connected to all other processes, and each message contains up to O(log…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-11-06 Danny Dolev , Christoph Lenzen , Shir Peled