"de Bruijn torus" meaning in All languages combined

See de Bruijn torus on Wiktionary

Noun [English]

Forms: de Bruijn toruses [plural], de Bruijn tori [plural]
Etymology: Named from the de Bruijn sequence, which can be considered a special case for n=1 (one dimension). It is a torus because the edges are considered to wrap around for the purpose of finding matrices. Head templates: {{en-noun|+|de Bruijn tori|head=de Bruijn torus}} de Bruijn torus (plural de Bruijn toruses or de Bruijn tori)
  1. (combinatorics) An array of symbols from an alphabet (often just 0 and 1) that contains every m-by-n matrix exactly once. Wikipedia link: de Bruijn torus Categories (topical): Combinatorics

Inflected forms

Download JSON data for de Bruijn torus meaning in All languages combined (1.9kB)

{
  "etymology_text": "Named from the de Bruijn sequence, which can be considered a special case for n=1 (one dimension). It is a torus because the edges are considered to wrap around for the purpose of finding matrices.",
  "forms": [
    {
      "form": "de Bruijn toruses",
      "tags": [
        "plural"
      ]
    },
    {
      "form": "de Bruijn tori",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "+",
        "2": "de Bruijn tori",
        "head": "de Bruijn torus"
      },
      "expansion": "de Bruijn torus (plural de Bruijn toruses or de Bruijn tori)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Combinatorics",
          "orig": "en:Combinatorics",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "An array of symbols from an alphabet (often just 0 and 1) that contains every m-by-n matrix exactly once."
      ],
      "id": "en-de_Bruijn_torus-en-noun-~Hz9H-Mw",
      "links": [
        [
          "combinatorics",
          "combinatorics"
        ],
        [
          "array",
          "array"
        ],
        [
          "symbol",
          "symbol"
        ],
        [
          "alphabet",
          "alphabet"
        ],
        [
          "matrix",
          "matrix"
        ]
      ],
      "raw_glosses": [
        "(combinatorics) An array of symbols from an alphabet (often just 0 and 1) that contains every m-by-n matrix exactly once."
      ],
      "topics": [
        "combinatorics",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "de Bruijn torus"
      ]
    }
  ],
  "word": "de Bruijn torus"
}
{
  "etymology_text": "Named from the de Bruijn sequence, which can be considered a special case for n=1 (one dimension). It is a torus because the edges are considered to wrap around for the purpose of finding matrices.",
  "forms": [
    {
      "form": "de Bruijn toruses",
      "tags": [
        "plural"
      ]
    },
    {
      "form": "de Bruijn tori",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "+",
        "2": "de Bruijn tori",
        "head": "de Bruijn torus"
      },
      "expansion": "de Bruijn torus (plural de Bruijn toruses or de Bruijn tori)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with non-redundant non-automated sortkeys",
        "en:Combinatorics"
      ],
      "glosses": [
        "An array of symbols from an alphabet (often just 0 and 1) that contains every m-by-n matrix exactly once."
      ],
      "links": [
        [
          "combinatorics",
          "combinatorics"
        ],
        [
          "array",
          "array"
        ],
        [
          "symbol",
          "symbol"
        ],
        [
          "alphabet",
          "alphabet"
        ],
        [
          "matrix",
          "matrix"
        ]
      ],
      "raw_glosses": [
        "(combinatorics) An array of symbols from an alphabet (often just 0 and 1) that contains every m-by-n matrix exactly once."
      ],
      "topics": [
        "combinatorics",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "de Bruijn torus"
      ]
    }
  ],
  "word": "de Bruijn torus"
}

This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-05-12 from the enwiktionary dump dated 2024-05-02 using wiktextract (ae36afe and 304864d). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.