{
  "id": "2101.05245",
  "version": "v1",
  "published": "2021-01-13T18:12:25.000Z",
  "updated": "2021-01-13T18:12:25.000Z",
  "title": "Computing efficiently the non-properness set of polynomial maps on the plane",
  "authors": [
    "Boulos El Hilany",
    "Elias Tsigaridas"
  ],
  "comment": "30 pages, 4 figures, comments are welcome!",
  "categories": [
    "math.AG"
  ],
  "abstract": "We present mathematical, algorithmic, complexity, and implementation results on the problem of computing the Jelonek set in 2D. This is the set in $\\mathbb{K}^2$ at which a polynomial map $f: \\mathbb{K}^2 \\to \\mathbb{K}^2$ is not proper. Our results make no assumptions on $f$ and are valid for $\\mathbb{K}= \\mathbb{C}$ and $\\mathbb{K} = \\mathbb{R}$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2021-01-13T18:12:25.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "12D10",
      "14P10",
      "14R25",
      "26C05",
      "52B20"
    ],
    "keywords": [
      "polynomial map",
      "non-properness set",
      "jelonek set",
      "implementation results"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 30,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}