The Szemerédi-Trotter theorem in the complex plane

DOI10.1007/s00493-014-2686-2zbMath1349.05335arXivmath/0305283OpenAlexW3103127587WikidataQ56454606 ScholiaQ56454606MaRDI QIDQ276440

Csaba D. Tóth

Publication date: 3 May 2016

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0305283

zbMATH Keywords

Szemerédi-Trotter theoremcovering lemma\(d\)-dimensional affine subspacecomplex Euclidean planecomplex linear transformationGrassman manifoldpoint-line incidencesseparation lemma

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Extremal combinatorics (05D99)

Related Items

Two theorems on point-flat incidences, Generalizations of the Szemerédi-Trotter theorem, On the number of rich lines in high dimensional real vector spaces, A NOTE ON RICH LINES IN TRULY HIGH DIMENSIONAL SETS, The Multivariate Schwartz--Zippel Lemma, Distality in valued fields and related structures, On the energy variant of the sum-product conjecture, On a theorem of Hegyvári and Hennecart, Sum-product phenomena for planar hypercomplex numbers, Ruled Surface Theory and Incidence Geometry, Incidences between points and lines on two- and three-dimensional varieties, NEW RESULTS ON SUM‐PRODUCT TYPE GROWTH OVER FIELDS, An incidence theorem in higher dimensions, Incidences between planes over finite fields, Improved bounds for pencils of lines, Model-theoretic Elekes–Szabó in the strongly minimal case, On discrete values of bilinear forms, On the number of incidences between points and planes in three dimensions, Homotheties and incidences, Vapnik-Chervonenkis density in some theories without the independence property, I, Point-curve incidences in the complex plane, A Szemerédi-Trotter type theorem in \(\mathbb R^4\), Incidence Bounds for Block Designs, A point-conic incidence bound and applications over \(\mathbb{F}_p\), Distinct distances in the complex plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of many cells in arrangements of planes and related problems
• On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
• A combinatorial distinction between the Euclidean and projective planes
• Extremal problems in discrete geometry
• Improving the crossing lemma by finding more crossings in sparse graphs
• Combinatorial complexity bounds for arrangements of curves and spheres
• Repeated angles in the plane and related problems
• Graphs drawn with few crossings per edge
• On linear combinatorics. I: Concurrency---an algebraic approach
• A combinatorial problem on polynomials
• Zur Riemannschen Geometrie in Grassmannschen Mannigfaltigkeiten
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• On the Number of Incidences Between Points and Curves
• DIFFERENTIAL GEOMETRY OF GRASSMANN MANIFOLDS
• ON THE NUMBER OF SUMS AND PRODUCTS