{
  "id": "1812.02219",
  "version": "v1",
  "published": "2018-12-05T20:51:54.000Z",
  "updated": "2018-12-05T20:51:54.000Z",
  "title": "Finding a Unique Solution to Radon-Kaczmarz Puzzles",
  "authors": [
    "Steven Rossi",
    "Xiao Xiao"
  ],
  "categories": [
    "math.CO",
    "math.HO"
  ],
  "abstract": "Solving a Radon-Kaczmarz puzzle involves filling a square grid with positive integers, each between one and nine, satisfying certain clues coming from the sum of entries that lie on the same line in the square grid. Given a set of slopes (of a particular order) that define clues of Radon-Kaczmarz puzzles, we give an upper bound of the size such that any solvable Radon-Kaczmarz puzzle whose size is less than or equal to that is uniquely solvable.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-12-05T20:51:54.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "unique solution",
      "square grid",
      "define clues",
      "upper bound",
      "solvable radon-kaczmarz puzzle"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}