DBpedia – Linked Data Fragments

DBpedia 2015-10

Query DBpedia 2015-10 by triple pattern

Matches in DBpedia 2015-10 for { ?s ?p "In geometry, a Coxeter–Dynkin diagram (or Coxeter diagram, Coxeter graph) is a graph with numerically labeled edges (called branches) representing the spatial relations between a collection of mirrors (or reflecting hyperplanes). It describes a kaleidoscopic construction: each graph "node" represents a mirror (domain facet) and the label attached to a branch encodes the dihedral angle order between two mirrors (on a domain ridge). An unlabeled branch implicitly represents order-3.Each diagram represents a Coxeter group, and Coxeter groups are classified by their associated diagrams.Dynkin diagrams are closely related objects, which differ from Coxeter diagrams in two respects: firstly, branches labeled "4" or greater are directed, while Coxeter diagrams are undirected; secondly, Dynkin diagrams must satisfy an additional (crystallographic) restriction, namely that the only allowed branch labels are 2, 3, 4, and 6. Dynkin diagrams correspond to and are used to classify root systems and therefore semisimple Lie algebras."@en }

Showing triples 1 to 1 of 1 with 100 triples per page.