English
Related papers

Related papers: Distribution of distances in positive characterist…

200 papers

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

Metric Geometry · Mathematics 2022-03-23 Brett Leroux , Luis Rademacher

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

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

Analogously to primes in arithmetic progressions to large moduli, we can study primes that are totally split in extensions of $\mathbb{Q}$ of high degree. Motivated by a question of Kowalski we focus on the extensions $\mathbb{Q}(E[d])$…

Number Theory · Mathematics 2021-10-04 Jori Merikoski

The {\em bottleneck distance} is a natural measure of the distance between two finite point sets of equal cardinality, defined as the minimum over all bijections between the point sets of the maximum distance between any pair of points put…

Computational Geometry · Computer Science 2021-05-06 Brendan Mumey

Let $G$ be a finite group acting on a vector space $V = \mathbb{F}_p^n$ over a prime field. Given finite sets $S \subset G$ and $E \subset V$, we study the restricted orbit union $S(E) = \bigcup_{g\in S} g(E)$ and establish quantitative…

Combinatorics · Mathematics 2026-02-10 Norbert Hegyvári , Le Quang Hung , Alex Iosevich , Thang Pham

We prove that for $d\ge 2,\, k\ge 2$, if the Hausdorff dimension of a compact set $E\subset \mathbb{R}^d$ is greater than $\frac{d^2}{2d-1}$, then, for any given $r > 0$, there exist $(x^1, \dots, x^{k+1})\in E^{k+1}$, $(y^1, \dots,…

Classical Analysis and ODEs · Mathematics 2024-05-07 P. Bhowmik , A. Greenleaf , A. Iosevich , S. Mkrtchyan , F. Rakhmonov

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

Let $E$ be a bounded open subset of $\mathbb{R}^n$. We study the following questions: For i.i.d. samples $X_1, \dots, X_N$ drawn uniformly from $E$, what is the probability that $\cup_i \mathbf{B}(X_i, \delta)$, the union of $\delta$-balls…

Probability · Mathematics 2023-07-06 Enrique Alvarado , Bala Krishnamoorthy , Kevin R. Vixie

In this paper we study the cardinality of the dot product set generated by two subsets of vector spaces over finite fields. We notice that the results on the dot product problems for one set can be simply extended to two sets. Let E and F…

Combinatorics · Mathematics 2014-01-28 Doowon Koh , Youngjin Pi

In a recent paper, Drusvyatskiy, Lee, Ottaviani, and Thomas establish a "transfer principle" by means of which the Euclidean distance degree of an orthogonally-stable matrix variety can be computed from the Euclidean distance degree of its…

Algebraic Geometry · Mathematics 2018-12-11 Arthur Bik , Jan Draisma

We develop quantitative algorithmic information bounds for orthogonal projections and distances in the plane. Under mild independence conditions, the distance $|x-y|$ and a projection coordinate $p_e x$ each retain at least half the…

Computational Complexity · Computer Science 2025-09-08 Peter Cholak , Marianna Csörnyei , Neil Lutz , Patrick Lutz , Elvira Mayordomo , D. M. Stull

We consider the number of distinct distances between two finite sets of points in ${\bf R}^k$, for any constant dimension $k\ge 2$, where one set $P_1$ consists of $n$ points on a line $l$, and the other set $P_2$ consists of $m$ arbitrary…

Combinatorics · Mathematics 2016-12-16 Ariel Bruner , Micha Sharir

Let $V\subset \mathbb{F}_q^d$ be a \textit{regular} variety, $k\ge 3$ is an integer and $A\subseteq V$. Covert, Koh, and Pi (2017) proved the following generalization of the Erd\H{o}s-Falconer distance problem: If $|A|\gg…

Number Theory · Mathematics 2021-09-29 Minh Quy Pham

Erd\H{o}s' unit distance problem and Erd\H{o}s' distinct distances problem are among the most classical and well-known open problems in discrete mathematics. They ask for the maximum number of unit distances, or the minimum number of…

Combinatorics · Mathematics 2024-11-08 Noga Alon , Matija Bucić , Lisa Sauermann

Let $\gamma_1,\gamma_2$ be a pair of constant-degree irreducible algebraic curves in $\mathbb{R}^d$. Assume that $\gamma_i$ is neither contained in a hyperplane nor in a quadric surface in $\mathbb{R}^d$, for each $i=1,2$. We show that for…

Combinatorics · Mathematics 2023-04-17 Hadas Baer-Erenfeld , Orit E. Raz

In this paper we introduce a unified approach to deal with incidence problems between points and varieties over finite fields. More precisely, we prove that the number of incidences $I(\mathcal{P}, \mathcal{V})$ between a set $\mathcal{P}$…

Combinatorics · Mathematics 2016-01-05 Nguyen Duy Phuong , Thang Pham , Nguyen Minh Sang , Claudiu Valculescu , Le Anh Vinh

Incidence problems between geometric objects is a key area of focus in the field of discrete geometry. Among them, the study of incidence problems over finite fields have received a considerable amount of attention in recent years. In this…

Combinatorics · Mathematics 2025-05-01 Xiangliang Kong , Itzhak Tamo

We study a pinned variant of Bourgain's theorem, concerning the occurrence of affine copies of $k$-point patterns in $\mathbb{R}^d$. Focusing on the case $k=2$, which corresponds to pinned distances, we show that the classical conclusion…

Classical Analysis and ODEs · Mathematics 2025-09-03 Chenjian Wang

Let $X_1,\dots, X_n,\dots$ be i.i.d.\ $d$-dimensional random vectors with common distribution $F$. Then $S_n = X_1+\dots+X_n$ has distribution $F^n$ (degree is understood in the sense of convolution). Let $$ \rho_{\mathcal{C}_d}(F,G) =…

Probability · Mathematics 2024-04-18 Andrei Yu. Zaitsev