Florian Walsh

most citedDecomposing Finite

Z

-Algebras

3 citations · 3 across the 2 of their papers we have counts for

collaborators

4 papers

math.AC2024

Computing the unit group of a commutative finite $Z$ -algebra

Martin Kreuzer, Florian Walsh

For a commutative finite $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 g…

math.RA2023★ 3 cited

Decomposing Finite $Z$ -Algebras

Martin Kreuzer, Alexei Miasnikov, Florian Walsh

For a finite $Z$ -algebra $R$ , i.e., for a ring which is not necessarily associative or unitary, but whose additive group is finitely generated, we construct a decompositio…

math.AC2023

Efficient Algorithms for Finite $Z$ -Algebras

Martin Kreuzer, Florian Walsh

For a finite $Z$ -algebra $R$ , i.e., for a $Z$ -algebra which is a finitely generated $Z$ -module, we assume that $R$ is explicitly given by a system of $\m…

math.AC2023

Computing the Binomial Part of a Polynomial Ideal

Martin Kreuzer, Florian Walsh

Given an ideal $I$ in a polynomial ring $K [x_{1}, \dots, x_{n}]$ over a field $K$ , we present a complete algorithm to compute the binomial part of $I$ , i.e., the subideal $Bin (I)$ …

Computing the unit group of a commutative finite Z-algebra

Decomposing Finite Z-Algebras

Efficient Algorithms for Finite Z-Algebras

Computing the Binomial Part of a Polynomial Ideal

Computing the unit group of a commutative finite $Z$ -algebra

Decomposing Finite $Z$ -Algebras

Efficient Algorithms for Finite $Z$ -Algebras