Extremal problems in discrete geometry
From MaRDI portal
Publication:794651
DOI10.1007/BF02579194zbMath0541.05012OpenAlexW2166961358WikidataQ56454601 ScholiaQ56454601MaRDI QIDQ794651
Publication date: 1983
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579194
Other designs, configurations (05B30) Enumerative combinatorics (05A99) Euclidean geometries (general) and generalizations (51M05)
Related Items (only showing first 100 items - show all)
On counting point-hyperplane incidences ⋮ Incidences between Euclidean spaces over finite fields ⋮ Two results about points, lines and planes ⋮ A note on the minimum number of red lines needed to pierce the intersections of blue lines ⋮ The Szemerédi-Trotter theorem in the complex plane ⋮ Additive combinatorics and graph theory ⋮ Two theorems on point-flat incidences ⋮ Joints of varieties ⋮ Generalizations of the Szemerédi-Trotter theorem ⋮ Restriction and Kakeya phenomena for finite fields ⋮ On the number of directions determined by a three-dimensional points set ⋮ Finding degeneracies among sets of lines ⋮ Arrangements of equal minors in the positive Grassmannian ⋮ A further study for the upper bound of the cardinality of Farey vertices and application in discrete geometry ⋮ Two combinatorial problems in the plane ⋮ On the number of rich lines in high dimensional real vector spaces ⋮ An \(n\)-in-a-row type game ⋮ Bisector energy and few distinct distances ⋮ Multiplicities of interpoint distances in finite planar sets ⋮ Areas of triangles and Beck's theorem in planes over finite fields ⋮ Rich cells in an arrangement of hyperplanes ⋮ A crossing lemma for Jordan curves ⋮ Book review of: L. Guth, Polynomial methods in combinatorics ⋮ Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs ⋮ The exact fitting problem in higher dimensions ⋮ An improved bound on the number of unit area triangles ⋮ A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane ⋮ On the energy variant of the sum-product conjecture ⋮ Lines, line-point incidences and crossing families in dense sets ⋮ Crossing by lines all edges of a line arrangement ⋮ On the Minkowski distances and products of sum sets ⋮ A note on visibility-constrained Voronoi diagrams ⋮ A refined energy bound for distinct perpendicular bisectors ⋮ A crossing lemma for multigraphs ⋮ Crossings in grid drawings ⋮ Progress on Dirac's conjecture ⋮ A pseudoline counterexample to the strong Dirac conjecture ⋮ Incidence bounds on multijoints and generic joints ⋮ Higher moments of convolutions ⋮ An improved incidence bound for fields of prime order ⋮ On the existence of ordinary triangles ⋮ On the number of touching pairs in a set of planar curves ⋮ Sum-product phenomena for planar hypercomplex numbers ⋮ On the few products, many sums problem ⋮ Distinct distances between points and lines ⋮ Incidences between points and lines on two- and three-dimensional varieties ⋮ New results for the growth of sets of real numbers ⋮ On distinct sums and distinct distances. ⋮ Combinatorial complexity bounds for arrangements of curves and spheres ⋮ An incidence theorem in higher dimensions ⋮ Covering lattice points by subspaces and counting point-hyperplane incidences ⋮ On totally positive matrices and geometric incidences ⋮ A bichromatic incidence bound and an application ⋮ Partitioning arrangements of lines. II: Applications ⋮ Tight bounds on a problem of lines and intersections ⋮ The complexity of point configurations ⋮ Szemerédi-Trotter-type theorems in dimension 3 ⋮ On the Erdős distinct distances problem in the plane ⋮ Repeated angles in the plane and related problems ⋮ The number of different distances determined by a set of points in the Euclidean plane ⋮ On locally Gabriel geometric graphs ⋮ Counting facets and incidences ⋮ Highly incidental patterns on a quadratic hypersurface in \(\mathbb{R}^4\) ⋮ New results on sums and products in \(\mathbb{R}\) ⋮ Counting and cutting cycles of lines and rods in space ⋮ On the number of incidences between points and planes in three dimensions ⋮ A note on the weak Dirac conjecture ⋮ Incidences between points and lines in \({\mathbb {R}}^4\) ⋮ A bipartite strengthening of the crossing Lemma ⋮ On rich lines in grids ⋮ Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique ⋮ On grids in point-line arrangements in the plane ⋮ The complexity and construction of many faces in arrangements of lines and of segments ⋮ The complexity of many cells in arrangements of planes and related problems ⋮ Zarankiewicz's problem for semi-algebraic hypergraphs ⋮ The number of unit-area triangles in the plane: theme and variation ⋮ Point-curve incidences in the complex plane ⋮ Incidences with curves in \(\mathbb{R}^d\) ⋮ On differences of multiplicative functions and solutions of the equation \(n-\varphi(n)=c\) ⋮ Approximate input sensitive algorithms for point pattern matching ⋮ Planar point sets determine many pairwise crossing segments ⋮ A Szemerédi-Trotter type theorem in \(\mathbb R^4\) ⋮ Degenerate crossing numbers ⋮ Locating a robot with angle measurements ⋮ 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 ⋮ Graphs drawn with few crossings per edge ⋮ Bounded \(VC\)-dimension implies the Schur-Erdős conjecture ⋮ On linear combinatorics. I: Concurrency---an algebraic approach ⋮ Distinct distances in planar point sets with forbidden 4-point patterns ⋮ Incidences between points and curves with almost two degrees of freedom ⋮ Extremal problems on triangle areas in two and three dimensions ⋮ A point-conic incidence bound and applications over \(\mathbb{F}_p\) ⋮ Convexity and sumsets ⋮ Counting problems relating to a theorem of Dirichlet ⋮ On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry ⋮ A polynomial bound in Freiman's theorem. ⋮ On the number of circles determined by \(n\) points in the Euclidean plane ⋮ New results on the Erdős-Szemerédi sum-product problems.
Cites Work
This page was built for publication: Extremal problems in discrete geometry
