On Centers and Direct Sum Decompositions of Higher Degree Forms
Hua-Lin Huang, Huajun Lu, Yu Ye, Chi Zhang

TL;DR
This paper investigates the algebraic structure of centers of higher degree forms, revealing that most are indecomposable and providing algebraic criteria and algorithms for their decomposition into sums of forms in disjoint variables.
Contribution
It establishes that the center algebra of most higher degree forms is trivial, introduces criteria and algorithms for decomposition, and connects the problem to linear algebra tasks like eigenvalue computation.
Findings
Almost all higher degree forms have trivial center algebra.
Decomposition algorithms reduce to eigenvalue and eigenvector computations.
The structure of center algebras helps determine reconstructibility from Jacobian ideals.
Abstract
Higher degree forms are homogeneous polynomials of degree or equivalently symmetric -linear spaces. This paper is mainly concerned about the algebraic structure of the centers of higher degree forms with applications specifically to direct sum decompositions, namely expressing higher degree forms as sums of forms in disjoint sets of variables. We show that the center algebra of almost every form is the ground field, consequently almost all higher degree forms are absolutely indecomposable. If a higher degree form is decomposable, then we provide simple criteria and algorithms for direct sum decompositions by its center algebra. It is shown that the direct sum decomposition problem can be boiled down to some standard tasks of linear algebra, in particular the computations of eigenvalues and eigenvectors. We also apply the structure results of center algebras to provide a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Polynomial and algebraic computation · Finite Group Theory Research
