Discriminants of polynomials in many variables
โ Scribed by I. M. Gel'fand; A. V. Zelevinskii; M. M. Kapranov
- Publisher
- Springer US
- Year
- 1990
- Tongue
- English
- Weight
- 377 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0016-2663
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We study, for polynomials in many variables, the relations between the complex and the real sup-norms, and we give estimates involving the leading coefficients. We consider the case when the polynomial has a given degree, or some concentration at a given degree. The present paper is a contribution t
We give here an effective massively parallel algorithm allowing factorization of polynomials with non-commuting variables and integer coefficients. This algorithm is built upon the hypercube representation of many-variable polynomials introduced by Beauzamy-Frot-Millou [l], and implemented on the C