Papers
Topics
Authors
Recent
Search
2000 character limit reached

Determinantal computation of minimal local GADs

Published 9 Mar 2026 in math.AC, math.AG, and math.RA | (2603.08836v1)

Abstract: 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.