A Lower Bound for the Number of Pinned Angles Determined by a Cartesian Product Set
Open Access
- 7 March 2025
- journal article
- research article
- Published by Springer Nature in Combinatorica
- Vol. 45 (2) , 1-13
Abstract
We prove that, for any $$B \subset {\mathbb {R}}$$ , the Cartesian product set $$B \times B$$ determines $$\Omega (|B|^{2+c})$$ distinct angles.
Keywords
All Related Versions
Funding Information
- Johannes Kepler University Linz
This publication has 12 references indexed in Scilit:
- Convexity, Squeezing, and the Elekes-Szabó TheoremThe Electronic Journal of Combinatorics, 2024
- A Structural Theorem for Sets with Few TrianglesCombinatorica, 2023
- Growth in Sumsets of Higher Convex FunctionsCombinatorica, 2023
- Convexity, superquadratic growth, and dot productsJournal of the London Mathematical Society, 2023
- Higher Convexity and Iterated Sum SetsCombinatorica, 2021
- On Distinct Consecutive Differences2021
- On the Erdős distinct distances problem in the planeAnnals of Mathematics, 2015
- Convexity and SumsetsJournal of Number Theory, 2000
- Repeated angles in the plane and related problemsJournal of Combinatorial Theory, Series A, 1992
- On some metric and combinatorial geometric problemsDiscrete Mathematics, 1986