On the Number of Incidences Between Points and Curves
DOI10.1017/S0963548397003192zbMATH Open0901.52016OpenAlexW2144898438MaRDI QIDQ4383742FDOQ4383742
Authors: János Pach, Micha Sharir
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
Recommendations
inequalitiestransversal theorycombinatorial inequalitiescrossing numbersarrangements 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)
Cited In (67)
- Crossing numbers of imbalanced graphs
- Representation complexities of semialgebraic graphs
- Improved Elekes-Szabó type estimates using proximity
- Incidences of Möbius transformations in \(\mathbb{F}_p\)
- Additive structure in convex translates
- Concentration estimates for algebraic intersections
- Incidences of cubic curves in finite fields
- Counting and Cutting Rich Lenses in Arrangements of Circles
- Title not available (Why is that?)
- Incidences with curves in \(\mathbb{R}^d\)
- A point-conic incidence bound and applications over \(\mathbb{F}_p\)
- Polynomial partitioning on varieties of codimension two and point-hypersurface incidences in four dimensions
- Subquadratic algorithms for algebraic 3SUM
- New bounds on curve tangencies and orthogonalities
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Beck's theorem for plane curves
- A bipartite strengthening of the crossing Lemma
- On a Question of Bourgain about Geometric Incidences
- The Elekes-Szabó theorem in four dimensions
- Diameter‐free estimates for the quadratic Vinogradov mean value theorem
- Incidences between points and circles in three and higher dimensions
- The polynomial method over varieties
- Zarankiewicz's problem for semi-algebraic hypergraphs
- Point-curve incidences in the complex plane
- A successful concept for measuring non-planarity of graphs: The crossing number.
- Graphs drawn with few crossings per edge
- Distinct distances on curves via rigidity
- An improved bound on \((A+A)/(A+A)\)
- On the number of rich lines in high dimensional real vector spaces
- The Szemerédi-Trotter theorem in the complex plane
- Incidences with curves in \(\mathbb{R}^{d}\)
- Vapnik-Chervonenkis density in some theories without the independence property. I
- A crossing lemma for Jordan curves
- A Bipartite Strengthening of the Crossing Lemma
- A Szemerédi-Trotter type theorem in \(\mathbb R^4\)
- The Multivariate Schwartz--Zippel Lemma
- The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem
- Distinct Distances on Algebraic Curves in the Plane
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
- An incidence theorem in higher dimensions
- Title not available (Why is that?)
- On the combinatorics of projective mappings
- Expanders with superquadratic growth
- Incidence theorems for pseudoflats
- Distinct distances between points and lines
- Incidences
- Extremal problems for geometric hypergraphs
- The crossing number of locally twisted cubes \(L T Q_n\)
- Counting joints with multiplicities
- Nondegenerate spheres in four dimensions
- A semi-algebraic version of Zarankiewicz's problem
- The number of integral points on arcs and ovals
- Crossings between non-homotopic edges
- From harmonic analysis to arithmetic combinatorics
- Incidences between points and lines in R4
- Cutting algebraic curves into pseudo-segments and applications
- Few distinct distances implies no heavy lines or circles
- Triangle areas in line arrangements
- A combinatorial problem on polynomials and rational functions
- The probability that the number of points on a complete intersection is squarefree
- If \((A+A)/(A+A)\) is small, then the ratio set is large
- Incidences between points and curves with almost two degrees of freedom
- Incidences between points and lines in \({\mathbb {R}}^4\)
- How to find groups?
- Distinct distances from three points
- Geometric incidence theorems via Fourier analysis
- On distinct distances between a variety and a point set
This page was built for publication: On the Number of Incidences Between Points and Curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4383742)