Pages that link to "Item:Q1112339"
From MaRDI portal
The following pages link to Covering minima and lattice-point-free convex bodies (Q1112339):
Displaying 46 items.
- Isosystolic inequalities for optical hypersurfaces (Q305748) (← links)
- Homometry and direct-sum decompositions of lattice-convex sets (Q306515) (← links)
- On integer programming with bounded determinants (Q315478) (← links)
- A randomized sieving algorithm for approximate integer programming (Q486990) (← links)
- Inequalities for the lattice width of lattice-free convex sets in the plane (Q664191) (← links)
- The probability that a convex body intersects the integer lattice in a \(k\)-dimensional set (Q664357) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Minkowski's successive minima and the zeros of a convexity-function (Q748898) (← links)
- Covering convex bodies by cylinders and lattice points by flats (Q836226) (← links)
- An optimal lower bound for the Frobenius problem (Q868899) (← links)
- Reverse split rank (Q896287) (← links)
- Successive-minima-type inequalities (Q1209840) (← links)
- Test sets of integer programs (Q1298753) (← links)
- Lattice-free polytopes and their diameter (Q1346126) (← links)
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\) (Q1346139) (← links)
- Diophantine approximation of matrices (Q1359157) (← links)
- A discrete version of Koldobsky's slicing inequality (Q1686312) (← links)
- A linear algorithm for integer programming in the plane (Q1771307) (← links)
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\). II: Application of \(K\)-convexity (Q1816418) (← links)
- A Minkowski-type theorem for covering minima in the plane (Q1900039) (← links)
- Covering sets for plane lattices (Q1915338) (← links)
- On the number of lattice free polytopes (Q1964651) (← links)
- On the maximal width of empty lattice simplices (Q1964652) (← links)
- A local maximizer for lattice width of 3-dimensional hollow bodies (Q2028093) (← links)
- The covering radius and a discrete surface area for non-hollow simplices (Q2066303) (← links)
- Computing the covering radius of a polytope with an application to lonely runners (Q2095112) (← links)
- Interpolating between volume and lattice point enumerator with successive minima (Q2155979) (← links)
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming (Q2248762) (← links)
- Mahler's work on the geometry of numbers (Q2279216) (← links)
- On the rational polytopes with Chvátal rank 1 (Q2288183) (← links)
- Successive minima of line bundles (Q2308301) (← links)
- Largest integral simplices with one interior integral point: solution of Hensley's conjecture and related results (Q2359925) (← links)
- On densities of lattice arrangements intersecting every \(i\)-dimensional affine subspace (Q2411827) (← links)
- The simultaneous packing and covering constants in the plane (Q2427565) (← links)
- Lattice-point enumerators of ellipsoids (Q2439839) (← links)
- Asymptotically saturated toric algebras (Q2471136) (← links)
- Generalized flatness constants, spanning lattice polytopes, and the Gromov width (Q2686594) (← links)
- Corrigendum to: ``Successive minima of line bundles'' (Q2699222) (← links)
- From deep holes to free planes (Q3148680) (← links)
- The finiteness threshold width of lattice polytopes (Q3389399) (← links)
- Classification of empty lattice 4-simplices of width larger than two (Q4633635) (← links)
- Hollow polytopes of large width (Q5210954) (← links)
- Some new examples of recurrence and non-recurrence sets for products of rotations on the unit circle (Q5408239) (← links)
- EXPECTED MEAN WIDTH OF THE RANDOMIZED INTEGER CONVEX HULL (Q6072653) (← links)
- Extending Gromov's optimal systolic inequality (Q6076422) (← links)
- Some questions related to the reverse Minkowski theorem (Q6198650) (← links)
