The constant of point-line incidence constructions
From MaRDI portal
Publication:6110067
DOI10.1016/j.comgeo.2023.102009zbMath1521.52007arXiv2210.04821MaRDI QIDQ6110067
Ruiwen Tang, Adam Sheffer, Martin Balko
Publication date: 31 July 2023
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.04821
Erd?s problems and related topics of discrete geometry (52C10) Multiplicative number theory (11Nxx) Graph theory (05Cxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal problems in discrete geometry
- An improved lower bound on the size of Kakeya sets over finite fields
- Graphs drawn with few crossings per edge
- Covering lattice points by subspaces and counting point-hyperplane incidences
- On topological graphs with at most four crossings per edge
- Cutting lemma and Zarankiewicz's problem in distal structures
- Sharp density bounds on the finite field Kakeya problem
- A Problem on Sums of Two Squares
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- Improving the crossing lemma by finding more crossings in sparse graphs
- Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
- A Proof of the Divergence of σ1/p
- Joints tightened
This page was built for publication: The constant of point-line incidence constructions
