An FGLM-like algorithm for computing the radical of a zero-dimensional ideal

Abstract

We present a linear algebra algorithm, which, given a zero-dimensional ideal via a “good” representation, produces a separating linear form, its radical, again given via the same “good” representation and also a Kronecker parametrization of it. As an irrelevant byproduct, if you like, you can also read a Gröbner basis of the radical.