{
  "id": "1010.3129",
  "version": "v1",
  "published": "2010-10-15T11:33:10.000Z",
  "updated": "2010-10-15T11:33:10.000Z",
  "title": "Numerical Decomposition of Affine Algebraic Varieties",
  "authors": [
    "Shawki Al-Rashed",
    "Gerhard Pfister"
  ],
  "comment": "15 pages, 1 figure",
  "categories": [
    "math.AG"
  ],
  "abstract": "An irreducible algebraic decomposition $\\cup_{i=0}^{d}X_i=\\cup_{i=0}^{d} (\\cup_{j=1}^{d_i}X_{ij})$ of an affine algebraic variety X can be represented as an union of finite disjoint sets $\\cup_{i=0}^{d}W_i=\\cup_{i=0} ^{d}(\\cup_{j=1}^{d_i}W_{ij})$ called numerical irreducible decomposition (cf. [14],[15],[17],[18],[19],[21],[22],[23]). $W_i$ corresponds to a pure i-dimensional $X_i$, and $W_{ij}$ presents an i- dimensional irreducible component $X_{ij}$. Modifying this concepts by using partially Gr\\\"obner bases, local dimension, and the \"Zero Sum Relation\" we present in this paper an implementation in SINGULAR to compute the numerical irreducible decomposition. We will give some examples and timings, which show that the modified algorithms are more efficient if the number of variables is not too large. For a large number of variables BERTINI is more efficient. Note that each step of the numerical decomposition is parallelizable. For our comparisons we did not use the parallel version of BERTINI.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2010-10-15T11:33:10.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "14Q15",
      "68W30",
      "G.1.0",
      "I.1.2"
    ],
    "keywords": [
      "affine algebraic variety",
      "numerical decomposition",
      "numerical irreducible decomposition",
      "zero sum relation",
      "finite disjoint sets"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 15,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2010arXiv1010.3129A"
    }
  }
}