Transversal numbers over subsets of linear spaces
From MaRDI portal
Abstract: Let be a subset of . It is an important question in the theory of linear inequalities to estimate the minimal number such that every system of linear inequalities which is infeasible over has a subsystem of at most inequalities which is already infeasible over This number is said to be the Helly number of In view of Helly's theorem, and, by the theorem due to Doignon, Bell and Scarf, We give a common extension of these equalities showing that We show that the fractional Helly number of the space (with the convexity structure induced by ) is at most as long as is finite. Finally we give estimates for the Radon number of mixed integer spaces.
Recommendations
- A characterization of linear spaces based on the number of transversals
- Transversals of total strict linear orders
- Linear spaces, transversal polymatroids and ASL domains
- scientific article; zbMATH DE number 970814
- Transitivity on ordered pairs of lines in finite linear spaces
- Classifications of finite highly transitive dimensional linear spaces
- Covering numbers in linear algebra
- The cross-space of linear transformations
- Point-transitive linear spaces
- Transversal numbers of translates of a convex body
Cites work
- A fractional Helly theorem for convex lattice sets
- An observation on the structure of production sets with indivisibilities
- Certificates of linear mixed integer infeasibility
- Convexity in cristallographical lattices
- Integer Programming with a Fixed Number of Variables
- On the Geometry and Computational Complexity of Radon Partitions in the Iinteger Lattice
- Transversal numbers for hypergraphs arising in geometry
Cited in
(20)- Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem
- A quantitative Doignon-Bell-Scarf theorem
- Quantitative \((p, q)\) theorems in combinatorial geometry
- The geometry and combinatorics of discrete line segment hypergraphs
- Tight bounds on discrete quantitative Helly numbers
- Quantitative Tverberg theorems over lattices and other discrete sets
- Maximal S-free convex sets and the Helly number
- On maximal S-free sets and the Helly number for the family of S-convex sets
- Helly’s theorem: New variations and applications
- Duality for mixed-integer convex minimization
- Centerpoints: A Link Between Optimization and Convex Geometry
- Sublinear bounds for a quantitative Doignon-Bell-Scarf theorem
- Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization
- Tverberg theorems over discrete sets of points
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Centerpoints: a link between optimization and convex geometry
- scientific article; zbMATH DE number 7662166 (Why is no real title available?)
- Complexity of optimizing over the integers
- The prime grid contains arbitrarily large empty polygons
- Extensions of discrete Helly theorems for boxes
This page was built for publication: Transversal numbers over subsets of linear spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891065)