On the Number of Incidences Between Points and Curves
From MaRDI portal
Publication:4383742
DOI10.1017/S0963548397003192zbMath0901.52016OpenAlexW2144898438MaRDI QIDQ4383742
Publication date: 22 November 1998
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548397003192
inequalitiescombinatorial inequalitiescrossing numberstransversal theoryarrangements of curvesErdős problems and related topics in discrete geometryextremal problems in combinatorial geometry
Transversal (matching) theory (05D15) Erd?s problems and related topics of discrete geometry (52C10)
Related Items (56)
The Elekes-Szabó theorem in four dimensions ⋮ The Szemerédi-Trotter theorem in the complex plane ⋮ A semi-algebraic version of Zarankiewicz's problem ⋮ Incidences with Curves in ℝ d ⋮ On the number of rich lines in high dimensional real vector spaces ⋮ A crossing lemma for Jordan curves ⋮ The Multivariate Schwartz--Zippel Lemma ⋮ Counting and Cutting Rich Lenses in Arrangements of Circles ⋮ On distinct distances between a variety and a point set ⋮ Cutting algebraic curves into pseudo-segments and applications ⋮ Nondegenerate spheres in four dimensions ⋮ Expanders with superquadratic growth ⋮ The crossing number of locally twisted cubes \(L T Q_n\) ⋮ Subquadratic algorithms for algebraic 3SUM ⋮ Crossings between non-homotopic edges ⋮ Diameter‐free estimates for the quadratic Vinogradov mean value theorem ⋮ Improved Elekes-Szabó type estimates using proximity ⋮ Incidences of Möbius transformations in \(\mathbb{F}_p\) ⋮ Concentration estimates for algebraic intersections ⋮ Incidences of cubic curves in finite fields ⋮ Additive structure in convex translates ⋮ Few distinct distances implies no heavy lines or circles ⋮ Distinct distances between points and lines ⋮ On triple intersections of three families of unit circles ⋮ Distinct Distances from Three Points ⋮ Distinct Distances on Algebraic Curves in the Plane ⋮ The polynomial method over varieties ⋮ On a Question of Bourgain about Geometric Incidences ⋮ An incidence theorem in higher dimensions ⋮ A successful concept for measuring non-planarity of graphs: The crossing number. ⋮ A combinatorial problem on polynomials and rational functions ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Distinct distances on curves via rigidity ⋮ How to find groups? ⋮ Triangle areas in line arrangements ⋮ A bipartite strengthening of the crossing Lemma ⋮ Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique ⋮ Crossing numbers of imbalanced graphs ⋮ Zarankiewicz's problem for semi-algebraic hypergraphs ⋮ Vapnik-Chervonenkis density in some theories without the independence property, I ⋮ Point-curve incidences in the complex plane ⋮ If (A+A)/(A+A) is small, then the ratio set is large ⋮ An improved bound on \((A+A)/(A+A)\) ⋮ Incidences with curves in \(\mathbb{R}^d\) ⋮ The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem ⋮ A Bipartite Strengthening of the Crossing Lemma ⋮ Polynomial partitioning on varieties of codimension two and point-hypersurface incidences in four dimensions ⋮ Planar point sets determine many pairwise crossing segments ⋮ A Szemerédi-Trotter type theorem in \(\mathbb R^4\) ⋮ Graphs drawn with few crossings per edge ⋮ Geometric incidence theorems via Fourier analysis ⋮ Representation Complexities of SemiAlgebraic Graphs ⋮ Incidences between points and curves with almost two degrees of freedom ⋮ A point-conic incidence bound and applications over \(\mathbb{F}_p\) ⋮ From harmonic analysis to arithmetic combinatorics ⋮ On the combinatorics of projective mappings
This page was built for publication: On the Number of Incidences Between Points and Curves
