{
  "id": "1409.4129",
  "version": "v1",
  "published": "2014-09-15T01:32:28.000Z",
  "updated": "2014-09-15T01:32:28.000Z",
  "title": "On a Frobenius problem for polynomials",
  "authors": [
    "Ricardo Conceição",
    "Rodrigo Gondim",
    "Miguel Rodriguez"
  ],
  "comment": "22 pages, submitted",
  "categories": [
    "math.NT"
  ],
  "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 $\\mathbb{Z}$ to $k[t]$ and give an algorithm to solve the Frobenius problem for polynomials over a field $k$ of sufficiently large size.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-09-15T01:32:28.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "polynomials",
      "famous diophantine frobenius problem",
      "classical problem",
      "sufficiently large"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 22,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1409.4129C"
    }
  }
}