Convexity in cristallographical lattices
From MaRDI portal
Publication:2555320
Cited in
(51)- Lattice-free polytopes and their diameter
- Convex analysis and duality over discrete domains
- Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem
- A quantitative Doignon-Bell-Scarf theorem
- Transversal numbers for hypergraphs arising in geometry
- A fractional Helly theorem for convex lattice sets
- On the number of lattice free polytopes
- Quantitative \((p, q)\) theorems in combinatorial geometry
- Discrete quantitative Helly-type theorems with boxes
- Discrete Helly-type theorems for pseudohalfplanes
- Constructing lattice-free gradient polyhedra in dimension two
- The geometry and combinatorics of discrete line segment hypergraphs
- Piercing numbers in approval voting
- A geometric approach to cut-generating functions
- Tight bounds on discrete quantitative Helly numbers
- Quantitative Tverberg theorems over lattices and other discrete sets
- Certificates of linear mixed integer infeasibility
- Two-halfspace closure
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
- A generalization of the discrete version of Minkowski's fundamental theorem
- Maximal S-free convex sets and the Helly number
- Transversal numbers over subsets of linear spaces
- Helly’s theorem: New variations and applications
- Duality for mixed-integer convex minimization
- Helly numbers of polyominoes
- scientific article; zbMATH DE number 60859 (Why is no real title available?)
- Strengthening lattice-free cuts using non-negativity
- 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’s theorem is 50 years old: A survey
- Convex analysis in \(\mathbb{Z}^n\) and applications to integer linear programming
- Optimality conditions in discrete-continuous nonlinear optimization
- Tverberg theorems over discrete sets of points
- A mélange of diameter Helly-type theorems
- Constructing lattice-free gradient polyhedra in dimension two
- 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
- Helly-type problems
- scientific article; zbMATH DE number 7662166 (Why is no real title available?)
- Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube
- Complexity of optimizing over the integers
- On Helly numbers of exponential lattices
- Beyond chromatic threshold via (p,q)-theorem, and blow-up phenomenon
- Midpoints of vertex pairs of convex polytopes
- The prime grid contains arbitrarily large empty polygons
- Extensions of discrete Helly theorems for boxes
- Discrete convex subdifferentials and optimality
- Title not available (Why is no real title available?)
- Lifting properties of maximal lattice-free polyhedra
- Discrete and lexicographic Helly-type theorems
- Turán theorems and convexity invariants for directed graphs
This page was built for publication: Convexity in cristallographical lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2555320)
