See bigrassmannian in All languages combined, or Wiktionary
{ "etymology_templates": [ { "args": { "1": "en", "2": "bi", "3": "Grassmannian" }, "expansion": "bi- + Grassmannian", "name": "prefix" } ], "etymology_text": "From bi- + Grassmannian.", "head_templates": [ { "args": { "1": "-" }, "expansion": "bigrassmannian (not comparable)", "name": "en-adj" } ], "lang": "English", "lang_code": "en", "pos": "adj", "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 terms prefixed with bi-", "parents": [], "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, Alexander B. Goncharov, “Exponential complexes, period morphisms, and characteristic classes”, in arXiv:", "text": "Combining this with the construction of Chern classes with coefficients in the bigrassmannian complexes, we get, for the weights up to four, local explicit formulas for the Chern classes in the rational Deligne cohomology via polylogarithms.", "type": "quote" } ], "glosses": [ "Pertaining to a permutation such that there is at most one left and one right descent (at most one index i and one index j, such that wsᵢ < w and sⱼw < w)." ], "id": "en-bigrassmannian-en-adj-qlol8u4e", "links": [ [ "mathematics", "mathematics" ], [ "permutation", "permutation" ] ], "raw_glosses": [ "(mathematics) Pertaining to a permutation such that there is at most one left and one right descent (at most one index i and one index j, such that wsᵢ < w and sⱼw < w)." ], "tags": [ "not-comparable" ], "topics": [ "mathematics", "sciences" ] } ], "word": "bigrassmannian" }
{ "etymology_templates": [ { "args": { "1": "en", "2": "bi", "3": "Grassmannian" }, "expansion": "bi- + Grassmannian", "name": "prefix" } ], "etymology_text": "From bi- + Grassmannian.", "head_templates": [ { "args": { "1": "-" }, "expansion": "bigrassmannian (not comparable)", "name": "en-adj" } ], "lang": "English", "lang_code": "en", "pos": "adj", "senses": [ { "categories": [ "English adjectives", "English entries with incorrect language header", "English eponyms", "English lemmas", "English terms prefixed with bi-", "English terms with quotations", "English uncomparable adjectives", "Pages with 1 entry", "Pages with entries", "en:Mathematics" ], "examples": [ { "ref": "2015, Alexander B. Goncharov, “Exponential complexes, period morphisms, and characteristic classes”, in arXiv:", "text": "Combining this with the construction of Chern classes with coefficients in the bigrassmannian complexes, we get, for the weights up to four, local explicit formulas for the Chern classes in the rational Deligne cohomology via polylogarithms.", "type": "quote" } ], "glosses": [ "Pertaining to a permutation such that there is at most one left and one right descent (at most one index i and one index j, such that wsᵢ < w and sⱼw < w)." ], "links": [ [ "mathematics", "mathematics" ], [ "permutation", "permutation" ] ], "raw_glosses": [ "(mathematics) Pertaining to a permutation such that there is at most one left and one right descent (at most one index i and one index j, such that wsᵢ < w and sⱼw < w)." ], "tags": [ "not-comparable" ], "topics": [ "mathematics", "sciences" ] } ], "word": "bigrassmannian" }
Download raw JSONL data for bigrassmannian meaning in English (1.6kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-01-08 from the enwiktionary dump dated 2025-01-01 using wiktextract (9a96ef4 and 4ed51a5). 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.