Tommy Hofmann

activity

20242026

collaborators

3 papers

math.NT2026

Algorithms for $p$ -rationality and for $p$ -saturation of units

Tommy Hofmann, Henri Johnston

Let $K$ be a number field. We give new practical algorithms that determine whether $K$ is $p$ -rational. For real cyclotomic fields $K = Q (ζ_{n})^{+}$ , our method avoids comp…

math.NT2025

Determining unit groups and $K_{1}$ of finite rings

Tommy Hofmann

We consider the computational problem of determining the unit group of a finite ring, by which we mean the computation of a finite presentation together with an algorithm to expres…

math.NT2024

Determination of the stably free cancellation property for orders

Werner Bley, Tommy Hofmann, Henri Johnston

Let $K$ be a number field, let $A$ be a finite-dimensional semisimple $K$ -algebra, and let $Λ$ be an $O_{K}$ -order in $A$ . We give practical algorithms that determine whe…

Algorithms for p-rationality and for p-saturation of units

Determining unit groups and K1​ of finite rings

Determination of the stably free cancellation property for orders

Algorithms for $p$ -rationality and for $p$ -saturation of units

Determining unit groups and $K_{1}$ of finite rings