An optimal lower bound for the Frobenius problem
From MaRDI portal
Publication:868899
DOI10.1016/j.jnt.2006.05.020zbMath1114.11025arXivmath/0512083OpenAlexW2063055635MaRDI QIDQ868899
Peter M. Gruber, Iskander M. Aliev
Publication date: 26 February 2007
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0512083
Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31) Linear Diophantine equations (11D04)
Related Items (14)
Unnamed Item ⋮ Unnamed Item ⋮ Integer matrices, sublattices of \(\mathbb Z^m\), and Frobenius numbers ⋮ Expected Frobenius numbers ⋮ Modular hyperbolas ⋮ Distances to lattice points in knapsack polyhedra ⋮ Operational state complexity of unary NFAs with finite nondeterminism ⋮ Bounds on generalized Frobenius numbers ⋮ Integer points in knapsack polytopes and \(s\)-covering radius ⋮ Diameters of random circulant graphs ⋮ The asymptotic distribution of Frobenius numbers ⋮ On the lattice programming gap of the group problems ⋮ Positive semigroups and generalized Frobenius numbers over totally real number fields ⋮ Effective limit distribution of the Frobenius numbers
Cites Work
- Frobenius problem and the covering radius of a lattice
- Covering minima and lattice-point-free convex bodies
- Lattice translates of a polytope and the Frobenius problem
- On the linear diophantine problem of Frobenius
- The Frobenius problem, rational polytopes, and Fourier-Dedekind sums
- A property of polynomials with an application to Siegel's lemma
- An upper bound for the h-range of the postage stamp problem
- Solution to a linear diophantine equation for nonnegative integers
- Bounds for a Linear Diophantine Problem of Frobenius
- On the linear diophantine problem of Frobenius.
- On a linear Diophantine problem of Frobenius.
- On a linear diophantine problem of Frobenius
- Sur la densité des réseaux de domaines convexes
- Unsolved problems in number theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An optimal lower bound for the Frobenius problem