Martin Kreuzer ; Florian Walsh - Computing the unit group of a commutative finite $\mathbb{Z}$-algebra

gcc:13875 - journal of Groups, complexity, cryptology, July 31, 2024, Volume 16, Issue 1 - https://doi.org/10.46298/jgcc.2024.16.1.13875
Computing the unit group of a commutative finite $\mathbb{Z}$-algebraArticle

Authors: Martin Kreuzer ; Florian Walsh

    For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to compute generators and the structure of this group. This is achieved by reducing the task first to the case of reduced rings, then to torsion-free reduced rings, and finally to an order in a reduced ring. The simplified cases are treated via a calculation of exponent lattices and various algorithms to compute the minimal primes, primitive idempotents, and other basic objects. All algorithms have been implemented and are available as a SageMath package. Whenever possible, the time complexity of the described methods is tracked carefully.


    Volume: Volume 16, Issue 1
    Published on: July 31, 2024
    Accepted on: July 29, 2024
    Submitted on: July 5, 2024
    Keywords: Mathematics - Commutative Algebra,Mathematics - Group Theory,Mathematics - Rings and Algebras,68W30 (Primary) 20F05 13P99 16Z05 (Secondary)

    Consultation statistics

    This page has been seen 565 times.
    This article's PDF has been downloaded 188 times.