Reducing the number of variables of a polynomial

In this paper, we consider two basic questions about presenting a homogeneous polynomial f: how many variables are needed for presenting f? How can one find a presentation of f involving as few variables as possible? We give a complete answer to both questions, determining the minimal number of variables needed, NEssVar(f), and describing these variables through their linear span, EssVar(f). Our results give rise to effective algorithms which we implemented in the computer algebra system CoCoA.

[1]  P. Laguna,et al.  Signal Processing , 2002, Yearbook of Medical Informatics.

[2]  Volker Strassen,et al.  Algebraic Complexity Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[3]  G. Quispel,et al.  Splitting methods , 2002, Acta Numerica.

[4]  Anthony V. Geramita,et al.  The Curves Seminar at Queen's , 1981 .

[5]  Ciro Ciliberto,et al.  Geometric Aspects of Polynomial Interpolation in More Variables and of Waring’s Problem , 2001 .

[6]  G. Quispel,et al.  Acta Numerica 2002: Splitting methods , 2002 .

[7]  A. Iarrobino,et al.  Power Sums, Gorenstein Algebras, and Determinantal Loci , 2000 .

[8]  Richard W. Hamming,et al.  Coding and Information Theory , 1980 .

[9]  Steven Roman,et al.  Coding and information theory , 1992 .

[10]  Pierre Comon,et al.  Decomposition of quantics in sums of powers of linear forms , 1996, Signal Process..