3 citations · 3 across the 5 of their papers we have counts for
6 papers · 1 filter
Graded Algebras over Polynomial Rings
Martin Kreuzer, Lorenzo Robbiano
Given a trivially graded polynomial ring over a field and a positively graded polynomial ring , we study graded rings , where $I…
Efficiently Checking Separating Indeterminates
Bernhard Andraschko, Martin Kreuzer, Le Ngoc Long
In this paper we continue the development of a new technique for computing elimination ideals by substitution which has been called -separating re-embeddings. Given an ideal …
Computing the unit group of a commutative finite -algebra
Martin Kreuzer, Florian Walsh
For a commutative finite -algebra, i.e., for a commutative ring whose additive group is finitely generated, it is known that the group of units of is finitely g…
Elimination by Substitution
Martin Kreuzer, Lorenzo Robbiano
Let be a field and . The technique of elimination by substitution is based on discovering a coherently -separating tuple of polynomials $…
Efficient Algorithms for Finite -Algebras
Martin Kreuzer, Florian Walsh
For a finite -algebra , i.e., for a -algebra which is a finitely generated -module, we assume that is explicitly given by a system of $\m…
Computing the Binomial Part of a Polynomial Ideal
Martin Kreuzer, Florian Walsh
Given an ideal in a polynomial ring over a field , we present a complete algorithm to compute the binomial part of , i.e., the subideal …