{
  "id": "1701.08480",
  "version": "v1",
  "published": "2017-01-30T04:33:42.000Z",
  "updated": "2017-01-30T04:33:42.000Z",
  "title": "A Combinatorial Problem from Group Theory",
  "authors": [
    "Eugene Curtin",
    "Suho Oh"
  ],
  "comment": "6 pages",
  "categories": [
    "math.CO",
    "math.GR"
  ],
  "abstract": "Keller proposed a combinatorial conjecture on construction of an n-by-infinite matrix, which comes from showing the existence of many orbits of different sizes in certain linear group actions. He proved it for the case n=4, and we show that conjecture is true in the general case. We also propose a combinatorial game version of the conjecture which even further generalizes the problem.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-01-30T04:33:42.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "combinatorial problem",
      "group theory",
      "combinatorial game version",
      "linear group actions",
      "combinatorial conjecture"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 6,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}