Degeneracy Loci and Polynomial Equation Solving

Autor: Pablo Solernó, Bernd Bank, Joos Heintz, Marc Giusti, Grégoire Lecerf, Guillermo Matera
Rok vydání: 2014
Předmět:
Zdroj: Foundations of Computational Mathematics. 15:159-184
ISSN: 1615-3383
1615-3375
DOI: 10.1007/s10208-014-9214-z
Popis: Let V be a smooth equidimensional quasi-affine variety of dimension r over the complex numbers $C$ and let $F$ be a $(p\times s)$-matrix of coordinate functions of $C[V]$, where $s\ge p+r$. The pair $(V,F)$ determines a vector bundle $E$ of rank $s-p$ over $W:=\{x\in V:\mathrm{rk} F(x)=p\}$. We associate with $(V,F)$ a descending chain of degeneracy loci of E (the generic polar varieties of $V$ represent a typical example of this situation). The maximal degree of these degeneracy loci constitutes the essential ingredient for the uniform, bounded error probabilistic pseudo-polynomial time algorithm which we are going to design and which solves a series of computational elimination problems that can be formulated in this framework. We describe applications to polynomial equation solving over the reals and to the computation of a generic fiber of a dominant endomorphism of an affine space.
24 pages, accepted for publication in Found. Comput. Math
Databáze: OpenAIRE