A structural Szemerédi-Trotter theorem for Cartesian products
From MaRDI portal
Publication:6151032
DOI10.1007/s00454-023-00555-4arXiv2110.09692OpenAlexW3207667787WikidataQ123269111 ScholiaQ123269111MaRDI QIDQ6151032
Publication date: 9 February 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.09692
Erd?s problems and related topics of discrete geometry (52C10) Arithmetic combinatorics; higher degree uniformity (11B30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On sets defining few ordinary lines
- Extremal problems in discrete geometry
- On linear combinatorics. III: Few directions and distorted lattices
- On linear combinatorics. I: Concurrency---an algebraic approach
- On linear combinatorics. II: Structure theorems via additive number theory
- On grids in point-line arrangements in the plane
- On topological graphs with at most four crossings per edge
- On iterated product sets with shifts. II
- Cutting lemma and Zarankiewicz's problem in distal structures
- On the product sets of rational numbers
- Lower bounds for incidences with hypersurfaces
- An improved bound on the Hausdorff dimension of Besicovitch sets in ℝ³
- New Bounds for the Discrete Fourier Restriction to the Sphere in 4D and 5D
- A Problem on Sums of Two Squares
- Dense Arrangements are Locally Very Dense. I
- An Energy Bound in the Affine Group