中文
相关论文

相关论文: The Erd\"os-Falconer distance problem on the unit …

200 篇论文

The VC-dimension, introduced by Vapnik and Chervonenkis in 1968 in the context of learning theory, has in recent years provided a rich source of problems in combinatorial geometry. Given $E\subseteq \mathbb{F}_q^d$ or $E\subseteq…

组合数学 · 数学 2025-11-24 Moustapha Diallo , Brian McDonald

In this paper we study the boundedness of extension operators associated with spheres in vector spaces over finite fields.In even dimensions, we estimate the number of incidences between spheres and points in the translated set from a…

经典分析与常微分方程 · 数学 2018-11-20 Alex Iosevich , Doowon Koh

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…

度量几何 · 数学 2026-05-07 Theophilus Agama

Given $E \subseteq \mathbb{F}_q^d \times \mathbb{F}_q^d$, with the finite field $\mathbb{F}_q$ of order $q$ and the integer $d \ge 2$, we define the two-parameter distance set as $\Delta_{d, d}(E)=\left\{\left(\|x_1-y_1\|,…

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…

组合数学 · 数学 2024-08-21 Esen Aksoy , Alex Iosevich , Brian McDonald

Let $\mathbb{F}_q$ be a finite field of order $q$. Iosevich and Rudnev (2005) proved that for any set $A\subset \mathbb{F}_q^d$, if $|A|\gg q^{\frac{d+1}{2}}$, then the distance set $\Delta(A)$ contains a positive proportion of all…

数论 · 数学 2022-05-03 Doowon Koh , Minh Quy Pham , Thang Pham

Let $\mathbb{F}_q$ be the finite field of order $q$ and $E\subset \mathbb{F}_q^d$, where $4|d$. Using Fourier analytic techniques, we prove that if $|E|>\frac{q^{d-1}}{d}\binom{d}{d/2}\binom{d/2}{d/4}$, then the points of $E$ determine a…

组合数学 · 数学 2019-10-15 Esen Aksoy Yazici

We present a short, digested, human-verified version of the recent OpenAI-generated counterexample to the Erd\H{o}s unit distance conjecture, and a sequence of reflections on it. The argument relies crucially on ideas that may, at least in…

According to a classical result of Spencer, Szemer\'edi, and Trotter (1984), the maximum number of times the unit distance can occur among $n$ points in the plane is $O(n^{4/3})$. This is far from Erd\H{o}s's lower bound, $n^{1+O(1/\log\log…

组合数学 · 数学 2025-07-22 János Pach , Orit E. Raz , József Solymosi

We show that for any sequence $f: {\bf N} \to \{-1,+1\}$ taking values in $\{-1,+1\}$, the discrepancy $$ \sup_{n,d \in {\bf N}} \left|\sum_{j=1}^n f(jd)\right| $$ of $f$ is infinite. This answers a question of Erd\H{o}s. In fact the…

组合数学 · 数学 2017-01-17 Terence Tao

The recent breakthrough of Guth, Iosevich, Ou, and Wang (2019) on the Falconer distance problem states that for a compact set $A\subset \mathbb{R}^2$, if the Hausdorff dimension of $A$ is greater than $\frac{5}{4}$, then the distance set…

组合数学 · 数学 2022-07-27 Thang Pham , Steven Senger , Dung The Tran

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

经典分析与常微分方程 · 数学 2017-09-26 Alex Iosevich

We improve the best known upper bound on the number of edges in a unit-distance graph on $n$ vertices for each $n\in\{16,\ldots,30\}$. When $n\leq 21$, our bounds match the best known lower bounds, and we fully enumerate the densest…

组合数学 · 数学 2025-02-14 Boris Alexeev , Dustin G. Mixon , Hans Parshall

In this paper we study extension theorems associated with general varieties in two dimensional vector spaces over finite fields. Applying Bezout's theorem, we obtain the sufficient and necessary conditions on general curves where sharp…

经典分析与常微分方程 · 数学 2010-12-01 Doowon Koh , Chun-Yen Shen

In this paper, we study the distance problem in the setting of finite p-adic rings. In odd dimensions, our results are essentially sharp. In even dimensions, we clarify the conjecture and provide examples to support it. Surprisingly,…

组合数学 · 数学 2024-08-16 Thang Pham , Boqing Xue

In this paper we study extension problems, averaging problems, and generalized Erdos-Falconer distance problems associated with arbitrary homogeneous varieties in three dimensional vector space over finite fields. In the case when…

经典分析与常微分方程 · 数学 2010-05-18 Doowon Koh , Chun-Yen Shen

In this paper, we study the analogous Erd\H{o}s similarity conjecture in higher dimensions and generalize the Eigen-Falconer theorem. We show that if $A=\{\boldsymbol{x}_n\}_{n=1}^\infty \subseteq \mathbb{R}^d$ is a sequence of non-zero…

经典分析与常微分方程 · 数学 2025-12-03 Wenxia Li , Zhiqiang Wang , Jiayi Xu

We deal with the restriction phenomenon for the Fourier transform. We prove that each of the restriction conjectures for the sphere, the paraboloid, the elliptic hyperboloid in $\mathbb{R}^n$ implies that for the cone in $\mathbb{R}^{n+1}$.…

经典分析与常微分方程 · 数学 2008-04-24 Fabio Nicola

Using Fourier analysis, Covert, Hart, Iosevich and Uriarte-Tuero (2008) showed that if the cardinality of a subset of the 2-dimensional vector space over a finite field with q elements is >= rq^2, with q^{-1/2} << r <= 1 then it contains an…

组合数学 · 数学 2008-07-18 Le Anh Vinh

In this note we consider distinct distances determined by points in an integer lattice. We first consider Erdos's lower bound for the square lattice, recast in the setup of the so-called Elekes-Sharir framework \cite{ES11,GK11}, and show…

组合数学 · 数学 2013-07-01 Javier Cilleruelo , Micha Sharir , Adam Sheffer