Efficient Algorithms for Finite $\mathbb{Z}$-Algebras
Efficient Algorithms for Finite $\mathbb{Z}$-Algebras
For a finite $\mathbb{Z}$-algebra $R$, i.e., for a $\mathbb{Z}$-algebra which is a finitely generated $\mathbb{Z}$-module, we assume that $R$ is explicitly given by a system of $\mathbb{Z}$-module generators $G$, its relation module ${\rm Syz}(G)$, and the structure constants of the multiplication in $R$. In this setting we develop and analyze …