Computing the unit group of a commutative finite Z-algebra
From MaRDI portal
Publication:6601476
Recommendations
Cites work
- Algorithms for commutative algebras over the rational numbers
- An Effective Framework for Constructing Exponent Lattice Basis of Nonzero Algebraic Numbers
- Computing generators of the unit group of an integral Abelian group ring.
- Computing in arithmetic groups with Voronoï's algorithm.
- Computing primitive elements of extension fields
- Computing the binomial part of a polynomial ideal
- Computing unit groups of curves
- Efficient polynomial time algorithms computing industrial-strength primitive roots
- scientific article; zbMATH DE number 3505201 (Why is no real title available?)
- scientific article; zbMATH DE number 1254302 (Why is no real title available?)
- scientific article; zbMATH DE number 638938 (Why is no real title available?)
- scientific article; zbMATH DE number 1515218 (Why is no real title available?)
- scientific article; zbMATH DE number 2206382 (Why is no real title available?)
- scientific article; zbMATH DE number 3342087 (Why is no real title available?)
- On the group of units of a finite R-algebra
- On the units of orders
- Order bounds for C2-finite sequences
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Searching for Primitive Roots in Finite Fields
- Standard bases over Euclidean domains
- Subexponential algorithms for class group and unit computations
- Subexponential class group and unit group computation in large degree number fields
- THE OCCURRENCE PROBLEM FOR FREE PRODUCTS OF GROUPS
This page was built for publication: Computing the unit group of a commutative finite \(\mathbb{Z}\)-algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601476)