A deterministic polynomial-time algorithm for the first Bertini theorem.~III
Zapiski Nauchnykh Seminarov POMI, Representation theory, dynamical systems, combinatorial methods. Part XXIV, Tome 432 (2015), pp. 297-323
Voir la notice de l'article provenant de la source Math-Net.Ru
Consider a projective algebraic variety $W$ that is an irreducible component of the set of all common zeros of a family of homogeneous polynomials of degrees less than $d$ in $n+1$ variables in zero characteristic. Consider a linear system on $W$ given by homogeneous polynomials of degree $d'$. Under the conditions of the first Bertini theorem for $W$ and this linear system, we show how to construct an irreducible divisor in general position from the statement of this theorem. This algorithm is deterministic and polynomial in $(dd')^n$ and the size of the input. This work concludes a tree-part series of papers.
@article{ZNSL_2015_432_a15,
author = {A. L. Chistov},
title = {A deterministic polynomial-time algorithm for the first {Bertini} {theorem.~III}},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {297--323},
publisher = {mathdoc},
volume = {432},
year = {2015},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_2015_432_a15/}
}
A. L. Chistov. A deterministic polynomial-time algorithm for the first Bertini theorem.~III. Zapiski Nauchnykh Seminarov POMI, Representation theory, dynamical systems, combinatorial methods. Part XXIV, Tome 432 (2015), pp. 297-323. http://geodesic.mathdoc.fr/item/ZNSL_2015_432_a15/