The following pages link to (Q4657590):
Displaying 26 items.
- The Szemerédi-Trotter theorem in the complex plane (Q276440) (← links)
- On sets of directions determined by subsets of \(\mathbb R^d\) (Q351365) (← links)
- On totally positive matrices and geometric incidences (Q458293) (← links)
- Highly incidental patterns on a quadratic hypersurface in \(\mathbb{R}^4\) (Q507475) (← links)
- Incidences between points and lines in \({\mathbb {R}}^4\) (Q527445) (← links)
- A bichromatic incidence bound and an application (Q650111) (← links)
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique (Q714991) (← links)
- Point-curve incidences in the complex plane (Q722326) (← links)
- Incidences with curves in \(\mathbb{R}^d\) (Q727188) (← links)
- Distinct distances in planar point sets with forbidden 4-point patterns (Q776292) (← links)
- Output sensitive algorithms for approximate incidences and their applications (Q827295) (← links)
- Cuttings for disks and axis-aligned rectangles in three-space (Q848675) (← links)
- On the diameter of separated point sets with many nearly equal distances (Q850083) (← links)
- On regular vertices of the union of planar convex objects (Q1017923) (← links)
- Extremal problems on triangle areas in two and three dimensions (Q1040833) (← links)
- Distinct distances between points and lines (Q1702254) (← links)
- A general incidence bound in \(\mathbb{R}^d\) (Q2033938) (← links)
- On lines, joints, and incidences in three dimensions (Q2431258) (← links)
- Mean lattice point discrepancy bounds. II: Convex domains in the plane (Q2474564) (← links)
- Nearly equal distances and Szemerédi's regularity lemma (Q2489544) (← links)
- Vapnik-Chervonenkis density in some theories without the independence property, I (Q2790718) (← links)
- Incidence Bounds for Block Designs (Q2830440) (← links)
- Incidences with Curves in ℝ d (Q3452856) (← links)
- Non-commutative methods in additive combinatorics and number theory (Q5068118) (← links)
- Improved Bounds for Incidences Between Points and Circles (Q5364239) (← links)
- Clique-based separators for geometric intersection graphs (Q6103521) (← links)
