相关论文: The Erd\H{o}s-Falconer distance problem between ar…

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…

We study the unit distance and distinct distances problems over the planar hypercomplex numbers: the dual numbers $\mathbb{D}$ and the double numbers $\mathbb{S}$. We show that the distinct distances problem in $\mathbb{S}^2$ behaves…

In this paper we investigate three unsolved conjectures in geometric combinatorics, namely Falconer's distance set conjecture, the dimension of Furstenburg sets, and Erdos's ring conjecture. We formulate natural $\delta$-discretized…

We consider point sets in the $m$-dimensional affine space $\mathbb{F}_q^m$ where each squared Euclidean distance of two points is a square in $\mathbb{F}_q$. It turns out that the situation in $\mathbb{F}_q^m$ is rather similar to the one…

The Falconer distinct distance problem asks for a compact set $E\subset\mathbb{R}^d$ how large its Hausdorff dimension needs to be to ensure that the Lebesgue measure of its distance set is positive. In this paper we consider the analogous…

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…

We consider point sets in the affine plane $\mathbb{F}_q^2$ where each Euclidean distance of two points is an element of $\mathbb{F}_q$. These sets are called integral point sets and were originally defined in $m$-dimensional Euclidean…

We survey the history and recent developments around two decades-old problems that continue to attract a great deal of interest: the slicing $\times 2$, $\times 3$ conjecture of H. Furstenberg in ergodic theory, and the distance set problem…

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,…

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…

A variant of the Falconer distance problem asks for fixed $k\geq 1$ and $d\geq k+1$, how large does the Hausdorff dimension of a Borel set $E\subset\mathbb{R}^d$ need to be to guarantee that there exist $x_0,\ldots,x_{k}\in E$ such that…

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…

For a set $E\subset \mathbb F_q^d$, we define the $k$-resultant magnitude set as $ \Delta_k(E) =\{\|\textbf{x}_1 + \dots + \textbf{x}_k\|\in \mathbb F_q: \textbf{x}_1, \dots, \textbf{x}_k \in E\},$ where $\|\textbf{v}\|=v_1^2+\cdots+ v_d^2$…

The $q$-ary block codes with two distances $d$ and $d+1$ are considered. Several constructions of such codes are given, as in the linear case all codes can be obtained by a simple modification of linear equidistant codes. Upper bounds for…

Let $X$ be a compact metric space and let $|A|$ denote the cardinality of a set $A$. We prove that if $f\colon X\to X$ is a homeomorphism and $|X|=\infty$ then for all $\delta>0$ there is $A\subset X$ such that $|A|=4$ and for all $k\in Z$…

A finite set $X$ in the $d$-dimensional Euclidean space is called an $s$-distance set if the set of distances between any two distinct points of $X$ has size $s$. In 1977, Larman-Rogers-Seidel proved that if the cardinality of an…

We consider $q$-ary (linear and nonlinear) block codes with exactly two distances: $d$ and $d+\delta$. Several combinatorial constructions of optimal such codes are given. In the linear (but not necessary projective) case, we prove that…

It is shown that any subset $E$ of a plane over a finite field $\F_q$, of cardinality $|E|>q$ determines not less than $\frac{q-1}{2}$ distinct areas of triangles, moreover once can find such triangles sharing a common base. It is also…

A rational distance set is a subset of the plane such that the distance between any two points is a rational number. We show, assuming Lang's Conjecture, that the cardinalities of rational distance sets in general position are uniformly…

We consider the problem of determining the number of distinct distances between two point sets in $\mathbb{R}^2$ where one point set $\mathcal{P}_1$ of size $m$ lies on a real algebraic curve of fixed degree $r$, and the other point set…