Related papers: A Reduction for the Distinct Distances Problem in …

In this paper we show that the number of distinct distances determined by a set of $n$ points on a constant-degree two-dimensional algebraic variety $V$ (i.e., a surface) in $\mathbb R^3$ is at least $\Omega\left(n^{7/9}/{\rm polylog}…

Our work proposes a unified approach to three different topics in a general Riemannian setting: splitting theorems, symmetry results and overdetermined elliptic problems. By the existence of a stable solution to the semilinear equation…

We use the generating function approach to derive simple expressions for the factorial moments of the distance distribution over Reed-Solomon codes. We obtain better upper bounds for the error term of a counting formula given by Li and Wan,…

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…

The point-plane incidence theorem states that the number of incidences between $n$ points and $m\geq n$ planes in the projective three-space over a field $F$, is $$O\left(m\sqrt{n}+ m k\right),$$ where $k$ is the maximum number of collinear…

Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in $\mathbb R^4$, such that the points of $P$ lie on an algebraic three-dimensional surface of degree $D$ that does not contain hyperplane or quadric components, and no 2-flat…

In this paper, we study the cardinality of the distance set $\Delta(A, B)$ determined by two subsets $A$ and $B$ of the $d$-dimensional vector space over a finite field $\mathbb{F}_q$. Assuming that $A$ or $B$ lies in a $k$-coordinate plane…

Group-invariant probability distributions appear in many data-generative models in machine learning, such as graphs, point clouds, and images. In practice, one often needs to estimate divergences between such distributions. In this work, we…

Matrix Lie groups are an important class of manifolds commonly used in control and robotics, and optimizing control policies on these manifolds is a fundamental problem. In this work, we propose a novel computationally efficient approach…

In this paper, we consider optimization problems over closed embedded submanifolds of $\mathbb{R}^n$, which are defined by the constraints $c(x) = 0$. We propose a class of constraint dissolving approaches for these Riemannian optimization…

In this paper, we establish a complete structural description of flat Lorentzian Lie groups, i.e., Lie groups endowed with a flat left invariant Lorentzian metric, thereby resolving a long-standing open problem in the theory of…

Numerous problems consisting in identifying vertices in graphs using distances are useful in domains such as network verification and graph isomorphism. Unifying them into a meta-problem may be of main interest. We introduce here a…

In 1997, Erd\H{o}s asked whether for arbitrarily large $n$ there exists a set of $n$ points in $\mathbb{R}^2$ that determines $O(\frac{n}{\sqrt{\log n}})$ distinct distances while satisfying the local constraint that every 4-point subset…

It is shown that $N$ points on a real algebraic curve of degree $n$ in $\mathbb{R}^d$ always determine $\gtrsim_{n,d}N^{1+\frac{1}{4}}$ distinct distances, unless the curve is a straight line or the closed geodesic of a flat torus. In the…

This paper studies binary quadratic programs in which the objective is defined by a Euclidean distance matrix, subject to a general polyhedral constraint set. This class of nonconcave maximisation problems includes the capacitated,…

For integers $1 < k < d-1$ and $r \ge k+2$, we establish new lower bounds on the maximum number of points in $[n]^d$ such that no $r$ lie in a $k$-dimensional affine (or linear) subspace. These bounds improve on earlier results of…

We prove a new upper bound for the number of incidences between points and lines in a plane over an arbitrary field $\mathbb{F}$, a problem first considered by Bourgain, Katz and Tao. Specifically, we show that $m$ points and $n$ lines in…

The authors compute distances between arbitrary elements of Lie groups SU(2) and SO(3) for special left-invariant sub-Riemannian metrics $\rho$ and $d$. To compute distances for the second metric, we essentially use the fact that canonical…

This paper establishes an existence theory for discrete second-order boundary value problems on non-uniform time grids using the upper and lower solution method. We consider difference equations of the form $u^{\Delta\Delta}(t_{i-1}) +…

A $p$-divisible group over a field $K$ admits a slope decomposition; associated to each slope $\lambda$ is an integer $m$ and a representation $\gal(K) \ra \gl_m(D_\lambda)$, where $D_\lambda$ is the $\rat_p$-division algebra with Brauer…