Toroidal Algorithms for Mesh Geometries of Root Orbits of the Dynkin Diagram $\mathbb{D}_4$

DOI10.3233/FI-2013-837zbMath1269.05105OpenAlexW1601437069MaRDI QIDQ2841954

Daniel Simson

Publication date: 30 July 2013

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2013-837

zbMATH Keywords

Weyl groupDynkin diagramCoxeter spectrummatrix morsificationedge-bipartite graphinflation algorithmEuler bilinear formmesh geometry of root orbitstoroidal mesh algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

On combinatorial algorithms computing mesh root systems and matrix morsifications for the Dynkin diagram \(\mathbb A_n\) ⋮ Symbolic computation of strong Gram congruences for Cox-regular positive edge-bipartite graphs with loops ⋮ A Strong Gram Classification of Non-negative Unit Forms of Dynkin Type 𝔸r ⋮ On mesh geometries of root Coxeter orbits and mesh algorithms for corank two edge-bipartite signed graphs ⋮ Applications of mesh algorithms and self-dual mesh geometries of root Coxeter orbits to a Horn-Sergeichuk type problem ⋮ Numeric and mesh algorithms for the Coxeter spectral study of positive edge-bipartite graphs and their isotropy groups

This page was built for publication: Toroidal Algorithms for Mesh Geometries of Root Orbits of the Dynkin Diagram $\mathbb{D}_4$