Generalized Frobenius numbers: bounds and average behavior
From MaRDI portal
Abstract: We produce new upper and lower bounds for the s-Frobenius number by relating it to the so called s-covering radius of a certain convex body with respect to a certain lattice; this generalizes a well-known theorem of R. Kannan for the classical Frobenius number. Using these bounds, we obtain results on the average behavior of the s-Frobenius number, extending analogous recent investigations for the classical Frobenius number by a variety of authors. We also derive bounds on the s-covering radius, an interesting geometric quantity in its own right.
Recommendations
- Bounds on generalized Frobenius numbers
- An extreme family of generalized Frobenius numbers
- Some estimated formulas for the Frobenius numbers
- scientific article; zbMATH DE number 2084918
- An optimal lower bound for the Frobenius problem
- scientific article; zbMATH DE number 1112790
- The Frobenius number associated with the number of representations for sequences of repunits
- Extremal Frobenius numbers in a class of sets
- On a generalization of the coin exchange problem for three variables
- Every positive integer is the Frobenius number of a numerical semigroup with three generators
Cited in
(10)- Commutative algebra of generalised Frobenius numbers
- The upper bound of Frobenius related length functions
- Integer points in knapsack polytopes and s-covering radius
- Positive semigroups and generalized Frobenius numbers over totally real number fields
- Integer knapsacks: average behavior of the Frobenius numbers
- Symmetric semigroups with three generators
- A note on lower bounds for Frobenius traces
- Expected Frobenius numbers
- The generalized Frobenius problem via restricted partition functions
- Bounds on generalized Frobenius numbers
This page was built for publication: Generalized Frobenius numbers: bounds and average behavior
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2919666)