Determinantal computation of minimal local GADs

Determinantal computation of minimal local GADs
Notice: This research summary and analysis were automatically generated using AI technology. For absolute accuracy, please refer to the [Original Paper Viewer] below or the Original ArXiv Source.

We study local generalized additive decompositions (GADs) of homogeneous polynomials and their associated point schemes through their local inverse systems. We prove that their construction and algebraic properties are independent of the chosen apolarity action. We propose a determinantal method for computing minimal local GADs by minimizing the rank of a symbolic inverse system. When the locus of minimal supports is finite, this provides a practical method to determine all minimal local decompositions without tensor extensions. We prove that this finiteness is guaranteed whenever the local GAD-rank of the form does not exceed its degree. We analyze both generic and special cases, provide computational evidence assessing the impact of different choices for minors, and compare our approach with existing algorithms for local apolar schemes.


💡 Research Summary

The paper addresses the problem of computing minimal local generalized additive decompositions (GADs) of a homogeneous polynomial F of degree d in k


Comments & Academic Discussion

Loading comments...

Leave a Comment