An improved bound on the number of dot products determined by a finite point set in the plane

We are interested to bound from below the number of distinct dot products determined by a finite set of points P in the Euclidean plane. In this paper, we build on [3] to obtain the improved lower bound | { p ⋅ q : p , q ∈ P } | ≳ | P | 2 3 + 7 1425 .

Authors

Institutions

Publication Details

Journal
Discrete Mathematics
Published
2026-08-28
DOI
https://doi.org/10.1016/j.disc.2026.115399
Primary Topic
Limits and Structures in Graph Theory
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An improved bound on the number of dot products determined by a finite point set in the plane

Michalis Kokkinos
Discrete Mathematics
Limits and Structures in Graph Theory
article

An improved bound on the number of dot products determined by a finite point set in the plane

Michalis Kokkinos
article en

Abstract

We are interested to bound from below the number of distinct dot products determined by a finite set of points P in the Euclidean plane. In this paper, we build on [3] to obtain the improved lower bound | { p ⋅ q : p , q ∈ P } | ≳ | P | 2 3 + 7 1425 .

Discrete MathematicsVol. 350(2)
Johannes Kepler University of Linz (AT)
Austrian Science Fund
Openalex Percentile: Top 94%
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.