On a frobenius problem for polynomials

R. Conceição; R. Gondim; M. Rodriguez

doi:10.1216/RMJ-2017-47-5-1427

On a frobenius problem for polynomials

R. Conceição, R. Gondim, M. Rodriguez

Research output: Contribution to journal › Article › peer-review

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

Original language	English
Pages (from-to)	1427-1462
Number of pages	36
Journal	Rocky Mountain Journal of Mathematics
Volume	47
Issue number	5
DOIs	https://doi.org/10.1216/RMJ-2017-47-5-1427
State	Published - 2017
Externally published	Yes

Keywords

Arithmetic of function fields
Frobenius problem
Polynomials

Access to Document

10.1216/RMJ-2017-47-5-1427

Cite this

@article{196f1a73b2704f199c7bf40c2746ffba,

title = "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 Z to k[t] and give an algorithm to solve the Frobenius problem for polynomials over a field k of sufficiently large size.",

keywords = "Arithmetic of function fields, Frobenius problem, Polynomials",

author = "R. Concei{\c c}{\~a}o and R. Gondim and M. Rodriguez",

note = "Publisher Copyright: {\textcopyright} 2017 Rocky Mountain Mathematics Consortium.",

year = "2017",

doi = "10.1216/RMJ-2017-47-5-1427",

language = "English",

volume = "47",

pages = "1427--1462",

journal = "Rocky Mountain Journal of Mathematics",

issn = "0035-7596",

number = "5",

}

TY - JOUR

T1 - On a frobenius problem for polynomials

AU - Conceição, R.

AU - Gondim, R.

AU - Rodriguez, M.

PY - 2017

Y1 - 2017

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

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

KW - Arithmetic of function fields

KW - Frobenius problem

KW - Polynomials

UR - http://www.scopus.com/inward/record.url?scp=85030324486&partnerID=8YFLogxK

U2 - 10.1216/RMJ-2017-47-5-1427

DO - 10.1216/RMJ-2017-47-5-1427

M3 - Article

AN - SCOPUS:85030324486

SN - 0035-7596

VL - 47

SP - 1427

EP - 1462

JO - Rocky Mountain Journal of Mathematics

JF - Rocky Mountain Journal of Mathematics

IS - 5

ER -

On a frobenius problem for polynomials

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this