Reducing the number of variables of a polynomial
Enrico Carlini
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.
Create a lesson
Related papers
Counterexamples to Minkowski-type inequalities and the Rees converse for modules via mixed Buchsbaum-Rim Multiplicities
V. H. Jorge Perez
A complex associated to a family of ideals and applications to subspace arrangements
Aldo Conca, Manolis C. Tsakiris
On the Isotropy Groups of Locally Finite Derivations of Laurent Polynomial Algebras
Anderson Porto, Marcelo Veloso
Hook algebras and determinantal varieties
Steven V Sam, Keller VandeBogert, Jerzy Weyman
Polycubes and polycube ideals
Ayesha Asloob Qureshi, Dharm Veer
Derived functors and Hilbert polynomials over dominant Cohen-Macaulay rings
Tony J. Puthenpurakal