Document Type

Article

Publication Date

9-22-2017

Department

Mathematics

Abstract

We extend the famous diophantine Frobenius problem to a ring 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 ℤ to k[t] and give an algorithm to solve the Frobenius problem for polynomials over a field k of sufficiently large size.

Required Publisher's Statement

Original version online at https://projecteuclid.org/euclid.rmjm/1506045620#abstract

Share

COinS