{
  "id": "1211.6261",
  "version": "v1",
  "published": "2012-11-27T10:26:35.000Z",
  "updated": "2012-11-27T10:26:35.000Z",
  "title": "Generating tuples of integers modulo the action of a permutation group and applications",
  "authors": [
    "Nicolas Borie"
  ],
  "comment": "12 pages, 1 figures, 3 graphics, 2 algorithms, 3 tables. Submitted as extended abstract to FPSAC 2013",
  "categories": [
    "math.CO"
  ],
  "abstract": "Originally motivated by algebraic invariant theory, we present an algorithm to enumerate integer vectors modulo the action of a permutation group. This problem generalizes the generation of unlabeled graph up to an isomorphism. In this paper, we present the full development of a generation engine by describing the related theory, establishing a mathematical and practical complexity, and exposing some benchmarks. We next show two applications to effective invariant theory and effective Galois theory.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2012-11-27T10:26:35.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "permutation group",
      "integers modulo",
      "generating tuples",
      "applications",
      "enumerate integer vectors modulo"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 12,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1211.6261B"
    }
  }
}