Extremal problems in discrete geometry
From MaRDI portal
Recommendations
- A combinatorial distinction between the Euclidean and projective planes
- Incidences between points and lines in three dimensions
- scientific article; zbMATH DE number 3913160
- On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
- Some combinatorial problems in the plane
- Progress on Dirac's conjecture
- On Sets of Points in General Position That Lie on a Cubic Curve in the Plane
- scientific article; zbMATH DE number 4015582
- A one-page solution of a problem of Erdős and Purdy
- Incidences between points and lines in \({\mathbb {R}}^4\)
Cites work
- A combinatorial distinction between the Euclidean and projective planes
- scientific article; zbMATH DE number 3838820 (Why is no real title available?)
- On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
- Some Results on Triangular Operator Algebras
Cited in
(only showing first 100 items - show all)- Degenerate crossing numbers
- Extremal problems on triangle areas in two and three dimensions
- An application of valuation theory to two problems in discrete geometry
- Two results about points, lines and planes
- Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs
- Tight bounds on a problem of lines and intersections
- The complexity of point configurations
- Repeated angles in the plane and related problems
- The number of different distances determined by a set of points in the Euclidean plane
- Counting facets and incidences
- Counting and cutting cycles of lines and rods in space
- Graphs drawn with few crossings per edge
- On linear combinatorics. I: Concurrency---an algebraic approach
- On the number of circles determined by \(n\) points in the Euclidean plane
- Extremal polygon containment problems
- Finding degeneracies among sets of lines
- On distinct sums and distinct distances.
- Convexity and sumsets
- Additive combinatorics and graph theory
- A crossing lemma for Jordan curves
- Book review of: L. Guth, Polynomial methods in combinatorics
- On the existence of ordinary triangles
- On the number of touching pairs in a set of planar curves
- Distinct distances between points and lines
- Incidences between points and lines on two- and three-dimensional varieties
- Covering lattice points by subspaces and counting point-hyperplane incidences
- On the number of incidences between points and planes in three dimensions
- The maximum number of unit distances in a convex n-gon
- Counting k-projections of a point set
- New lower bounds for Hopcroft's problem
- Counting problems relating to a theorem of Dirichlet
- A polynomial bound in Freiman's theorem.
- New results on the Erdős-Szemerédi sum-product problems.
- On counting point-hyperplane incidences
- Restriction and Kakeya phenomena for finite fields
- On the number of directions determined by a three-dimensional points set
- Two combinatorial problems in the plane
- Multiplicities of interpoint distances in finite planar sets
- Rich cells in an arrangement of hyperplanes
- The exact fitting problem in higher dimensions
- Lines, line-point incidences and crossing families in dense sets
- Higher moments of convolutions
- A combinatorial problem on polynomials and rational functions
- On grids in point-line arrangements in the plane
- On differences of multiplicative functions and solutions of the equation \(n-\varphi(n)=c\)
- Bounded VC-dimension implies the Schur-Erdős conjecture
- Incidences between points and curves with almost two degrees of freedom
- A point-conic incidence bound and applications over \(\mathbb{F}_p\)
- Incidences between Euclidean spaces over finite fields
- A note on the minimum number of red lines needed to pierce the intersections of blue lines
- Joints of varieties
- On the energy variant of the sum-product conjecture
- A refined energy bound for distinct perpendicular bisectors
- A crossing lemma for multigraphs
- A one-page solution of a problem of Erdős and Purdy
- Sum-product phenomena for planar hypercomplex numbers
- On the few products, many sums problem
- Extending Erdős-Beck's theorem to higher dimensions
- The polynomial method over varieties
- On popular sums and differences for sets with small multiplicative doubling
- Modular hyperbolas and bilinear forms of Kloosterman sums
- Hirzebruch-type inequalities viewed as tools in combinatorics
- How to find groups?
- Some remarks on products of sets in the Heisenberg group and in the affine group
- Cutting lemma and Zarankiewicz's problem in distal structures
- Bounds of trilinear and quadrilinear exponential sums
- Distinct distance estimates and low degree polynomial partitioning
- Three-point configurations determined by subsets of \({\mathbb{F}_q}^2\) via the Elekes-Sharir paradigm
- On the packing dimension and category of exceptional sets of orthogonal projections
- The proof of the l^2 decoupling conjecture
- On the number of unit-area triangles spanned by convex grids in the plane
- On empty convex polygons in a planar point set
- Iterated point-line configurations grow doubly-exponentially
- A sum-product estimate in algebraic division algebras
- General position subsets and independent hyperplanes in d-space
- Some remarks on the asymmetric sum-product phenomenon
- A family of four-variable expanders with quadratic growth
- Growth in \(\mathrm{SL}_3(\mathbb Z/p\mathbb Z)\).
- On lines, joints, and incidences in three dimensions
- A note on distinct distance subsets
- Equal entries in totally positive matrices
- Forbidden paths and cycles in ordered graphs and matrices
- A semi-algebraic version of Zarankiewicz's problem
- A survey of Sylvester's problem and its generalizations
- On bipartite distinct distances in the plane
- On sums and products of combinatorial cubes
- Uniform distribution and geometric incidence theory
- Beyond birthday bound secure fresh rekeying: application to authenticated encryption
- The Szemerédi-Trotter theorem in the complex plane
- A restriction estimate using polynomial partitioning
- Difference sets are not multiplicatively closed
- Generalizations of the Szemerédi-Trotter theorem
- Incidence bounds for block designs
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- scientific article; zbMATH DE number 4015582 (Why is no real title available?)
- Arrangements of equal minors in the positive Grassmannian
- Graphs with large obstacle numbers
- An explicit incidence theorem in F_p
- A further study for the upper bound of the cardinality of Farey vertices and application in discrete geometry
- On the number of rich lines in high dimensional real vector spaces
This page was built for publication: Extremal problems in discrete geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794651)