Integer points in knapsack polytopes and \(s\)-covering radius (Q1953532)

Summary: Given a matrix \(A\in \mathbb{Z}^{m\times n}\) satisfying certain regularity assumptions, we consider for a positive integer \(s\) the set \(\mathcal F_s(A)\subset \mathbb Z^m\) of all vectors \(b\in \mathbb Z^m\) such that the associated knapsack polytope \(P(A, b)=\{ x \in \mathbb{R}^n_{\geq 0}: A x= b\}\) contains at least \(s\) integer points. We present lower and upper bounds on the so called diagonal \(s\)-Frobenius number associated to the set \(\mathcal F_s(A)\). In the case \(m=1\) we prove an optimal lower bound for the \(s\)-Frobenius number, which is the largest integer \(b\) such that \(P(A,b)\) contains less than \(s\) integer points.