Bounds on generalized Frobenius numbers
From MaRDI portal
Publication:627922
DOI10.1016/j.ejc.2010.11.001zbMath1239.11024arXiv1008.4937OpenAlexW1994070336MaRDI QIDQ627922
Lenny Fukshansky, Achill Schürmann
Publication date: 4 March 2011
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.4937
Related Items (6)
The generalized Frobenius problem via restricted partition functions ⋮ Integer points in knapsack polytopes and \(s\)-covering radius ⋮ Factorization length distribution for affine semigroups. II: Asymptotic behavior for numerical semigroups with arbitrarily many generators ⋮ On the number of integer points in translated and expanded polyhedra ⋮ Positive semigroups and generalized Frobenius numbers over totally real number fields ⋮ An Approximation of Theta Functions with Applications to Communications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The multidimensional Frobenius problem
- An optimal lower bound for the Frobenius problem
- Frobenius problem and the covering radius of a lattice
- A generalization of the integer linear infeasibility problem
- A Blichfeldt-type inequality for the surface area
- The number of solutions of bounded height to a system of linear equations
- A generalization of Steinhagen's theorem
- Unbounded Discrepancy in Frobenius Numbers
- Feasibility of Integer Knapsacks
- An Extreme Family of Generalized Frobenius Numbers
- An Introduction to the Geometry of Numbers
- Computing the Continuous Discretely
- An upper bound for the h-range of the postage stamp problem
- On a Principle of Lipschitz
This page was built for publication: Bounds on generalized Frobenius numbers