## Rocky Mountain Journal of Mathematics

### On a Frobenius problem for polynomials

#### 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 $\mathbb{Z}$ to $k[t]$ and give an algorithm to solve the Frobenius problem for polynomials over a field $k$ of sufficiently large size.

#### Article information

Source
Rocky Mountain J. Math., Volume 47, Number 5 (2017), 1427-1462.

Dates
First available in Project Euclid: 22 September 2017

https://projecteuclid.org/euclid.rmjm/1506045620

Digital Object Identifier
doi:10.1216/RMJ-2017-47-5-1427

Mathematical Reviews number (MathSciNet)
MR3705760

Zentralblatt MATH identifier
06790021

#### Citation

Conceição, R.; Gondim, R.; Rodriguez, M. On a Frobenius problem for polynomials. Rocky Mountain J. Math. 47 (2017), no. 5, 1427--1462. doi:10.1216/RMJ-2017-47-5-1427. https://projecteuclid.org/euclid.rmjm/1506045620

#### References

• J.L. Ramírez Alfonsín, The Diophantine Frobenius problem, Oxford Math. Appl. 30, Oxford University Press, Oxford, 2005.
• Michael Rosen, Number theory in function fields, Grad. Texts Math. 210, Springer-Verlag, New York, 2002.
• D.S. Thakur, Function field arithmetic, World Scientific Publishing Co., Inc., River Edge, NJ, 2004.
• Pete L. Clark, Covering numbers in linear algebra, Amer. Math. Month. 119 (2012), 65–67.
• J.J. Sylvester, On subvariants, i.e. semi-invariants to binary quantics of an unlimited order, Amer. J. Math. 5 (1882), 79–136.