相关论文: Erdos distance problem in vector spaces over finit…

Many exponential sums over finite fields, including Gauss sums and Kloosterman sums, arise as the Fourier transform with respect to a character of the trace function of an $\ell$-adic sheaf on a commutative algebraic group. We study the…

Given $E \subset \mathbb{F}_q^d$, we show that certain configurations occur frequently when $E$ is of sufficiently large cardinality. Specifically, we show that we achieve the statistically number of $k$-stars $\displaystyle\left|\left\{(x,…

We use Sidon sets to present an elementary method to study some combinatorial problems in finite fields, such as sum product estimates, solubility of some equations and distribution of sequences in small intervals. We obtain classic and…

Within the framework of algebraic quantum field theory a general method is presented which allows one to compute and classify the short distance (scaling) limit of any algebra of local observables. The results can be used to determine the…

Motivated by recent results on radial projections and applications to the celebrated Falconer distance problem, we study radial projections in the setting of finite fields. More precisely, we extend results due to Mattila and Orponen…

We fully resolve the Furstenberg set conjecture in $\mathbb{R}^2$, that a $(s, t)$-Furstenberg set has Hausdorff dimension $\ge \min(s+t, \frac{3s+t}{2}, s+1)$. As a result, we obtain an analogue of Elekes' bound for the discretized…

Geometry and topology have generated impacts far beyond their pure mathematical primitive, providing a solid foundation for many applicable tools. Typically, real-world data are represented as vectors, forming a linear subspace for a given…

Let $v$ be an odd real polynomial (i.e. a polynomial of the form $\sum_{j=1}^\ell a_jx^{2j-1}$). We utilize sets of iterated differences to establish new results about sets of the form $\mathcal…

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…

Given sets $\mathcal{P}, \mathcal{Q} \subseteq \mathbb{R}^2$ of sizes $m$ and $n$ respectively, we are interested in the number of distinct distances spanned by $\mathcal{P} \times \mathcal{Q}$. Let $D(m, n)$ denote the minimum number of…

Motivated by the concept of Euclidean Distance Degree, which measures the complexity of finding the nearest point to an algebraic set in Euclidean space, we introduce the notion of Grassmann Distance Complexity (GDC). This concept…

Kantorovich distance (or 1-Wasserstein distance) on the probability simplex of a finite metric space is the value of a Linear Programming problem for which a closed-form expression is known in some cases. When the ground distance is defined…

Falconer proved that there are sets $E\subset \mathbb{R}^n$ of Hausdorff dimension $n/2$ whose distance sets $\{|x-y| : x,y\in E\}$ are null with respect to Lebesgue measure. This led to the conjecture that distance sets have positive…

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…

Friedrichs' systems (FS) are symmetric positive linear systems of first-order partial differential equations (PDEs), which provide a unified framework for describing various elliptic, parabolic and hyperbolic semi-linear PDEs such as the…

Ewald summation is widely used to calculate electrostatic interactions in computer simulations of condensed-matter systems. We present an analysis of the errors arising from truncating the infinite real- and Fourier-space lattice sums in…

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…

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…

One of the main problems of subspace coding asks for the maximum possible cardinality of a subspace code with minimum distance at least $d$ over $\mathbb{F}_q^n$, where the dimensions of the codewords, which are vector spaces, are contained…

We study a variant of the Erd\H os unit distance problem, concerning angles between successive triples of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, and a sequence of angles…