Zapiski Nauchnykh Seminarov POMI
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Zapiski Nauchnykh Seminarov POMI, 2013, Volume 411, Pages 191–239 (Mi znsl5640)  

This article is cited in 2 scientific papers (total 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
Full-text PDF (509 kB) Citations (2)
References:
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.
Received: 04.02.2013
English version:
Journal of Mathematical Sciences (New York), 2014, Volume 196, Issue 2, Pages 223–243
DOI: https://doi.org/10.1007/s10958-013-1655-4
Bibliographic databases:
Document Type: Article
UDC: 513.6+518.5
Language: Russian
Citation: A. L. Chistov, “A deterministic polynomial-time algorithm for the first Bertini theorem. I”, Representation theory, dynamical systems, combinatorial methods. Part XXII, Zap. Nauchn. Sem. POMI, 411, POMI, St. Petersburg, 2013, 191–239; J. Math. Sci. (N. Y.), 196:2 (2014), 223–243
Citation in format AMSBIB
\Bibitem{Chi13}
\by A.~L.~Chistov
\paper A deterministic polynomial-time algorithm for the first Bertini theorem.~I
\inbook Representation theory, dynamical systems, combinatorial methods. Part~XXII
\serial Zap. Nauchn. Sem. POMI
\yr 2013
\vol 411
\pages 191--239
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl5640}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3048277}
\transl
\jour J. Math. Sci. (N. Y.)
\yr 2014
\vol 196
\issue 2
\pages 223--243
\crossref{https://doi.org/10.1007/s10958-013-1655-4}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84897101855}
Linking options:
  • https://www.mathnet.ru/eng/znsl5640
  • https://www.mathnet.ru/eng/znsl/v411/p191
    Cycle of papers
    This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:342
    Full-text PDF :70
    References:52
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024