Commutative algebra and the linear Diophantine problem of Frobenius
From MaRDI portal
Abstract: Let be a finite set of relatively prime positive integers, and let be the set of all nonnegative integral linear combinations of elements of . The set is a semigroup that contains all sufficiently large integers. The largest integer not in is the Frobenius number of , and the number of positive integers not in is the genus of . Sharp and Sylvester proved in 1884 that the Frobenius number of the set is , and that the genus of is . Graded rings and a simple form of Hilbert's syzygy theorem are used to give a commutative algebra proof of this result.
Recommendations
Cites work
- Analytic representations in the three-dimensional Frobenius problem
- Arithmetical turbulence of selfsimilar fluctuations statistics of large Frobenius numbers of additive semigroups of integers
- Cyclotomic numerical semigroups.
- Frobenius problem and the covering radius of a lattice
- Frobenius vectors, Hilbert series and gluings of affine semigroups.
- Geometry and growth rate of Frobenius numbers of additive semigroups
- scientific article; zbMATH DE number 6084400 (Why is no real title available?)
- scientific article; zbMATH DE number 2229032 (Why is no real title available?)
- Integer knapsacks: average behavior of the Frobenius numbers
- Integer matrices, sublattices of Z^m, and Frobenius numbers
- Limit behaviour of large Frobenius numbers
- Numerical semigroups.
- On the limit distribution of Frobenius numbers
- The asymptotic distribution of Frobenius numbers
- Weak asymptotics in the 3-dim Frobenius problem
Cited in
(2)
This page was built for publication: Commutative algebra and the linear Diophantine problem of Frobenius
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5383242)