Explicit factors of some iterated resultants and discriminants
<|reference_start|>Explicit factors of some iterated resultants and discriminants: In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into irreducible factors of several constructions involving two times iterated univariate resultants and discriminants over the integer universal ring of coefficients of the entry polynomials. Cases involving from two to four generic polynomials and resultants or discriminants in one of their variables are treated. The decompositions into irreducible factors we get are obtained by exploiting fundamental properties of the univariate resultants and discriminants and induction on the degree of the polynomials. As a consequence, each irreducible factor can be separately and explicitly computed in terms of a certain multivariate resultant. With this approach, we also obtain as direct corollaries some results conjectured by Collins and McCallum which correspond to the case of polynomials whose coefficients are themselves generic polynomials in other variables. Finally, a geometric interpretation of the algebraic factorization of the iterated discriminant of a single polynomial is detailled.<|reference_end|>
@article{busé2006explicit,
    title={Explicit factors of some iterated resultants and discriminants},
    author={Laurent Bus'e (INRIA Sophia Antipolis), Bernard Mourrain (INRIA
  Sophia Antipolis)},
    journal={Mathematics of Computation / Mathematics of Computation of the
  American Mathematical Society 78 (2009) 345--386},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0612050},
    primaryClass={cs.SC math.AC math.AG}
}