Computing the unit group of a commutative finite \(\mathbb{Z}\)-algebra
From MaRDI portal
Publication:6601476
DOI10.46298/JGCC.2024.16.1.13875MaRDI QIDQ6601476
Publication date: 10 September 2024
Published in: Journal of Groups, Complexity, Cryptology (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing primitive elements of extension fields
- Efficient polynomial time algorithms computing industrial-strength primitive roots
- Subexponential algorithms for class group and unit computations
- Algorithms for commutative algebras over the rational numbers
- Standard bases over Euclidean domains
- Computing unit groups of curves
- Computing in arithmetic groups with Voronoï's algorithm.
- Computing generators of the unit group of an integral Abelian group ring.
- On the units of orders
- On the group of units of a finite R-algebra
- Subexponential class group and unit group computation in large degree number fields
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Searching for Primitive Roots in Finite Fields
- An Effective Framework for Constructing Exponent Lattice Basis of Nonzero Algebraic Numbers
- THE OCCURRENCE PROBLEM FOR FREE PRODUCTS OF GROUPS
- Order bounds for C2-finite sequences
- Computing the binomial part of a polynomial ideal
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)
