Hankel and Multiplication Tensor Completions for Cactus Rank

Abstract

We show that the Hankel flat extension formulation of the cactus algorithm is equivalent to a completion problem for multiplication tensors of Artinian Gorenstein algebras. The unknown Hankel moments are canonically identified with the undetermined tensor coefficients, and under this identification the symbolic multiplication matrices and their commutation equations coincide. This shows that the usual degree extension formulation is a coordinate realization of a variable extension problem with marked generators. We further use Borel-fixed and squat staircases to reduce the family of candidate basis shapes in the resulting algorithm.