Reducing the number of variables of a polynomial

2005/07/26 by Enrico Carlini, Carlini, Enrico · 1 citation
Computer Science · Mathematics · #Blind Source Separation Techniques #Numerical Methods and Algorithms #Polynomial and algebraic computation #math.AC #math.AG #msc:14Q20

paper · pdf · doi:10.48550/arxiv.math/0507531

arxiv created 2005/07/26 · arxiv updated 2009/12/01

Abstract

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.

Cited by

• On singularities of third secant varieties of Veronese embeddings

Related

• A note on Solving Parametric Polynomial Systems
• A new method for reducing algebraic programs to polynomial programs
• The polynomial method over varieties
• Derandomization and absolute reconstruction for sums of powers of linear forms
• The multivariate Hermite method for counting real and complex solutions to polynomial systems