Convexity in cristallographical lattices
From MaRDI portal
Publication:2555320
DOI10.1007/BF01949705zbMath0245.52004MaRDI QIDQ2555320
Publication date: 1973
Published in: Journal of Geometry (Search for Journal in Brave)
Helly-type theorems and geometric transversal theory (52A35) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items
Tight bounds on discrete quantitative Helly numbers, Transversal numbers over subsets of linear spaces, Constructing Lattice-Free Gradient Polyhedra in Dimension Two, Duality for mixed-integer convex minimization, Lattice-free polytopes and their diameter, Convex analysis and duality over discrete domains, Helly numbers of polyominoes, The geometry and combinatorics of discrete line segment hypergraphs, Quantitative Tverberg theorems over lattices and other discrete sets, Unnamed Item, Lifting properties of maximal lattice-free polyhedra, Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube, Complexity of optimizing over the integers, On Helly numbers of exponential lattices, Two-halfspace closure, Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem, Strengthening lattice-free cuts using non-negativity, Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting), Unnamed Item, Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem, Helly’s theorem: New variations and applications, On the number of lattice free polytopes, Discrete and lexicographic Helly-type theorems, Turán theorems and convexity invariants for directed graphs, A quantitative Doignon-Bell-Scarf theorem, Quantitative \((p, q)\) theorems in combinatorial geometry, Tverberg’s theorem is 50 years old: A survey, Discrete quantitative Helly-type theorems with boxes, Certificates of linear mixed integer infeasibility, Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization, Unnamed Item, Convex Analysis in $\mathbb{Z}^n$ and Applications to Integer Linear Programming, A GENERALIZATION OF THE DISCRETE VERSION OF MINKOWSKI'S FUNDAMENTAL THEOREM, Discrete Helly-type theorems for pseudohalfplanes, Maximal $S$-Free Convex Sets and the Helly Number, The topological structure of maximal lattice free convex bodies: The general case, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Tverberg theorems over discrete sets of points, A Mélange of Diameter Helly-Type Theorems, Piercing numbers in approval voting, A geometric approach to cut-generating functions, Helly-type problems, Transversal numbers for hypergraphs arising in geometry, A fractional Helly theorem for convex lattice sets, Constructing lattice-free gradient polyhedra in dimension two
Cites Work
