Transversal numbers over subsets of linear spaces
DOI10.1515/ADVGEOM.2011.028zbMATH Open1250.52006arXiv1002.0948OpenAlexW2963846964MaRDI QIDQ2891065FDOQ2891065
Authors: Gennadiy Averkov, Robert Weismantel
Publication date: 13 June 2012
Published in: Advances in Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1002.0948
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
integer latticelinear inequalitiesmixed integer programmingHelly's theoremRadon's theoremgeometric transversal theoryfractional Helly numbercertificates of infeasibility
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Mixed integer programming (90C11) Helly-type theorems and geometric transversal theory (52A35)
Cites Work
- Integer Programming with a Fixed Number of Variables
- Convexity in cristallographical lattices
- Transversal numbers for hypergraphs arising in geometry
- A fractional Helly theorem for convex lattice sets
- An observation on the structure of production sets with indivisibilities
- On the Geometry and Computational Complexity of Radon Partitions in the Iinteger Lattice
- Certificates of linear mixed integer infeasibility
Cited In (18)
- A quantitative Doignon-Bell-Scarf theorem
- Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization
- Maximal \(S\)-free convex sets and the Helly number
- Centerpoints: A Link Between Optimization and Convex Geometry
- Quantitative Tverberg theorems over lattices and other discrete sets
- Title not available (Why is that?)
- Duality for mixed-integer convex minimization
- Tverberg theorems over discrete sets of points
- Sublinear bounds for a quantitative Doignon-Bell-Scarf theorem
- Tight bounds on discrete quantitative Helly numbers
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Helly’s theorem: New variations and applications
- Complexity of optimizing over the integers
- Quantitative \((p, q)\) theorems in combinatorial geometry
- Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem
- The geometry and combinatorics of discrete line segment hypergraphs
- Centerpoints: a link between optimization and convex geometry
- On maximal \(S\)-free sets and the Helly number for the family of \(S\)-convex sets
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)