Root Lattices are Efficiently Generated

DOI10.1142/S0218196797000046zbMATH Open0866.68080OpenAlexW2031764998MaRDI QIDQ4335565FDOQ4335565

Authors Dayanand S. Rajan, Anil M. Shende 

Publication date 6 July 1997

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218196797000046

zbMATH Keywords

directed graphEuclidean metricroot latticesmassively parallel computersrelevant vectorsshortest path metric

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Recommendations

• A characterization of root lattices
• Lattice computers for approximating Euclidean space
• Classification of root lattices of countably infinite rank
• A uniform construction of the root lattices \(E_ 6,E_ 7,E_ 8\) and their dual lattices

Cited in

(2)

• Lattice computers for approximating Euclidean space
• An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps

This page was built for publication: Root Lattices are Efficiently Generated

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4335565)