Improved bounds for the expected number of \(k\)-sets

DOI10.1007/s00454-022-00469-7zbMath1523.52024arXiv2106.04782OpenAlexW3169533302MaRDI QIDQ6050223

Brett Leroux, Luis Rademacher

Publication date: 12 October 2023

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.04782

zbMATH Keywords

geometric set systems\(k\)-set\(k\)-facetrandom point configurations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Geometric probability and stochastic geometry (60D05) Enumeration in graph theory (05C30) Erd?s problems and related topics of discrete geometry (52C10) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Erdős distinct distances problem in the plane
• Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
• On the transversal number and VC-dimension of families of positive homothets of a convex body
• On the expected number of \(k\)-sets
• On levels in arrangements of lines, segments, planes, and triangles
• Improved bounds for planar \(k\)-sets and related problems
• Generalized sandwich theorems
• A restriction estimate using polynomial partitioning
• Probability
• On the average complexity of the $k$-level
• Convex and Discrete Geometry
• Point sets with many k -sets
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• On the Betti Numbers of Real Varieties
• Polynomial Methods and Incidence Theory
• Convergence of stochastic processes
• Point sets with many \(k\)-sets

This page was built for publication: Improved bounds for the expected number of \(k\)-sets