Related papers: The generalized Erdos-Falconer distance problems i…
A finite set of distinct vectors $\mathcal{X}$ in the $d$-dimensional Euclidean space $\mathbb{R}^d$ is called a $2$-distance set, if the set of mutual distances between distinct elements of $\mathcal{X}$ has cardinality exactly $2$. In…
In this paper we study the following variant of the Falconer distance problem. Let $E$ be a compact subset of ${\mathbb{R}}^d$, $d \ge 1$, and define $$ \Box(E)=\left\{\sqrt{{|x-y|}^2+{|x-z|}^2}: x,y,z \in E,\, y\neq z \right\}.$$ We shall…
Distance Geometry is based on the inverse problem that asks to find the positions of points, in a Euclidean space of given dimension, that are compatible with a given set of distances. We briefly introduce the field, and discuss some open…
Generalized polyhedral convex sets, generalized polyhedral convex functions on locally convex Hausdorff topological vector spaces, and the related constructions such as sum of sets, sum of functions, directional derivative, infimal…
Generalized equations are problems emerging in contexts of modern variational analysis as an adequate formalism to treat such issues as constraint systems, optimality and equilibrium conditions, variational inequalities, differential…
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…
In this paper, we prove the first incidence bound for points and conics over prime fields. As applications, we prove new results on expansion of bivariate polynomial images and on certain variations of distinct distances problems. These…
The first purpose of this paper is to provide new finite field extension theorems for paraboloids and spheres. By using the unusual good Fourier transform of the zero sphere in some specific dimensions, which has been discovered recently in…
We discuss a unified approach to a class of geometric combinatorics incidence problems in $2D$, of the Erd\"os distance type. The goal is obtaining the second moment estimate, that is given a finite point set $S$ and a function $f$ on…
We study the shifted convolution problem for the divisor function in function fields in the large degree limit, that is, the average value of $d(f) d(f+h)$ where $f$ runs over monic polynomials in $\mathbb{F}_q[T]$ of a given degree, and…
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\|,…
In this paper methods for simultaneous finding all roots of generalized polynomials are developed. These methods are related to the case when the roots are multiple. They possess cubic rate of convergence and they are as labour-consuming as…
We study the general moment problem for measures on the real line, with polynomials replaced by more general spaces of entire functions. As a particular case, we describe measures that are uniquely determined by a restriction of their…
In practical purposes for some geometrical problems in computer science we have as information the coordinates of some finite points in surface instead of the whole body of a surface. The problem arised here is: "How to define a distance…
Our main aim in this paper is to introduce a general concept of multidimensional fixed point of a mapping in spaces with distance and establish various multidimensional fixed point results. This new concept simplifies the similar notion…
We derive upper and lower bounds on the sum of distances of a spherical code of size $N$ in $n$ dimensions when $N\sim n^\alpha, 0<\alpha\le 2.$ The bounds are derived by specializing recent general, universal bounds on energy of spherical…
Although recovering an Euclidean distance matrix from noisy observations is a common problem in practice, how well this could be done remains largely unknown. To fill in this void, we study a simple distance matrix estimate based upon the…
A spherical two-distance set is a finite collection of unit vectors in $\reals^n$ such that the set of distances between any two distinct vectors has cardinality two. We use the semidefinite programming method to compute improved estimates…
In this paper, we prove that a set of $N$ points in ${\bf R}^2$ has at least $c{N \over \log N}$ distinct distances, thus obtaining the sharp exponent in a problem of Erd\"os. We follow the set-up of Elekes and Sharir which, in the spirit…
Stability and error analysis remain challenging for problems that lack regularity properties near solutions, are subject to large perturbations, and might be infinite dimensional. We consider nonconvex optimization and generalized equations…