60 citations · 106 across the 16 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.NT2019
On the computation of overorders
Tommy Hofmann, Carlo Sircana
The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consid…
math.AC2019
Efficient Gröbner Bases Computation over Principal Ideal Rings
Christian Eder, Tommy Hofmann
In this paper we present a new efficient variant to compute strong Gröbner basis over quotients of principal ideal domains. We show an easy lifting process which allows us to reduc…
math.AC2019★ 1 cited
On Gröbner bases over Dedekind domains
Tommy Hofmann
Gröbner bases are a fundamental tool when studying ideals in multivariate polynomial rings. More recently there has been a growing interest in transferring techniques from the fiel…