Extremal problems in discrete geometry

From MaRDI portal
Publication:794651

DOI10.1007/BF02579194zbMath0541.05012OpenAlexW2166961358WikidataQ56454601 ScholiaQ56454601MaRDI QIDQ794651

William T. jun. Trotter, Endre Szemerédi

Publication date: 1983

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579194




Related Items

On counting point-hyperplane incidencesIncidences between Euclidean spaces over finite fieldsTwo results about points, lines and planesA note on the minimum number of red lines needed to pierce the intersections of blue linesThe Szemerédi-Trotter theorem in the complex planeAdditive combinatorics and graph theoryTwo theorems on point-flat incidencesJoints of varietiesGeneralizations of the Szemerédi-Trotter theoremRestriction and Kakeya phenomena for finite fieldsOn the number of directions determined by a three-dimensional points setFinding degeneracies among sets of linesArrangements of equal minors in the positive GrassmannianA further study for the upper bound of the cardinality of Farey vertices and application in discrete geometryTwo combinatorial problems in the planeOn the number of rich lines in high dimensional real vector spacesAn \(n\)-in-a-row type gameBisector energy and few distinct distancesMultiplicities of interpoint distances in finite planar setsAreas of triangles and Beck's theorem in planes over finite fieldsRich cells in an arrangement of hyperplanesA crossing lemma for Jordan curvesBook review of: L. Guth, Polynomial methods in combinatoricsSphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairsThe exact fitting problem in higher dimensionsAn improved bound on the number of unit area trianglesA solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the planeOn the energy variant of the sum-product conjectureLines, line-point incidences and crossing families in dense setsCrossing by lines all edges of a line arrangementOn the Minkowski distances and products of sum setsA note on visibility-constrained Voronoi diagramsA refined energy bound for distinct perpendicular bisectorsA crossing lemma for multigraphsCrossings in grid drawingsProgress on Dirac's conjectureA pseudoline counterexample to the strong Dirac conjectureIncidence bounds on multijoints and generic jointsHigher moments of convolutionsAn improved incidence bound for fields of prime orderOn the existence of ordinary trianglesOn the number of touching pairs in a set of planar curvesSum-product phenomena for planar hypercomplex numbersOn the few products, many sums problemDistinct distances between points and linesIncidences between points and lines on two- and three-dimensional varietiesNew results for the growth of sets of real numbersOn distinct sums and distinct distances.Combinatorial complexity bounds for arrangements of curves and spheresAn incidence theorem in higher dimensionsCovering lattice points by subspaces and counting point-hyperplane incidencesOn totally positive matrices and geometric incidencesA bichromatic incidence bound and an applicationPartitioning arrangements of lines. II: ApplicationsTight bounds on a problem of lines and intersectionsThe complexity of point configurationsSzemerédi-Trotter-type theorems in dimension 3On the Erdős distinct distances problem in the planeRepeated angles in the plane and related problemsThe number of different distances determined by a set of points in the Euclidean planeOn locally Gabriel geometric graphsCounting facets and incidencesHighly 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 spaceOn the number of incidences between points and planes in three dimensionsA note on the weak Dirac conjectureIncidences between points and lines in \({\mathbb {R}}^4\)A bipartite strengthening of the crossing LemmaOn rich lines in gridsSimple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning techniqueOn grids in point-line arrangements in the planeThe complexity and construction of many faces in arrangements of lines and of segmentsThe complexity of many cells in arrangements of planes and related problemsZarankiewicz's problem for semi-algebraic hypergraphsThe number of unit-area triangles in the plane: theme and variationPoint-curve incidences in the complex planeIncidences 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 matchingPlanar point sets determine many pairwise crossing segmentsA Szemerédi-Trotter type theorem in \(\mathbb R^4\)Degenerate crossing numbersLocating a robot with angle measurementsThe maximum number of unit distances in a convex \(n\)-gonCounting \(k\)-projections of a point setNew lower bounds for Hopcroft's problemGraphs drawn with few crossings per edgeBounded \(VC\)-dimension implies the Schur-Erdős conjectureOn linear combinatorics. I: Concurrency---an algebraic approachDistinct distances in planar point sets with forbidden 4-point patternsIncidences between points and curves with almost two degrees of freedomExtremal problems on triangle areas in two and three dimensionsA point-conic incidence bound and applications over \(\mathbb{F}_p\)Convexity and sumsetsCounting problems relating to a theorem of DirichletOn the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometryA polynomial bound in Freiman's theorem.On the number of circles determined by \(n\) points in the Euclidean planeNew results on the Erdős-Szemerédi sum-product problems.On the multiplicative Chung-Diaconis-Graham processInteractions of computational complexity theory and mathematicsKaufman and Falconer estimates for radial projections and a continuum version of Beck's theoremAdditive structure in convex translatesOn the number of unit-area triangles spanned by convex grids in the planeTurán-type results for intersection graphs of boxesOn the Origins, Nature, and Impact of Bourgain’s Discretized Sum-Product TheoremOn empty convex polygons in a planar point setSzemer\'{e}di-Trotter type results in arbitrary finite fieldsA semi-algebraic version of Zarankiewicz's problemBounds on Point Configurations Determined by Distances and Dot ProductsRegularity lemmas for hypergraphs and quasi-randomnessOn graphs and algebraic graphs that do not contain cycles of length 4Incidences with Curves in ℝ dIterated point-line configurations grow doubly-exponentiallyOn Subgraphs of Bounded Degeneracy in HypergraphsA sum-product estimate in algebraic division algebrasA survey of Sylvester's problem and its generalizationsNon-commutative methods in additive combinatorics and number theoryA NOTE ON RICH LINES IN TRULY HIGH DIMENSIONAL SETSThe Multivariate Schwartz--Zippel LemmaCounting and Cutting Rich Lenses in Arrangements of CirclesGeneral position subsets and independent hyperplanes in \(d\)-spaceOn bipartite distinct distances in the planeOn sums and products of combinatorial cubesFalconer-type estimates for dot productsUnnamed ItemAn update on the sum-product problemUniform distribution and geometric incidence theoryRamsey numbers of semi-algebraic and semi-linear hypergraphsOn the growth rate in SL2(Fp)${\rm SL_2}(\mathbb {F}_p)$, the affine group and sum‐product type implicationsSome remarks on the asymmetric sum-product phenomenonA family of four-variable expanders with quadratic growthImproved Elekes-Szabó type estimates using proximityConcentration estimates for algebraic intersectionsClassification of maps sending lines into translates of a curveThe centroid of points with approximate weightsPinned algebraic distances determined by Cartesian products in 𝔽_{𝕡}²The constant of point-line incidence constructionsIncidences of cubic curves in finite fieldsA structural Szemerédi-Trotter theorem for Cartesian productsJoints tightenedAN INCIDENCE RESULT FOR WELL-SPACED ATOMS IN ALL DIMENSIONSAngle chains and pinned variantsOn the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-SpaceGrowth in \(\mathrm{SL}_3(\mathbb Z/p\mathbb Z)\).On lines, joints, and incidences in three dimensionsBeyond birthday bound secure fresh rekeying: application to authenticated encryptionOn the Richter–Thomassen Conjecture about Pairwise Intersecting Closed CurvesSmall Union with Large Set of CentersExtending Erdős-Beck's theorem to higher dimensionsSome remarks on sets with small quotient setThe polynomial method over varietiesOn popular sums and differences for sets with small multiplicative doublingOn a Question of Bourgain about Geometric IncidencesA note on distinct distance subsetsModular hyperbolas and bilinear forms of Kloosterman sumsNEW RESULTS ON SUM‐PRODUCT TYPE GROWTH OVER FIELDSResearch problemsEqual entries in totally positive matricesHirzebruch-type inequalities viewed as tools in combinatoricsEmbedding Graphs into Larger Graphs: Results, Methods, and ProblemsA Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have?Zarankiewicz’s problem for semilinear hypergraphsSchwartz-Zippel bounds for two-dimensional productsModel-theoretic Elekes–Szabó in the strongly minimal caseOn discrete values of bilinear formsOn the number of discrete chainsForbidden paths and cycles in ordered graphs and matricesHow to find groups?Radial points in the planeGraphs with Large Obstacle NumbersA restriction estimate using polynomial partitioningIncidences in Three Dimensions and Distinct Distances in the PlaneA Bipartite Strengthening of the Crossing LemmaPolynomial partitioning on varieties of codimension two and point-hypersurface incidences in four dimensionsAN EXPLICIT INCIDENCE THEOREM INSome remarks on products of sets in the Heisenberg group and in the affine groupJoints formed by lines and a $k$-plane, and a discrete estimate of Kakeya typeCutting lemma and Zarankiewicz's problem in distal structuresOn Grids in Point-Line Arrangements in the PlaneDifference sets are not multiplicatively closedIncidence Bounds for Block DesignsALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCESGeometric incidence theorems via Fourier analysisClassification theorem for strong triangle blocking arrangementsOn Sumsets of Convex SetsRepresentation Complexities of SemiAlgebraic GraphsAdditive Combinatorics: With a View Towards Computer Science and Cryptography—An ExpositionThe discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and TverbergBounds of trilinear and quadrilinear exponential sumsFrom harmonic analysis to arithmetic combinatoricsVariations on the Sum-Product ProblemThe Uniformity Conjecture in Additive CombinatoricsHasse diagrams with large chromatic numberGrowth in groups: ideas and perspectivesOn growth in an abstract planeDistinct distance estimates and low degree polynomial partitioningNew Results on Linear Size Distance PreserversThree-point configurations determined by subsets of \({\mathbb{F}_q}^2\) via the Elekes-Sharir paradigmOn the packing dimension and category of exceptional sets of orthogonal projectionsThe proof of the \(l^2\) decoupling conjectureA crossing lemma for multigraphs



Cites Work