RUS  ENG
Full version
JOURNALS // Zapiski Nauchnykh Seminarov POMI // Archive

Zap. Nauchn. Sem. POMI, 2013 Volume 411, Pages 191–239 (Mi znsl5640)

This article is cited in 2 papers

A deterministic polynomial-time algorithm for the first Bertini theorem. I

A. L. Chistov

St. Petersburg Department of V. A. Steklov Institute of Mathematics, Russian Academy of Sciences, St. Petersburg, Russia

Abstract: 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 degree 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. The algorithm is deterministic and polynomial in $(dd')^n$ and the size of the input.

Key words and phrases: first Bertini theorem, polynomial algorithm.

UDC: 513.6+518.5

Received: 04.02.2013


 English version:
Journal of Mathematical Sciences (New York), 2014, 196:2, 223–243

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024