English
Related papers

Related papers: The maximum diameter of pure simplicial complexes …

200 papers

We consider the degree-diameter problem for Cayley graphs of dihedral groups. We find upper and lower bounds on the maximum number of vertices of such a graph with diameter 2 and degree $d$. We completely determine the asymptotic behaviour…

Combinatorics · Mathematics 2015-02-17 Grahame Erskine

In this paper, we present a new construction of simplicial complexes of subpolynomial degree with arbitrarily good local spectral expansion. Previously, the only known high-dimensional expanders (HDXs) with arbitrarily good expansion and…

Combinatorics · Mathematics 2023-12-27 Louis Golowich

The largest order $n(d,k)$ of a graph of maximum degree $d$ and diameter $k$ cannot exceed the Moore bound, which has the form $M(d,k)=d^k - O(d^{k-1})$ for $d\to\infty$ and any fixed $k$. Known results in finite geometries on generalised…

Combinatorics · Mathematics 2017-09-29 Martin Bachratý , Jana Šiagiová , Jozef Širáň

We consider a model of D-dimensional tethered manifold interacting by excluded volume in R^d with a single point. By use of intrinsic distance geometry, we first provide a rigorous definition of the analytic continuation of its perturbative…

High Energy Physics - Theory · Physics 2007-05-23 F. David , B. Duplantier , E. Guitter

The diameter of a directed graph is the maximum distance between any pair of vertices. We study a problem that generalizes \textsc{Oriented Diameter}: For a given directed graph and a positive integer $d$, what is the minimum number of arc…

Combinatorics · Mathematics 2025-07-18 Panna Gehér , Max Kölbl , Lydia Mirabel Mendoza-Cadena , Daniel P. Szabo

It is shown by Colding and Minicozzi the uniqueness of the tangent cone at infinity of Ricci-flat manifolds with Euclidean volume growth which has at least one tangent cone at infinity with a smooth cross section. In this article we raise…

Differential Geometry · Mathematics 2018-03-16 Kota Hattori

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…

Combinatorics · Mathematics 2022-10-04 Siqi Liu , Sidhanth Mohanty , Tselil Schramm , Elizabeth Yang

We prove a strong general-purpose bound for the diameter of a finite group depending only on the diameters of its composition factors and the maximal exponent of a normal abelian section. There are a number of notable applications: (1) if…

Group Theory · Mathematics 2026-04-21 Sean Eberhard , Elena Maini , Luca Sabatini , Gareth Tracey

In this paper, we study independent (Bernoulli) bond percolation in dimensions $d \ge 2$, focusing on the maximum diameter of finite clusters in the non-critical regime ($p\neq p_c$). We prove that the maximum diameter $R_n$ satisfies $R_n…

Probability · Mathematics 2026-01-22 Kaito Kobayashi

We show that the size of a minimal simplicial cover of a polytope $P$ is a lower bound for the size of a minimal triangulation of $P$, including ones with extra vertices. We then use this fact to study minimal triangulations of cubes, and…

Combinatorics · Mathematics 2007-05-23 Adam Bliss , Francis Edward Su

We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…

Combinatorics · Mathematics 2022-09-16 Hariharan Narayanan , Rikhav Shah , Nikhil Srivastava

We show that, for every set of $n$ points in the $d$-dimensional unit cube, there is an empty axis-parallel box of volume at least $\Omega(d/n)$ as $n\to\infty$ and $d$ is fixed. In the opposite direction, we give a construction without an…

Combinatorics · Mathematics 2021-02-26 Boris Bukh , Ting-Wei Chao

We study the complexity of geometric problems on spaces of low fractal dimension. It was recently shown by [Sidiropoulos & Sridhar, SoCG 2017] that several problems admit improved solutions when the input is a pointset in Euclidean space…

Computational Complexity · Computer Science 2017-12-14 Anastasios Sidiropoulos , Kritika Singhal , Vijay Sridhar

We construct a family of examples of complete $(2+n)-$dimensional ($n\ge 2$) open manifolds with positive Ricci curvature, sectional curvature bounded from below and infinite Betti numbers $b_2,b_n$, moreover its volume growth can be…

Differential Geometry · Mathematics 2025-05-28 Huihong Jiang

Let $C$ be a binary code of length $n$ with distances $0<d_1<\cdots<d_s\le n$. In this note we prove a general upper bound on the size of $C$ without any restriction on the distances $d_i$. The bound is asymptotically optimal.

Combinatorics · Mathematics 2025-03-13 Ivan Landjev , Konstantin Vorobev

For each dimension $d$, $d$-dimensional integral simplices with exactly one interior integral point have bounded volume. This was first shown by Hensley. Explicit volume bounds were determined by Hensley, Lagarias and Ziegler, Pikhurko, and…

Combinatorics · Mathematics 2014-12-16 Gennadiy Averkov , Jan Krümpelmann , Benjamin Nill

We extend the results previously published on exact packing dimensions of random recursive constructions to include constructions satisfying commonly occurring conditions. We remove the restrictive assumption that the diameter reduction…

Metric Geometry · Mathematics 2016-08-02 Artemi Berlinkov

This paper develops a technique for applying one-parameter prescribed mean curvature min-max theory in certain non-compact manifolds. We give two main applications. First, fix a dimension $3\le n+1 \le 7$ and consider a smooth function…

Differential Geometry · Mathematics 2022-04-18 Liam Mazurowski

We give the maximal distance between a copula and itself when the argument is permuted for arbitrary dimension, generalizing a result for dimension two by Nelsen (2007), Klement and Mesiar (2006). Furthermore, we establish a subset of…

Statistics Theory · Mathematics 2013-11-25 Michael Harder , Ulrich Stadtmüller

We prove the following: For $\epsilon>0$, let $D_\epsilon$ be the bounded strictly pseudoconvex domain in $\mathbb C^2$ given by \begin{equation*} (\log|z|)^2+(\log|w|)^2<\epsilon^2. \end{equation*} The boundary $M_\epsilon:=\partial…

Complex Variables · Mathematics 2018-08-14 Peter Ebenfelt , Duong Ngoc Son , Dmitri Zaitsev
‹ Prev 1 8 9 10 Next ›