English
Related papers

Related papers: Distinct distances on algebraic curves in the plan…

200 papers

We study the minimum number of distinct distances between point sets on two curves in $R^3$. Assume that one curve contains $m$ points and the other $n$ points. Our main results: (a) When the curves are conic sections, we characterize all…

Combinatorics · Mathematics 2023-03-21 Toby Aldape , Jingyi Liu , Gregory Pylypovych , Adam Sheffer , Minh-Quan Vo

We show that for $m$ points and $n$ lines in the real plane, the number of distinct distances between the points and the lines is $\Omega(m^{1/5}n^{3/5})$, as long as $m^{1/2}\le n\le m^2$. We also prove that for any $m$ points in the…

Metric Geometry · Mathematics 2015-12-31 Micha Sharir , Shakhar Smorodinsky , Claudiu Valculescu , Frank de Zeeuw

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…

Metric Geometry · Mathematics 2014-04-08 Marcos Charalambides

We improve the current best bound for distinct distances on non-ruled algebraic surfaces in ${\mathbb R}^3$. In particular, we show that $n$ points on such a surface span $\Omega\left(n^{32/39-\varepsilon}\right)$ distinct distances, for…

Combinatorics · Mathematics 2021-12-30 Surya Mathialagan , Adam Sheffer

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…

Combinatorics · Mathematics 2019-08-21 Bryce McLaughlin , Mohamed Omar

Let P_1 and P_2 be two sets of points in the plane, so that P_1 is contained in a line L_1, P_2 is contained in a line L_2, and L_1 and L_2 are neither parallel nor orthogonal. Then the number of distinct distances determined by the pairs…

Combinatorics · Mathematics 2013-06-04 Micha Sharir , Adam Sheffer , József Solymosi

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

Combinatorics · Mathematics 2016-04-07 Micha Sharir , Noam Solomon

Let $p_1,p_2,p_3$ be three non-collinear points in the plane, and let $P$ be a set of $n$ other points in the plane. We show that the number of distinct distances between $p_1,p_2,p_3$ and the points of $P$ is $\Omega(n^{6/11})$, improving…

Combinatorics · Mathematics 2019-02-20 Micha Sharir , Jozsef Solymosi

We show that, for a constant-degree algebraic curve $\gamma$ in $\mathbb{R}^D$, every set of $n$ points on $\gamma$ spans at least $\Omega(n^{4/3})$ distinct distances, unless $\gamma$ is an {\it algebraic helix} (see Definition 1.1). This…

Metric Geometry · Mathematics 2020-09-16 Orit E. Raz

We study the structure of planar point sets that determine a small number of distinct distances. Specifically, we show that if a set P of n points determines o(n) distinct distances, then no line contains \Omega(n^{7/8}) points of P and no…

Combinatorics · Mathematics 2013-08-27 Adam Sheffer , Joshua Zahl , Frank de Zeeuw

We generalize Pach and de Zeeuw's bound for distinct distances between points on two curves, from algebraic curves to Pfaffian curves. Pfaffian curves include those that can be defined by any combination of elementary functions, including…

Metric Geometry · Mathematics 2025-10-07 Abhiram Natarajan , Adam Sheffer

We consider the number of distinct distances between two finite sets of points in ${\bf R}^k$, for any constant dimension $k\ge 2$, where one set $P_1$ consists of $n$ points on a line $l$, and the other set $P_2$ consists of $m$ arbitrary…

Combinatorics · Mathematics 2016-12-16 Ariel Bruner , Micha Sharir

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…

Combinatorics · Mathematics 2019-12-05 Surya Mathialagan

We prove lower bounds for the minimum distance of algebraic geometry codes over surfaces whose canonical divisor is either nef or anti-strictly nef and over surfaces without irreducible curves of small genus. We sharpen these lower bounds…

Algebraic Geometry · Mathematics 2020-03-04 Yves Aubry , Elena Berardini , Fabien Herbaut , Marc Perret

Erd\H{o}s conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P. The best known lower bound due to Dumitrescu (2006) is…

Computational Geometry · Computer Science 2013-03-25 Gabriel Nivasch , János Pach , Rom Pinchasi , Shira Zerbib

Let $S$ be a set of points in $\mathbb{R}^2$ contained in a circle and $P$ an unrestricted point set in $\mathbb{R}^2$. We prove the number of distinct distances between points in $S$ and points in $P$ is at least…

Metric Geometry · Mathematics 2020-09-18 Alex McDonald , Brian McDonald , Jonathan Passant , Anurag Sahay

Let $B$ be a bilinear form on pairs of points in the complex plane, of the form $B(p,q) = p^TMq$, for an invertible $2\times2$ complex matrix $M$. We prove that any finite set $S$ contained in an irreducible algebraic curve $C$ of degree…

Metric Geometry · Mathematics 2015-02-24 Claudiu Valculescu , Frank de Zeeuw

Let $d,m_1,...,m_r$ be ($r+1$) positive integers, and $P_1,...,P_r$ be $r$ general points in the projective plane ; let $m$ be a positive integer. We prove that there exists a bound $d_0(m)$ such that : If $m_i < m$ ($0<i<r+1$), and $d >…

Algebraic Geometry · Mathematics 2007-05-23 Thierry Mignon

We introduce a new type of distinct distances result: a lower bound on the number of distances between points on a line and points on a two-dimensional strip. This can be seen as a generalization of the well-studied problems of distances…

Metric Geometry · Mathematics 2025-04-08 Sanjana Das , Adam Sheffer

We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the…

Combinatorics · Mathematics 2026-05-21 Will Sawin
‹ Prev 1 2 3 10 Next ›