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

The Fermat-Steiner problem consists in finding all points in a metric space $Y$ such that the sum of distances from each of them to the points from some fixed finite subset of $Y$ is minimal. This problem is investigated for the metric…

In recent years, sum-product estimates in Euclidean space and finite fields have been studied using a variety of combinatorial, number theoretic and analytic methods. Erdos type problems involving the distribution of distances, areas and…

In this paper we study a generalized version of the Weber problem of finding a point that minimizes the sum of its distances to a finite number of given points. In our setting these distances may be $cut$ $off$ at a given value $C > 0$, and…

We prove a series of results on the size of distance sets corresponding to sets in the Euclidean space. These distances are generated by bounded convex sets and the results depend explicitly on the geometry of these sets. We also use a…

We define two notions of discrete dimension based on the Minkowski and Hausdorff dimensions in the continuous setting. After proving some basic results illustrating these definitions, we apply this machinery to the study of connections…

A finite set of distinct vectors $\mathcal{X}$ in the $d$-dimensional Euclidean space $\mathbb{R}^d$ is called an $s$-distance set if the set of mutual distances between distinct elements of $\mathcal{X}$ has cardinality $s$. In this paper…

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 prove that if the cardinality of a subset of the 2-dimensional vector space over a finite field with $q$ elements is $\ge \rho q^2$, with $\frac{1}{\sqrt{q}}<<\rho \leq 1$, then it contains an isometric copy of $\ge c\rho q^3$ triangles.

We study the restriction of the Fourier transform to quadratic surfaces in vector spaces over finite fields. In two dimensions, we obtain the sharp result by considering the sums of arbitrary two elements in the subset of quadratic surfaces…

This paper addresses to the problem of finding the (minimum) Euclidean distance between two linear varieties. This problem is, usually, solved minimising a target function. We propose a novel approach: to use the Moore-Penrose generalised…

We study the algebraic complexity of Euclidean distance minimization from a generic tensor to a variety of rank-one tensors. The Euclidean Distance (ED) degree of the Segre-Veronese variety counts the number of complex critical points of…

This paper investigates the Erd\H{o}s distinct subset sums problem in $\mathbb{Z}^k$. Beyond the classical variance method, using alternative statistical quantities like $\mathbb{E}[\|X\|_1]$ and $\mathbb{E}[\|X\|_3^3]$ can yield better…

In this paper, we provide a comprehensive overview of a recent debate over the quantum versus classical solvability of bounded distance decoding (BDD). Specifically, we review the work of Eldar and Hallgren [EH22], [Hal21] demonstrating a…

We discuss the classical problem of measuring the regularity of distribution of sets of $N$ points in $\mathbb{T}^d$. A recent line of investigation is to study the cost ($=$ mass $\times$ distance) necessary to move Dirac measures placed…

We prove that no ball admits a non-harmonic orthogonal basis of exponentials. We use a combinatorial result, originally studied by Erd\H os, which says that the number of distances determined by $n$ points in ${\Bbb R}^d$ is at least $C_d…

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…

In the early 17th century, Pierre de Fermat proposed the following problem: given three points in the plane, find a point such that the sum of its Euclidean distances to the three given points is minimal. This problem was solved by…

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…

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…

In this paper we obtain a new lower bound on the Erd\H{o}s distinct distances problem in the plane over prime fields. More precisely, we show that for any set $A\subset \mathbb{F}_p^2$ with $|A|\le p^{7/6}$, the number of distinct distances…