{
  "id": "1209.4662",
  "version": "v2",
  "published": "2012-09-20T20:37:55.000Z",
  "updated": "2013-04-24T12:40:48.000Z",
  "title": "An inductive approach to constructing Universal Cycles on the k-subsets of [n]",
  "authors": [
    "Yevgeniy Rudoy"
  ],
  "journal": "Y. Rudoy, The Electronic Journal of Combinatorics, Volume 20, Issue 2 (2013) 18",
  "categories": [
    "math.CO"
  ],
  "abstract": "In this paper, we introduce a method of constructing Universal Cycles on sets by taking \"sums\" and \"products\" of smaller cycles. We demonstrate this new approach by proving that if there exist Universal Cycles on the 4-subsets of [18] and the 4-subsets of [26], then for any integer n which is greater than or equal 18 and equivalent to 2 mod 8, there exists a Universal Cycle on the 4-subsets of [n].",
  "revisions": [
    {
      "version": "v2",
      "updated": "2013-04-24T12:40:48.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "constructing universal cycles",
      "inductive approach",
      "smaller cycles",
      "demonstrate",
      "equivalent"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1209.4662R"
    }
  }
}