On a Frobenius problem for polynomials

From MaRDI portal




Abstract: We extend the famous diophantine Frobenius problem to the case of polynomials over a field k. Similar to the classical problem, we show that the n=2 case of the Frobenius problem for polynomials is easy to solve. In addition, we translate a few results from the Frobenius problem over mathbbZ to k[t] and give an algorithm to solve the Frobenius problem for polynomials over a field k of sufficiently large size.









This page was built for publication: On a Frobenius problem for polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409607)