"Hindman's theorem" meaning in English

See Hindman's theorem in All languages combined, or Wiktionary

Proper name

Etymology: Named after N. Hindman. Head templates: {{en-proper noun}} Hindman's theorem
  1. (mathematics) A theorem stating that, if S, is an IP set and S=C_1∪C_2∪...∪C_n, then at least one C_i, contains an IP set. Wikipedia link: Hindman's theorem Categories (topical): Mathematics
    Sense id: en-Hindman's_theorem-en-name-UV84oCEb Categories (other): English entries with incorrect language header, Pages with 1 entry, Pages with entries Topics: mathematics, sciences
{
  "etymology_text": "Named after N. Hindman.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Hindman's theorem",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "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": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A theorem stating that, if S, is an IP set and S=C_1∪C_2∪...∪C_n, then at least one C_i, contains an IP set."
      ],
      "id": "en-Hindman's_theorem-en-name-UV84oCEb",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "IP set",
          "IP set"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A theorem stating that, if S, is an IP set and S=C_1∪C_2∪...∪C_n, then at least one C_i, contains an IP set."
      ],
      "topics": [
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Hindman's theorem"
      ]
    }
  ],
  "word": "Hindman's theorem"
}
{
  "etymology_text": "Named after N. Hindman.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Hindman's theorem",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Mathematics"
      ],
      "glosses": [
        "A theorem stating that, if S, is an IP set and S=C_1∪C_2∪...∪C_n, then at least one C_i, contains an IP set."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "IP set",
          "IP set"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A theorem stating that, if S, is an IP set and S=C_1∪C_2∪...∪C_n, then at least one C_i, contains an IP set."
      ],
      "topics": [
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Hindman's theorem"
      ]
    }
  ],
  "word": "Hindman's theorem"
}

Download raw JSONL data for Hindman's theorem meaning in English (0.9kB)


This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-04-13 from the enwiktionary dump dated 2025-04-03 using wiktextract (aeaf2a1 and fb63907). 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.