Positive-fraction intersection results and variations of weak epsilon-nets

DOI10.1007/S00605-016-0892-2MaRDI QIDQ527009zbMATH OpenOpenAlexFDO

Authors Pablo Soberón, Alexander Magazinov

Publication date 15 May 2017

Published in Monatshefte für Mathematik (Search for Journal in Brave)

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

zbMATH Keywords

positive fraction intersectionselection theoremweak epsilon-nets

Mathematics Subject Classification ID

Length, area, volume and convex sets (aspects of convex geometry) (52A38) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30) Helly-type theorems and geometric transversal theory (52A35)

Abstract: Given a finite set $X$ of points in $R^n$ and a family $F$ of sets generated by the pairs of points of $X$, we determine volumetric and structural conditions for the sets that allow us to guarantee the existence of a positive-fraction subfamily $F^{\prime }$ of $F$ for which the sets have non-empty intersection. This allows us to show the existence of weak epsilon-nets for these families. We also prove a topological variation of the existence of weak epsilon-nets for convex sets.

Recommendations

• Improved bounds on weak \(\varepsilon\)-nets for convex sets
• Point Selections and Weak ε-Nets for Convex Hulls
• New constructions of weak epsilon-nets
• New constructions of weak -nets
• A lower bound for weak \(\varepsilon\)-nets in high dimension

Cites work

• scientific article; zbMATH DE number 1749054 (Why is no real title available?)
• A Generalization of Radon's Theorem
• A Problem of Geometry in R n
• A Theorem on General Measure
• A Tverberg-type result on multicolored simplices
• A generalization of Caratheodory's theorem
• A new lower bound based on Gromov's method of selecting heavily covered points
• A point in many triangles
• A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem
• A slight improvement to the colored Bárány's theorem
• An extension of the Erdős-Szekeres theorem on large angles
• Computing the volume is difficult
• Covering with Euclidean boxes
• Improved bounds on weak \(\varepsilon\)-nets for convex sets
• New constructions of weak \(\varepsilon\)-nets
• On Gromov's method of selecting heavily covered points
• On a Topological Generalization of a Theorem of Tverberg
• Overlap properties of geometric expanders
• Point Selections and Weak ε-Nets for Convex Hulls
• Quantitative \((p, q)\) theorems in combinatorial geometry
• Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
• Stabbing simplices by points and flats
• The number of triangles covering the center of an \(n\)-set
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler

Cited in

(5)

• Intersecting diametral balls induced by a geometric graph
• Tverberg partitions as weak epsilon-nets
• Tverberg’s theorem is 50 years old: A survey
• Tverberg's theorem, disks, and Hamiltonian cycles
• Weak ε-nets and interval chains

This page was built for publication: Positive-fraction intersection results and variations of weak epsilon-nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q527009)