On Cartesian products which determine few distinct distances

zbMath1411.52008arXiv1612.06153MaRDI QIDQ668051

Cosmin Pohoata

Publication date: 5 March 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.06153

zbMATH Keywords

Cartesian productsfew distinct distances

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Cites Work

• Unnamed Item
• On the Erdős distinct distances problem in the plane
• Bounding multiplicative energy by the sumset
• On sum sets of sets having small product set
• On some metric and combinatorial geometric problems
• 2N noncollinear points determine at least 2N directions
• New proofs of Plünnecke-type estimates for product sets in groups
• Local properties in colored graphs, distinct distances, and difference sets
• Sets with few distinct distances do not have heavy lines
• Distinct distances between a collinear set and an arbitrary set of points
• Difference sets are not multiplicatively closed
• A note on sum-product estimates
• Few sums, many products

This page was built for publication: On Cartesian products which determine few distinct distances