English
Related papers

Related papers: Additive structures imply more distances in $\math…

200 papers

The Falconer conjecture asserts that if E is a planar set with Hausdorff dimension strictly greater than 1, then its Euclidean distance set has positive one-dimensional Lebesgue measure. We discuss the analogous question with the Euclidean…

Metric Geometry · Mathematics 2007-05-23 Sergei Konyagin , Izabella Laba

Let $q,d\geq 2$ be integers. Define $$ J(q,d):=\frac 1q \Big( \min_{0<x<1} \frac{1-x^q}{1-x} x^{-\frac{q-1}{d}}\Big). $$ Let $\mbox{$\cal G$}\subseteq {\mathbb R}^n$ be an arbitrary subset. We denote by $d(\mbox{$\cal G$})$ the set of…

Combinatorics · Mathematics 2018-12-31 Gábor Hegedüs

We introduce a closed-form expansion for the transition density of elliptic and hypo-elliptic multivariate Stochastic Differential Equations (SDEs), over a period $\Delta\in (0,1)$, in terms of powers of $\Delta^{j/2}$, $j\ge 0$. Our…

Numerical Analysis · Mathematics 2025-09-17 Yuga Iguchi , Alexandros Beskos

A homogeneous set of $n$ points in the $d$-dimensional Euclidean space determines at least $\Omega(n^{2d/(d^2+1)} / \log^{c(d)} n)$ distinct distances for a constant $c(d)>0$. In three-space, we slightly improve our general bound and show…

Combinatorics · Mathematics 2013-12-17 J. Solymosi , Cs. D. Toth

It was recently found that there are very close connections between the existence of additive spanners (subgraphs where all distances are preserved up to an additive stretch), distance preservers (subgraphs in which demand pairs have their…

Data Structures and Algorithms · Computer Science 2016-07-21 Eden Chlamtáč , Michael Dinitz , Guy Kortsarz , Bundit Laekhanukit

Let $X$ be a finite set in the Euclidean space $\mathbb{R}^d$. If the squared distance between any two distinct points in $X$ is an odd integer, then the cardinality of $X$ is bounded above by $d+2$, as shown by Rosenfeld (1997) or Smith…

Combinatorics · Mathematics 2025-07-08 Hiroshi Nozaki

Let $S$ be a set of $n$ points in Euclidean $3$-space. Assign to each $x\in S$ a distance $r(x)>0$, and let $e_r(x,S)$ denote the number of points in $S$ at distance $r(x)$ from $x$. Avis, Erd\H{o}s and Pach (1988) introduced the extremal…

Combinatorics · Mathematics 2019-07-22 Konrad J. Swanepoel

The scheme for construction of distances, presented in the previous paper quant-ph/0005087, v.1 (Ref. 1) is amended. The formulation of Proposition 1 of Ref. 1 does not ensure the triangle inequality, therefore some of the functionals…

Quantum Physics · Physics 2007-05-23 D. A. Trifonov

In this paper we study the generalized Erdos-Falconer distance problems in the finite field setting. The generalized distances are defined in terms of polynomials, and various formulas for sizes of distance sets are obtained. In particular,…

Classical Analysis and ODEs · Mathematics 2010-04-26 Doowon Koh , Chun-Yen Shen

A regular linear line complex is a three-parameter set of lines in space, whose Pl\"ucker vectors lie in a hyperplane, which is not tangent to the Klein quadric. Our main result is a bound $O(n^{1/2}m^{3/4} + m+n)$ for the number of…

Combinatorics · Mathematics 2021-07-01 Misha Rudnev

This paper introduces the extended set difference, a generalization of the Hukuhara and generalized Hukuhara differences, defined for compact convex sets in $\mathbb{R}^d$. The proposed difference guarantees existence for any pair of such…

Optimization and Control · Mathematics 2025-10-01 Arie Beresteanu , Behrooz Moosavi Ramezanzadeh

This paper provides a pedagogical introduction to the physics of extra dimensions focussing on the ADD, Randall-Sundrum and DGP models. In each of these models, the familiar particles and fields of the standard model are assumed to be…

General Relativity and Quantum Cosmology · Physics 2018-01-03 Katherine Jones-Smith , Harsh Mathur , Michael Verostek

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…

Combinatorics · Mathematics 2018-02-20 Alex Iosevich , Hans Parshall

We first describe a reduction from the problem of lower-bounding the number of distinct distances determined by a set $S$ of $s$ points in the plane to an incidence problem between points and a certain class of helices (or parabolas) in…

Computational Geometry · Computer Science 2010-05-07 György Elekes , Micha Sharir

Motivated by ideas from the model theory of metric structures, we introduce a metric set theory, $\mathsf{MSE}$, which takes bounded quantification as primitive and consists of a natural metric extensionality axiom (the distance between two…

Logic · Mathematics 2023-02-07 James Hanson

We prove the existence of similar and multi-similar point configurations (or simplexes) in sets of fractional Hausdorff measure in Euclidean space. These results can be viewed as variants, for thin sets, of theorems for sets of positive…

Classical Analysis and ODEs · Mathematics 2021-04-28 Allan Greenleaf , Alex Iosevich , Sevak Mkrtchyan

Let $\mathbb{F}_q$ denote the finite field of $q$ elements. For $E \subset \mathbb{F}_q^d$, denote the distance set $\Delta(E)= \{\|x-y\|^2:=(x_1-y_1)^2+ \cdots + (x_d-y_d)^2 : (x,y)\in E^2 \}$. The Erdos quotient set problem was introduced…

Combinatorics · Mathematics 2024-02-28 Will Burstein

Given two points $p,q$ in the real plane, the signed area of the rectangle with the diagonal $[pq]$ equals the square of the Minkowski distance between the points $p,q$. We prove that $N>1$ points in the Minkowski plane $\R^{1,1}$ generate…

Combinatorics · Mathematics 2013-03-18 Oliver Roche-Newton , Misha Rudnev

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

Let $G$ be an unweighted $n$-node undirected graph. A \emph{$\beta$-additive spanner} of $G$ is a spanning subgraph $H$ of $G$ such that distances in $H$ are stretched at most by an additive term $\beta$ w.r.t. the corresponding distances…

Data Structures and Algorithms · Computer Science 2015-07-03 Davide Bilò , Fabrizio Grandoni , Luciano Gualà , Stefano Leucci , Guido Proietti