A note on the number of different inner products generated by a finite set of vectors

DOI10.1016/j.disc.2009.10.026zbMath1186.68511OpenAlexW2030453825MaRDI QIDQ966051

Stefan Steinerberger

Publication date: 27 April 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.10.026

zbMATH Keywords

Erdős distance problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Erd?s problems and related topics of discrete geometry (52C10)

Related Items (1)

Bounds on Point Configurations Determined by Distances and Dot Products

Cites Work

• Unnamed Item
• Unnamed Item
• Minimal sumsets in infinite Abelian groups.
• The grid revisited
• A deterministic view of random sampling and its use in geometry
• The number of different distances determined by n points in the plane
• Near optimal bounds for the Erdős distinct distances problem in high dimensions
• On some metric and combinatorial geometric problems
• The number of different distances determined by a set of points in the Euclidean plane
• On distinct sums and distinct distances.
• Über Integrale auf konvexen Körpern. I, II
• Research Problems in Discrete Geometry
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• Sums and products in finite fields: an integral geometric viewpoint
• On the Different Distances Determined by n Points
• On Sets of Distances of n Points
• Distinct distances in the plane

This page was built for publication: A note on the number of different inner products generated by a finite set of vectors