See permutahedral in All languages combined, or Wiktionary
{ "head_templates": [ { "args": { "1": "-" }, "expansion": "permutahedral (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": "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": "2016, Aruni Choudhary, Michael Kerber, Sharath Raghvendra, “Polynomial-Sized Topological Approximations Using The Permutahedron”, in arXiv:", "text": "This result stems from high-dimensional lattice geometry and exploits properties of the permutahedral lattice, a well-studied structure in discrete geometry. Building on the same geometric concept, we also present a lower bound result on the size of an approximate filtration: we construct a point set for which every (1#43;#92;epsilon)-approximation of the \\v{C}ech filtration has to contain n#123;#92;Omega(#92;log#92;logn)#125; features, provided that #92;epsilonlt;#92;frac#123;1#125;#123;#92;log#123;1#43;c#125;n#125; for c#92;in(0,1)..", "type": "quote" } ], "glosses": [ "Relating to a permutahedron" ], "id": "en-permutahedral-en-adj-L-MtRD6S", "links": [ [ "mathematics", "mathematics" ], [ "permutahedron", "permutahedron" ] ], "raw_glosses": [ "(mathematics) Relating to a permutahedron" ], "tags": [ "not-comparable" ], "topics": [ "mathematics", "sciences" ] } ], "word": "permutahedral" }
{ "head_templates": [ { "args": { "1": "-" }, "expansion": "permutahedral (not comparable)", "name": "en-adj" } ], "lang": "English", "lang_code": "en", "pos": "adj", "senses": [ { "categories": [ "English adjectives", "English entries with incorrect language header", "English lemmas", "English terms with quotations", "English uncomparable adjectives", "Pages with 1 entry", "Pages with entries", "en:Mathematics" ], "examples": [ { "ref": "2016, Aruni Choudhary, Michael Kerber, Sharath Raghvendra, “Polynomial-Sized Topological Approximations Using The Permutahedron”, in arXiv:", "text": "This result stems from high-dimensional lattice geometry and exploits properties of the permutahedral lattice, a well-studied structure in discrete geometry. Building on the same geometric concept, we also present a lower bound result on the size of an approximate filtration: we construct a point set for which every (1#43;#92;epsilon)-approximation of the \\v{C}ech filtration has to contain n#123;#92;Omega(#92;log#92;logn)#125; features, provided that #92;epsilonlt;#92;frac#123;1#125;#123;#92;log#123;1#43;c#125;n#125; for c#92;in(0,1)..", "type": "quote" } ], "glosses": [ "Relating to a permutahedron" ], "links": [ [ "mathematics", "mathematics" ], [ "permutahedron", "permutahedron" ] ], "raw_glosses": [ "(mathematics) Relating to a permutahedron" ], "tags": [ "not-comparable" ], "topics": [ "mathematics", "sciences" ] } ], "word": "permutahedral" }
Download raw JSONL data for permutahedral meaning in English (1.4kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-02-17 from the enwiktionary dump dated 2025-02-02 using wiktextract (ca09fec and c40eb85). 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.