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 . Similar to the classical problem, we show that the case of the Frobenius problem for polynomials is easy to solve. In addition, we translate a few results from the Frobenius problem over to and give an algorithm to solve the Frobenius problem for polynomials over a field of sufficiently large size.
Recommendations
Cited in
(9)- The polynomial part of a restricted partition function related to the Frobenius problem
- Frobenius problems in integral domains
- scientific article; zbMATH DE number 5798475 (Why is no real title available?)
- Kronecker's theorem and Lehmer's problem for polynomials in several variables
- scientific article; zbMATH DE number 5082324 (Why is no real title available?)
- The parametric Frobenius problem
- New Computational Paradigms
- Solving thousand-digit Frobenius problems using Gröbner bases
- The Frobenius problem over number fields with a real embedding
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)