Dual Cones and the Voronoi Algorithm
From MaRDI portal
\textit{M. Koecher} [Math. Ann. 141, 384-432 (1960; Zbl 0095.25301)] gave an axiomatic treatment of self-dual cones and a corresponding Voronoi algorithm to find generators for certain arithmetic groups. The author observes that a wide range of applications can be made if one generalizes Koecher's axioms to a pair of dual cones. This leads to a powerful algorithm to calculate the normalizer of a finite unimodular group in \(\text{GL}_n(\mathbb{Z})\).
Recommendations
Cites work
- Beiträge zu einer Reduktionstheorie in Positivitätsbereichen. I
- Computing isometries of lattices
- Counting Crystallographic Groups in Low Dimensions
- Crystallographic algorithms and tables.
- Groups, trees and projective modules
- scientific article; zbMATH DE number 44409 (Why is no real title available?)
- Positivitatsbereiche Im R n
- Three finiteness theorems for \(G\)-forms
Cited in
(13)- A simplex algorithm for rational cp-factorization
- A dynamic algorithm for constructing the dual representation of a polyhedral cone
- Computing in arithmetic groups with Voronoï's algorithm.
- Maximal finite subgroups and minimal classes.
- A generalization of Voronoi's reduction theory and its application
- The automorphism group of a finitely generated virtually abelian group.
- Algorithms for crystallographic groups
- Automorphism groups of hyperbolic lattices
- Perfect lattices over imaginary quadratic number fields
- A new duality result concerning Voronoi diagrams
- D-V cells and fundamental domains for crystallographic groups, algorithms, and graphic real\-i\-za\-tions.
- Perfect copositive matrices
- Resolutions for unit groups of orders
This page was built for publication: Dual Cones and the Voronoi Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3146576)
