{
  "id": "1509.05713",
  "version": "v1",
  "published": "2015-09-18T17:24:59.000Z",
  "updated": "2015-09-18T17:24:59.000Z",
  "title": "Enumeration of nilpotent loops via cohomology",
  "authors": [
    "Daniel Daly",
    "Petr Vojtěchovský"
  ],
  "journal": "Journal of Algebra 322 (2009), no. 11, 4080-4098",
  "categories": [
    "math.GR"
  ],
  "abstract": "The isomorphism problem for centrally nilpotent loops can be tackled by methods of cohomology. We develop tools based on cohomology and linear algebra that either lend themselves to direct count of the isomorphism classes (notably in the case of nilpotent loops of order $2q$, $q$ a prime), or lead to efficient classification computer programs. This allows us to enumerate all nilpotent loops of order less than $24$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-09-18T17:24:59.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "20N05",
      "20J05",
      "05B15"
    ],
    "keywords": [
      "cohomology",
      "enumeration",
      "efficient classification computer programs",
      "direct count",
      "centrally nilpotent loops"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv150905713D"
    }
  }
}