An inequality in the geometry of numbers
From MaRDI portal
Publication:775609
DOI10.1007/BF02559533zbMATH Open0106.26201MaRDI QIDQ775609FDOQ775609
Authors: N. Oler
Publication date: 1961
Published in: Acta Mathematica (Search for Journal in Brave)
Lattices and convex bodies (number-theoretic aspects) (11H06) Lattice packing and covering (number-theoretic aspects) (11H31)
Cites Work
Cited In (19)
- Packings, sausages and catastrophes
- Self-packing of centrally symmetric convex bodies in \(\mathbb{R}{}^ 2\)
- Bounds for totally separable translative packings in the plane
- About four‐ball packings
- A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network
- Packings of equal disks in a square torus
- Sausages are good packings
- On two finite covering problems of Bambah, Rogers, Woods and Zassenhaus
- From a packing problem to quantitative recurrence in \([0,1]\) and the Lagrange spectrum of interval exchanges
- Packing, covering and tiling in two-dimensional spaces
- Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs
- Constant-approximation for optimal data aggregation with physical interference
- Title not available (Why is that?)
- A NEW PROOF FOR ZASSENHAUS–GROEMER–OLER INEQUALITY
- Penny-packing and two-dimensional codes
- A counterpart to Oler's lattice‐point theorem
- Title not available (Why is that?)
- On generalized Minkowski arrangements
- Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs
This page was built for publication: An inequality in the geometry of numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q775609)