{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn [[combinatorial|0JKW7W7XFR]] mathematics, a **De Bruijn torus**, named after Dutch mathematician Nicolaas Govert de Bruijn, is an [[array|0VD9ZSWWJG]] of symbols from an alphabet (often just 0 and 1) that contains every possible [[matrix|0VD9ZSWWJG]] of given dimensions $m \\times n$ exactly once. It is a [[torus|03NM7DZXXC]] because the edges are considered wraparound for the purpose of finding matrices. Its name comes from the De Bruijn sequence, which can be considered a special case where $n = 1$ (one dimension).\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "2V4PQWAV33"
    ],
    "kind": "concept",
    "name": "De Bruijn torus",
    "same_as": {
      "wikidata": "Q5244290",
      "wikipedia": "De Bruijn torus"
    },
    "sources": [
      {
        "locator": "De Bruijn torus",
        "mention": "wikipedia://en/5980981",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:5980981@r1359391626"
      }
    ],
    "tag": "3TA31CQJ3M"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/3TA31CQJ3M/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/3TA31CQJ3M.md",
  "msc": null,
  "name": "De Bruijn torus",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/3TA/3TA31CQJ3M.md",
  "status": null,
  "tag": "3TA31CQJ3M",
  "uri": "m2://3TA31CQJ3M",
  "url": "https://math2.tamnd.com/wiki/de-bruijn-torus/",
  "writing": {
    "tag": "3TA31CQJ3M",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}