Algorithmic aspects of Suslin's proof of Serre's conjecture |
| |
Authors: | Leandro Caniglia Guillermo Cortiñas Silvia Danón Joos Heintz Teresa Krick Pablo Solernó |
| |
Affiliation: | (1) Departmento de Matemáticas, Fac. de Ciencias Exactas. Univ. de Buenos Aires, (1428) Buenos Aires, ARGENTINA |
| |
Abstract: | LetF be a unimodularr×s matrix with entries beingn-variate polynomials over an infinite fieldK. Denote by deg(F) the maximum of the degrees of the entries ofF and letd=1+deg(F). We describe an algorithm which computes a unimodulars×s matrixM with deg(M)=(rd)
O(n)
such thatFM=I
r
,O], where I
r
,O] denotes ther×s matrix obtained by adding to ther×r unit matrixI
r
s–r zero columns.We present the algorithm as an arithmetic network with inputs fromK, and we count field operations and comparisons as unit cost.The sequential complexity of our algorithm amounts to
field operations and comparisons inK whereas its parallel complexity isO(n
4
r
4log2(srd)).The complexity bounds and the degree bound for deg(M) mentioned above are optimal in order. Our algorithm is inspired by Suslin's proof of Serre's Conjecture. |
| |
Keywords: | Serre's Conjecture Quillen-Suslin Theorem effective Nullstellensatz linear equation systems over polynomial rings complexity |
本文献已被 SpringerLink 等数据库收录! |