See altermatic on Wiktionary
{ "etymology_templates": [ { "args": { "1": "en", "2": "Meysam Alishahiand and Hossein Hajiabolhassan", "in": "2014", "occ": "mathematicians", "w": "-" }, "expansion": "Coined by mathematicians Meysam Alishahiand and Hossein Hajiabolhassan in 2014", "name": "coinage" }, { "args": { "1": "en", "2": "alternating", "3": "chromatic", "nocap": "1" }, "expansion": "blend of alternating + chromatic", "name": "blend" } ], "etymology_text": "Coined by mathematicians Meysam Alishahiand and Hossein Hajiabolhassan in 2014 for the 2015 paper \"On the chromatic number of general Kneser hypergraphs\" as a blend of alternating + chromatic on the grounds that the chromatic bound is given by a longest subsequence in which every pair of consecutive terms differs (loosely, the subsequence \"alternates\").", "head_templates": [ { "args": { "1": "-" }, "expansion": "altermatic (not comparable)", "name": "en-adj" } ], "lang": "English", "lang_code": "en", "pos": "adj", "senses": [ { "categories": [ { "kind": "other", "name": "English blends", "parents": [], "source": "w" }, { "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" } ], "examples": [ { "ref": "2015, Meysam Alishahi, Hossein Hajiabolhassan, “On The Chromatic Number of Matching Graphs”, in arXiv:", "text": "In this paper, as a generalization of the well-known result of Schrijver about the chromatic number of Schrijver graphs, we determine the chromatic number of a large family of matching graphs by specifying their altermatic number.", "type": "quote" } ], "glosses": [ "Describing a certain combinatorial lower bound of a chromatic number of a graph." ], "id": "en-altermatic-en-adj-KriS0JBw", "links": [ [ "mathematics", "mathematics" ], [ "combinatorial", "combinatorial" ], [ "lower", "lower" ], [ "bound", "bound" ], [ "chromatic number", "chromatic number" ], [ "graph", "graph" ] ], "raw_glosses": [ "(mathematics) Describing a certain combinatorial lower bound of a chromatic number of a graph." ], "tags": [ "not-comparable" ], "topics": [ "mathematics", "sciences" ] } ], "sounds": [ { "ipa": "/ˌɒl.təˈmæt.ɪk/", "tags": [ "Received-Pronunciation" ] }, { "ipa": "/ˌɔːl.tə-/", "tags": [ "Received-Pronunciation" ] }, { "ipa": "/ˌɔl.təɹˈmæt.ɪk/", "tags": [ "General-American" ] }, { "ipa": "/ˌɑl.təɹ-/", "tags": [ "General-American" ] }, { "rhymes": "-ætɪk" } ], "word": "altermatic" }
{ "etymology_templates": [ { "args": { "1": "en", "2": "Meysam Alishahiand and Hossein Hajiabolhassan", "in": "2014", "occ": "mathematicians", "w": "-" }, "expansion": "Coined by mathematicians Meysam Alishahiand and Hossein Hajiabolhassan in 2014", "name": "coinage" }, { "args": { "1": "en", "2": "alternating", "3": "chromatic", "nocap": "1" }, "expansion": "blend of alternating + chromatic", "name": "blend" } ], "etymology_text": "Coined by mathematicians Meysam Alishahiand and Hossein Hajiabolhassan in 2014 for the 2015 paper \"On the chromatic number of general Kneser hypergraphs\" as a blend of alternating + chromatic on the grounds that the chromatic bound is given by a longest subsequence in which every pair of consecutive terms differs (loosely, the subsequence \"alternates\").", "head_templates": [ { "args": { "1": "-" }, "expansion": "altermatic (not comparable)", "name": "en-adj" } ], "lang": "English", "lang_code": "en", "pos": "adj", "senses": [ { "categories": [ "English adjectives", "English blends", "English coinages", "English entries with incorrect language header", "English lemmas", "English terms coined by Meysam Alishahiand and Hossein Hajiabolhassan", "English terms with quotations", "English uncomparable adjectives", "Pages with 1 entry", "Pages with entries", "Rhymes:English/ætɪk", "Rhymes:English/ætɪk/4 syllables", "en:Mathematics" ], "examples": [ { "ref": "2015, Meysam Alishahi, Hossein Hajiabolhassan, “On The Chromatic Number of Matching Graphs”, in arXiv:", "text": "In this paper, as a generalization of the well-known result of Schrijver about the chromatic number of Schrijver graphs, we determine the chromatic number of a large family of matching graphs by specifying their altermatic number.", "type": "quote" } ], "glosses": [ "Describing a certain combinatorial lower bound of a chromatic number of a graph." ], "links": [ [ "mathematics", "mathematics" ], [ "combinatorial", "combinatorial" ], [ "lower", "lower" ], [ "bound", "bound" ], [ "chromatic number", "chromatic number" ], [ "graph", "graph" ] ], "raw_glosses": [ "(mathematics) Describing a certain combinatorial lower bound of a chromatic number of a graph." ], "tags": [ "not-comparable" ], "topics": [ "mathematics", "sciences" ] } ], "sounds": [ { "ipa": "/ˌɒl.təˈmæt.ɪk/", "tags": [ "Received-Pronunciation" ] }, { "ipa": "/ˌɔːl.tə-/", "tags": [ "Received-Pronunciation" ] }, { "ipa": "/ˌɔl.təɹˈmæt.ɪk/", "tags": [ "General-American" ] }, { "ipa": "/ˌɑl.təɹ-/", "tags": [ "General-American" ] }, { "rhymes": "-ætɪk" } ], "word": "altermatic" }
Download raw JSONL data for altermatic meaning in All languages combined (2.5kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-01-23 from the enwiktionary dump dated 2025-01-20 using wiktextract (0c0c1f1 and 4230888). 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.