English
Related papers

Related papers: Distances from the vertices of a regular simplex

200 papers

Consider $n$ $d$-dimensional vectors with iid entries from a lattice distribution $X$. We show that the probability that all distances between them are equal is asymptotically \[ C_n\cdot\frac{1}{d^{(m-1)/2}} \quad \text{for} \quad d \to…

Probability · Mathematics 2025-02-06 Stefan Gerdjikov , Martin Minchev , Mladen Savov

For any sequence of matrix algebras that converge to a coadjoint orbit we give explicit formulas that show that the distances between the matrix algebras (viewed as quantum metric spaces) converges to 0. In the process we develop a general…

Operator Algebras · Mathematics 2011-12-13 Marc A. Rieffel

A finite set of distinct vectors $\mathcal{X}$ in the $d$-dimensional Euclidean space $\mathbb{R}^d$ is called a $2$-distance set, if the set of mutual distances between distinct elements of $\mathcal{X}$ has cardinality exactly $2$. In…

Metric Geometry · Mathematics 2018-06-21 Ferenc Szöllősi

A unit spherical Euclidean distance matrix (EDM) D is a matrix whose entries can be realized as the interpoint (squared) Euclidean distances of n points on a unit sphere. In this paper, given such a D and 1 \leq k < l \leq n, we present a…

Metric Geometry · Mathematics 2019-04-09 A. Y. Alfakih

A geometric $t$-spanner on a set of points in Euclidean space is a graph containing for every pair of points a path of length at most $t$ times the Euclidean distance between the points. Informally, a spanner is $\mathcal{O}(k)$-robust if…

Computational Geometry · Computer Science 2018-03-26 Kevin Buchin , Tim Hulshof , Dániel Oláh

If $\Sigma$ and $\Sigma'$ are homotopic embedded surfaces in a $4$-manifold then they may be related by a regular homotopy (at the expense of introducing double points) or by a sequence of stabilisations and destabilisations (at the expense…

Geometric Topology · Mathematics 2020-05-13 Oliver Singh

Let $\ell$ denote a positive integer. A connected graph $\G$ of diameter at least $\ell$ is said to be $\ell${\it -distance-balanced} whenever for any pair of vertices $u,v$ of $\G$ such that $d(u,v)=\ell$, the number of vertices closer to…

Combinatorics · Mathematics 2017-02-20 Stefko Miklavic , Primoz Sparl

Let $E \subset {\Bbb F}_q^d$, the $d$-dimensional vector space over a finite field with $q$ elements. Construct a graph, called the distance graph of $E$, by letting the vertices be the elements of $E$ and connect a pair of vertices…

Combinatorics · Mathematics 2014-06-03 M. Bennett , J. Chapman , D. Covert , D. Hart , A. Iosevich , J. Pakianathan

In this paper we show that the number of distinct distances determined by a set of $n$ points on a constant-degree two-dimensional algebraic variety $V$ (i.e., a surface) in $\mathbb R^3$ is at least $\Omega\left(n^{7/9}/{\rm polylog}…

Combinatorics · Mathematics 2016-04-07 Micha Sharir , Noam Solomon

With the help of Wick rotation over $p$-adic numbers $\mathbb{Q}_p$, the $p$-adic version of Euclidean $\textrm{dS}_2$ space(noted as $p\textrm{dS}_2$) is obtained based on $p\textrm{AdS}_2$($p$-adic version of Euclidean $\textrm{AdS}_2$…

High Energy Physics - Theory · Physics 2021-05-24 Feng Qu

The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…

Number Theory · Mathematics 2018-06-05 Bence Borda

Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we…

Combinatorics · Mathematics 2022-05-06 Stefan Steinerberger

The medial axis of a smoothly embedded surface in $\mathbb{R}^3$ consists of all points for which the Euclidean distance function on the surface has at least two minima. We generalize this notion to the mid-sphere axis, which consists of…

Computational Geometry · Computer Science 2025-04-22 Herbert Edelsbrunner , Elizabeth Stephenson , Martin Hafskjold Thoresen

We obtain nontrivial exponents for Erd\H os-Falconer type problems. Let $T_k(E)$ denote the set of distinct congruent $k$-dimensional simplexes determined by $(k+1)$-tuples of points from $E$. We prove that there exists $s_0(d)<d$ such…

Classical Analysis and ODEs · Mathematics 2016-05-13 A. Greenleaf , A. Iosevich , B. Liu , E. Palsson

Given an Euclidean space, this paper elucidates the topological link between the partial derivatives of the Minkowski functional associated to a set (assumed to be compact, convex, with a differentiable boundary and a non-empty interior)…

Differential Geometry · Mathematics 2024-07-18 Gustave Bainier , Benoit Marx , Jean-Christophe Ponsart

Let $G = (V_G,E_G)$ be a simple connected graph. The eccentric distance sum of $G$ is defined as $\xi^d(G)=\sum_{v \in V_G}\,\varepsilon_G(v)D_G(v),$ where $\varepsilon_G(v)$ is the eccentricity of the vertex $v$ and $D_G(v)=\sum_{u \in…

Combinatorics · Mathematics 2013-04-17 Shuchao Li , Yibing Song , Bing Wei

We explore variants of Erd\H os' unit distance problem concerning dot products between successive pairs of points chosen from a large finite subset of either $\mathbb F_q^d$ or $\mathbb Z_q^d,$ where $q$ is a power of an odd prime.…

Combinatorics · Mathematics 2021-09-22 Vincent Blevins , David Crosby , Ethan Lynch , Steven Senger

In this paper, we study a classical construction of lattices from number fields and obtain a series of new results about their minimum distance and other characteristics by introducing a new measure of algebraic numbers. In particular, we…

Number Theory · Mathematics 2017-03-08 Arturas Dubickas , Min Sha , Igor E. Shparlinski

A theorem of Mumford states that, on complex surfaces, any normal isolated singularity whose link is diffeomorphic to a sphere is actually a smooth point. While this property fails in higher dimensions, McLean asks whether the contact…

Algebraic Geometry · Mathematics 2017-01-24 Tommaso de Fernex , Yu-Chao Tu

We explore the question asking for graphs $G$ for which the total distance decreases, possibly by a fixed constant $k$, upon the removal of any of its vertices. We obtain results leading to intuition and doubts for the \v{S}olt\'es' problem…

Combinatorics · Mathematics 2024-06-06 Stijn Cambie