Distinct Distances on Algebraic Curves in the Plane
From MaRDI portal
Publication:5366936
DOI10.1017/S0963548316000225zbMATH Open1378.52018arXiv1308.0177MaRDI QIDQ5366936FDOQ5366936
Authors: János Pach, Frank de Zeeuw
Publication date: 10 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Abstract: Let be a set of points in the real plane contained in an algebraic curve of degree . We prove that the number of distinct distances determined by is at least , unless contains a line or a circle. We also prove the lower bound for the number of distinct distances between points on one irreducible plane algebraic curve and points on another, unless the two curves are parallel lines, orthogonal lines, or concentric circles. This generalizes a result on distances between lines of Sharir, Sheffer, and Solymosi in arXiv:1302.3081.
Full work available at URL: https://arxiv.org/abs/1308.0177
Recommendations
- Distinct distances on algebraic curves in the plane
- Distinct distances on curves via rigidity
- scientific article; zbMATH DE number 2149739
- Distinct distances in finite planar sets
- Distinct distances on hyperbolic surfaces
- On the distinct distances determined by a planar point set
- Distinct distances on regular varieties over finite fields
- Geometric distance fields of plane curves
- On distinct distances between a variety and a point set
- Characterizing the finiteness of the Hausdorff distance between two algebraic curves
Erd?s problems and related topics of discrete geometry (52C10) Algebraic functions and function fields in algebraic geometry (14H05) Combinatorial complexity of geometric structures (52C45)
Cites Work
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Research Problems in Discrete Geometry
- On the Erdős distinct distances problem in the plane
- Algorithms in real algebraic geometry
- Repeated angles in the plane and related problems
- Title not available (Why is that?)
- On the Number of Incidences Between Points and Curves
- On Sets of Distances of n Points
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
- Definability and fast quantifier elimination in algebraically closed fields
- Few distinct distances implies no heavy lines or circles
- A combinatorial problem on polynomials and rational functions
- Polynomials vanishing on grids: the Elekes-Rónyai problem revisited
- An incidence theorem in higher dimensions
- Extensions of a result of Elekes and Rónyai
- Title not available (Why is that?)
- Incidences in Three Dimensions and Distinct Distances in the Plane
- On a real analog of Bézout inequality and the number of connected components of sign conditions
- A note on the number of distinct distances
- Distinct distances on two lines
- Distinct Distances from Three Points
- Distinct distances on curves via rigidity
Cited In (15)
- Distinct distances in \(\mathbf{R}^3\) between quadratic and orthogonal curves
- A note on distinct distances
- Distinct distances between points and lines in \(\mathbb{F}_q^2\)
- On bipartite distinct distances in the plane
- Generic distance-squared mappings on plane curves
- Distinct distances on curves via rigidity
- Bisector energy and few distinct distances
- Distinct distances on non-ruled surfaces and between circles
- Distinct Distances Between a Circle and a Generic Set
- Distinct distances between a collinear set and an arbitrary set of points
- Improved Elekes-Szabó type estimates using proximity
- Title not available (Why is that?)
- Schwartz-Zippel bounds for two-dimensional products
- Distinct distances on algebraic curves in the plane
- On distinct distances between a variety and a point set
This page was built for publication: Distinct Distances on Algebraic Curves in the Plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366936)