English
Related papers

Related papers: A note on the distinct distances problem over fini…

200 papers

In this short note we give a new upper bound for the size of a set family with a single Hamming distance. Our proof is an application of the linear algebra bound method.

Combinatorics · Mathematics 2024-09-28 Gábor Hegedüs

Defining distances over finite fields formally by $||x-y||:=(x_1-y_1)^2+\cdots + (x_d-y_d)^2$ for $x,y\in \mathbb{F}_q^d$, distance problems naturally arise in analogy to those studied by Erd\H{o}s and Falconer in Euclidean space. Given a…

Combinatorics · Mathematics 2024-08-21 Esen Aksoy , Alex Iosevich , Brian McDonald

The binary divergences that are divergences between probability measures defined on the same 2-point set have an interesting property. For the chi-squared divergence and the relative entropy, it is known that their binary divergence attain…

Information Theory · Computer Science 2021-02-09 Tomohiro Nishiyama

Let f(t,X) be an irreducible polynomial over the field of rational functions k(t), where k is a number field. Let O be the ring of integers of k. Hilbert's irreducibility theorem gives infinitely many integral specializations of t to values…

Number Theory · Mathematics 2019-07-30 Peter Müller

We study distributed protocols for finding all pairs of similar vectors in a large dataset. Our results pertain to a variety of discrete metrics, and we give concrete instantiations for Hamming distance. In particular, we give improved…

Data Structures and Algorithms · Computer Science 2016-11-16 Paul Beame , Cyrus Rashtchian

The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less well known is Erd\H{o}s' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear…

Computational Geometry · Computer Science 2022-06-14 Henry L. Fleischmann , Sergei V. Konyagin , Steven J. Miller , Eyvindur A. Palsson , Ethan Pesikoff , Charles Wolf

In this paper, using the compression method, we recover the lower bound for the Erd\H{o}s unit distance problem and provide an alternative proof to the distinct distance conjecture. In particular, in $\mathbb{R}^k$ for all $k\geq 2$, we…

Metric Geometry · Mathematics 2026-05-07 Theophilus Agama

In certain circumstances, the uncertainty, $\Delta S [\phi]$, of a quantum observable, $S$, can be bounded from below by a finite overall constant $\Delta S>0$, \emph{i.e.}, $\Delta S [\phi] \geq \Delta S$, for all physical states $\phi$.…

Quantum Physics · Physics 2015-08-25 R. T. W. Martin , A. Kempf

In this paper, we derive a tight upper bound for the size of an intersecting $k$-Sperner family of subspaces of the $n$-dimensional vector space $\mathbb{F}_{q}^{n}$ over finite field $\mathbb{F}_{q}$ which gives a $q$-analogue of the…

Combinatorics · Mathematics 2024-05-01 Jiuqiang Liu , Guihai Yu , Lihua Feng , Yongtao Li

We prove a special case of Erd\H{o}s' unit distance problem using a corollary of the subspace theorem bounding the number of solutions of linear equations from a multiplicative group. We restrict our attention to unit distances coming from…

Combinatorics · Mathematics 2012-11-30 Ryan Schwartz

We study the distance set problem for pairs of compact sets $A, B\subset \mathbb{R}^n$, $n\geq 2$. We show that if $B$ is contained in a hyperplane and \begin{align*} \dim_{H} A+\dim_{H} B>n, \end{align*} then the distance set $…

Classical Analysis and ODEs · Mathematics 2026-03-02 Minh-Quy Pham

Let $D$ denote the distance matrix for an $n+1$ point metric space $(X,d)$. In the case that $X$ is an unweighted metric tree, the sum of the entries in $D^{-1}$ is always equal to $2/n$. Such trees can be considered as affinely independent…

Metric Geometry · Mathematics 2023-05-29 Ian Doust , Reinhard Wolf

In this paper, we prove that a set of $N$ points in ${\bf R}^2$ has at least $c{N \over \log N}$ distinct distances, thus obtaining the sharp exponent in a problem of Erd\"os. We follow the set-up of Elekes and Sharir which, in the spirit…

Combinatorics · Mathematics 2011-06-29 Larry Guth , Nets Hawk Katz

A finite set X in a metric space M is called an s-distance set if the set of distances between any two distinct points of X has size s. The main problem for s-distance sets is to determine the maximum cardinality of s-distance sets for…

Combinatorics · Mathematics 2011-08-24 Oleg R. Musin , Hiroshi Nozaki

Given a locally compact, complete metric space $({\rm X},{\sf D})$ and an open set $\Omega\subseteq{\rm X}$, we study the class of length distances $\sf d$ on $\Omega$ that are bounded from above and below by fixed multiples of the ambient…

Metric Geometry · Mathematics 2023-05-05 Fares Essebei , Enrico Pasqualetto

If one thinks of a Riemannian metric, $g_1$, analogously as the gradient of the corresponding distance function, $d_1$, with respect to a background Riemannian metric, $g_0$, then a natural question arises as to whether a corresponding…

Differential Geometry · Mathematics 2023-06-06 Brian Allen , Edward Bryden

In 1967, Schmidt wrote a seminal paper [10] on heights of subspaces of R n or C n defined over a number field K, and diophantine approximation problems. The going-down Theorem -- one of the main theorems he proved in his paper -- remains…

Number Theory · Mathematics 2017-09-18 Anthony Poels

The classical problem of whether $m$th-powers with or without zero in a finite field $\mathbb{F}_q$ form a difference set has been extensively studied, and is related to many topics, such as flag transitive finite projective planes. In this…

Combinatorics · Mathematics 2017-07-05 Binzhou Xia

For $ E\subset \mathbb{F}_q^d$, let $\Delta(E)$ denote the distance set determined by pairs of points in $E$. By using additive energies of sets on a paraboloid, Koh, Pham, Shen, and Vinh (2020) proved that if $E,F\subset \mathbb{F}_q^d $…

Number Theory · Mathematics 2020-08-20 Daewoong Cheong , Doowon Koh , Thang Pham

We study a family of variants of Erd\H os' unit distance problem, concerning distances and dot products between pairs of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, we look for…

Combinatorics · Mathematics 2020-12-01 Slade Gunter , Eyvi Palsson , Ben Rhodes , Steven Senger