See Coxeter-Dynkin diagram on Wiktionary
Download JSON data for Coxeter-Dynkin diagram meaning in All languages combined (4.6kB)
{
"etymology_text": "After mathematicians H. S. M. Coxeter and Eugene Dynkin.",
"forms": [
{
"form": "Coxeter-Dynkin diagrams",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Coxeter-Dynkin diagram (plural Coxeter-Dynkin diagrams)",
"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": "Algebra",
"orig": "en:Algebra",
"parents": [
"Mathematics",
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Geometry",
"orig": "en:Geometry",
"parents": [
"Mathematics",
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"examples": [
{
"text": "A Coxeter-Dynkin diagram encodes the information in a Coxeter matrix, which in turn encodes the presentation of a Coxeter group."
},
{
"text": "Vertices of a Coxeter-Dynkin diagram represent generators of the corresponding Coxeter group. The generators (algebraic) in turn correspond to the reflecting hyperplanes (geometric). A pair of vertices which are not linked by an edge correspond to a pair of commuting generators. An unnumbered edge between a pair of vertices means that the braid relation between the corresponding generators has length three (e.g., aba = bab if the generators are a and b). An edge numbered ≥4 means that the braid relation between the corresponding generators has a length equal to that number. For example, if the edge is numbered 4 then the braid relation is cdcd = dcdc if the generators are c and d. If a set of edges form a cycle then the Coxeter group can be shown to be infinite. If a tree in a Coxeter-Dynkin diagram has more than one numbered edge then the Coxeter group can be shown to be infinite. There are a few more such rules, which ensure that finite Coxeter groups have Coxeter-Dynkin diagrams with relatively simple shapes."
},
{
"ref": "1995 June, R. V. Moody, J. Patera, “Voronoi Domains and Dual Cells in the Generalized Kaleidoscope with Applications to Root and Weight Lattices”, in Canadian Journal of Mathematics, page 597",
"text": "Let 𝒬 be an indecomposable root lattice and let Γ denote the Coxeter-Dynkin diagram of the underlying root system Δ.",
"type": "quotation"
},
{
"ref": "2000, Andrei Gabrielov, “Coxeter-Dynkin diagrams and singularities”, in Evgeniĭ Borisovich Dynkin, A. A. Yushkevich, Gary M. Seitz, A. L. Onishchik, editors, Selected Papers of E. B. Dynkin with Commentary, page 367",
"text": "There is a deep and only partially understood connection between the classification and structure of singularities and the Coxeter-Dynkin diagrams introduced by H. S .M. Coxeter for classification of reflection-generated groups and by E. B. Dynkin for classification of semisimple Lie algebras.",
"type": "quotation"
},
{
"ref": "2012, Igor V. Dolgachev, Classical Algebraic Geometry: A Modern View, page 363",
"text": "For 3 ≤ n ≤ 5, we will use Eₙ to denote the Coxeter-Dynkin diagrams of types A₁ + A₂(N = 3), A₄(N = 4) and D₅(N = 5).",
"type": "quotation"
}
],
"glosses": [
"A graph with numerically labelled edges (called branches) representing the spatial relations between a collection of mirrors (or reflecting hyperplanes)."
],
"id": "en-Coxeter-Dynkin_diagram-en-noun-cIRlY9dC",
"links": [
[
"geometry",
"geometry"
],
[
"algebra",
"algebra"
],
[
"graph",
"graph"
],
[
"edge",
"edge"
],
[
"branch",
"branch"
],
[
"spatial",
"spatial"
],
[
"relation",
"relation"
],
[
"mirror",
"mirror"
],
[
"reflect",
"reflect"
],
[
"hyperplane",
"hyperplane"
]
],
"raw_glosses": [
"(geometry, algebra) A graph with numerically labelled edges (called branches) representing the spatial relations between a collection of mirrors (or reflecting hyperplanes)."
],
"related": [
{
"word": "Dynkin diagram"
}
],
"synonyms": [
{
"sense": "graph with numerically labelled edges",
"word": "Coxeter diagram"
},
{
"sense": "graph with numerically labelled edges",
"word": "Coxeter graph"
}
],
"topics": [
"algebra",
"geometry",
"mathematics",
"sciences"
],
"wikipedia": [
"Coxeter-Dynkin diagram",
"Eugene Dynkin",
"Harold Scott MacDonald Coxeter"
]
}
],
"word": "Coxeter-Dynkin diagram"
}
{
"etymology_text": "After mathematicians H. S. M. Coxeter and Eugene Dynkin.",
"forms": [
{
"form": "Coxeter-Dynkin diagrams",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Coxeter-Dynkin diagram (plural Coxeter-Dynkin diagrams)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"related": [
{
"word": "Dynkin diagram"
}
],
"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",
"English terms with quotations",
"Quotation templates to be cleaned",
"en:Algebra",
"en:Geometry"
],
"examples": [
{
"text": "A Coxeter-Dynkin diagram encodes the information in a Coxeter matrix, which in turn encodes the presentation of a Coxeter group."
},
{
"text": "Vertices of a Coxeter-Dynkin diagram represent generators of the corresponding Coxeter group. The generators (algebraic) in turn correspond to the reflecting hyperplanes (geometric). A pair of vertices which are not linked by an edge correspond to a pair of commuting generators. An unnumbered edge between a pair of vertices means that the braid relation between the corresponding generators has length three (e.g., aba = bab if the generators are a and b). An edge numbered ≥4 means that the braid relation between the corresponding generators has a length equal to that number. For example, if the edge is numbered 4 then the braid relation is cdcd = dcdc if the generators are c and d. If a set of edges form a cycle then the Coxeter group can be shown to be infinite. If a tree in a Coxeter-Dynkin diagram has more than one numbered edge then the Coxeter group can be shown to be infinite. There are a few more such rules, which ensure that finite Coxeter groups have Coxeter-Dynkin diagrams with relatively simple shapes."
},
{
"ref": "1995 June, R. V. Moody, J. Patera, “Voronoi Domains and Dual Cells in the Generalized Kaleidoscope with Applications to Root and Weight Lattices”, in Canadian Journal of Mathematics, page 597",
"text": "Let 𝒬 be an indecomposable root lattice and let Γ denote the Coxeter-Dynkin diagram of the underlying root system Δ.",
"type": "quotation"
},
{
"ref": "2000, Andrei Gabrielov, “Coxeter-Dynkin diagrams and singularities”, in Evgeniĭ Borisovich Dynkin, A. A. Yushkevich, Gary M. Seitz, A. L. Onishchik, editors, Selected Papers of E. B. Dynkin with Commentary, page 367",
"text": "There is a deep and only partially understood connection between the classification and structure of singularities and the Coxeter-Dynkin diagrams introduced by H. S .M. Coxeter for classification of reflection-generated groups and by E. B. Dynkin for classification of semisimple Lie algebras.",
"type": "quotation"
},
{
"ref": "2012, Igor V. Dolgachev, Classical Algebraic Geometry: A Modern View, page 363",
"text": "For 3 ≤ n ≤ 5, we will use Eₙ to denote the Coxeter-Dynkin diagrams of types A₁ + A₂(N = 3), A₄(N = 4) and D₅(N = 5).",
"type": "quotation"
}
],
"glosses": [
"A graph with numerically labelled edges (called branches) representing the spatial relations between a collection of mirrors (or reflecting hyperplanes)."
],
"links": [
[
"geometry",
"geometry"
],
[
"algebra",
"algebra"
],
[
"graph",
"graph"
],
[
"edge",
"edge"
],
[
"branch",
"branch"
],
[
"spatial",
"spatial"
],
[
"relation",
"relation"
],
[
"mirror",
"mirror"
],
[
"reflect",
"reflect"
],
[
"hyperplane",
"hyperplane"
]
],
"raw_glosses": [
"(geometry, algebra) A graph with numerically labelled edges (called branches) representing the spatial relations between a collection of mirrors (or reflecting hyperplanes)."
],
"topics": [
"algebra",
"geometry",
"mathematics",
"sciences"
],
"wikipedia": [
"Coxeter-Dynkin diagram",
"Eugene Dynkin",
"Harold Scott MacDonald Coxeter"
]
}
],
"synonyms": [
{
"sense": "graph with numerically labelled edges",
"word": "Coxeter diagram"
},
{
"sense": "graph with numerically labelled edges",
"word": "Coxeter graph"
}
],
"word": "Coxeter-Dynkin diagram"
}
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-06-23 from the enwiktionary dump dated 2024-06-20 using wiktextract (1b9bfc5 and 0136956). 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.