A refinement on the local cactus rank algorithm
Algebraic Geometry
2025-08-22 v1
Abstract
We present an algorithm to recover a minimal local apolar scheme to a homogeneous polynomial . The socle degree of the scheme determines whether it is evinced by a Generalized Additive Decomposition (GAD) of or of an extension. We give constructive procedures for both cases and compute the Hilbert function efficiently via Hankel operators.
Cite
@article{arxiv.2508.15062,
title = {A refinement on the local cactus rank algorithm},
author = {Alessandra Bernardi and Oriol Reig Fité},
journal= {arXiv preprint arXiv:2508.15062},
year = {2025}
}