"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
    Sense id: en-de_Bruijn_torus-en-noun-~Hz9H-Mw Categories (other): English entries with incorrect language header, Pages with 1 entry, Pages with entries Topics: combinatorics, mathematics, sciences

Inflected forms

{
  "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": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "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 eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "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"
}

Download raw JSONL data for de Bruijn torus meaning in All languages combined (1.3kB)


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-11-06 from the enwiktionary dump dated 2024-10-02 using wiktextract (fbeafe8 and 7f03c9b). 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.