"Stern-Brocot tree" meaning in English

See Stern-Brocot tree in All languages combined, or Wiktionary

Noun

Forms: Stern-Brocot trees [plural]
Etymology: Introduced independently by Moritz Stern (1858) and Achille Brocot (1861). Head templates: {{en-noun}} Stern-Brocot tree (plural Stern-Brocot trees)
  1. (number theory) An infinite complete binary tree whose vertices correspond one-for-one to the positive rational numbers, whose values are ordered from the left to the right as in a search tree. Categories (topical): Number theory

Inflected forms

Download JSON data for Stern-Brocot tree meaning in English (1.8kB)

{
  "etymology_text": "Introduced independently by Moritz Stern (1858) and Achille Brocot (1861).",
  "forms": [
    {
      "form": "Stern-Brocot trees",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Stern-Brocot tree (plural Stern-Brocot trees)",
      "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": "Number theory",
          "orig": "en:Number theory",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "An infinite complete binary tree whose vertices correspond one-for-one to the positive rational numbers, whose values are ordered from the left to the right as in a search tree."
      ],
      "id": "en-Stern-Brocot_tree-en-noun-ivTxlot2",
      "links": [
        [
          "number theory",
          "number theory"
        ],
        [
          "infinite",
          "infinite"
        ],
        [
          "complete",
          "complete"
        ],
        [
          "binary tree",
          "binary tree"
        ],
        [
          "vertices",
          "vertex"
        ],
        [
          "positive",
          "positive"
        ],
        [
          "rational number",
          "rational number"
        ]
      ],
      "raw_glosses": [
        "(number theory) An infinite complete binary tree whose vertices correspond one-for-one to the positive rational numbers, whose values are ordered from the left to the right as in a search tree."
      ],
      "topics": [
        "mathematics",
        "number-theory",
        "sciences"
      ]
    }
  ],
  "word": "Stern-Brocot tree"
}
{
  "etymology_text": "Introduced independently by Moritz Stern (1858) and Achille Brocot (1861).",
  "forms": [
    {
      "form": "Stern-Brocot trees",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Stern-Brocot tree (plural Stern-Brocot trees)",
      "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:Number theory"
      ],
      "glosses": [
        "An infinite complete binary tree whose vertices correspond one-for-one to the positive rational numbers, whose values are ordered from the left to the right as in a search tree."
      ],
      "links": [
        [
          "number theory",
          "number theory"
        ],
        [
          "infinite",
          "infinite"
        ],
        [
          "complete",
          "complete"
        ],
        [
          "binary tree",
          "binary tree"
        ],
        [
          "vertices",
          "vertex"
        ],
        [
          "positive",
          "positive"
        ],
        [
          "rational number",
          "rational number"
        ]
      ],
      "raw_glosses": [
        "(number theory) An infinite complete binary tree whose vertices correspond one-for-one to the positive rational numbers, whose values are ordered from the left to the right as in a search tree."
      ],
      "topics": [
        "mathematics",
        "number-theory",
        "sciences"
      ]
    }
  ],
  "word": "Stern-Brocot tree"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-01 from the enwiktionary dump dated 2024-04-21 using wiktextract (f4fd8c9 and c9440ce). 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.