{
  "id": "1410.5590",
  "version": "v1",
  "published": "2014-10-21T09:36:55.000Z",
  "updated": "2014-10-21T09:36:55.000Z",
  "title": "A new simple proof of the Aztec diamond theorem",
  "authors": [
    "Manuel Fendler",
    "Daniel Grieser"
  ],
  "comment": "6 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "The Aztec diamond of order $n$ is the union of lattice squares in the plane intersecting the square $|x|+|y|<n$. The Aztec diamond theorem states that the number of domino tilings of this shape is $2^{n(n+1)/2}$. It was first proved by Elkies, Kuperberg, Larsen and Propp in 1992. We give a new simple proof of this theorem.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-10-21T09:36:55.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A15"
    ],
    "keywords": [
      "simple proof",
      "aztec diamond theorem states",
      "lattice squares",
      "domino tilings"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 6,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1410.5590F"
    }
  }
}