Geometric set systems
From MaRDI portal
This survey is concerned with combinatorial properties of set systems \(\subseteq 2^X\) for a fixed set \(X\). One such important property, the so-called Vapnik-Červonenkis dimension, has found several applications in statistics (empirical processes), learning theory and program testing. The author reviews some general results of a combinatorial nature about set systems, and presents applications in geometric discrepancy theory, combinatorial geometry and computational geometry. For the entire collection see [Zbl 0893.00028].
Recommendations
- Geometric Set Theory
- Separated set-systems and their geometric models
- scientific article; zbMATH DE number 970821
- An introduction to geometric sets
- Geometric algebra for sets with betweenness relations
- Classification of sets satisfying the geometric characterization
- Geometry of convex sets
- scientific article; zbMATH DE number 4049856
- Geometric sets of permutations
- On partial covering for geometric set systems
Cited in
(10)- A simple proof of optimal epsilon nets
- Geometric systems of unbiased representatives
- Vapnik-Chervonenkis density in some theories without the independence property. I
- scientific article; zbMATH DE number 736296 (Why is no real title available?)
- Traces of hypergraphs
- Shatter functions with polynomial growth rates
- Tight lower bounds on the VC-dimension of geometric set systems
- scientific article; zbMATH DE number 970821 (Why is no real title available?)
- Geometrical sets with forbidden configurations
- A general approach for cache-oblivious range reporting and approximate range counting
This page was built for publication: Geometric set systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4208235)
