A bound for the degree of a system of equations determining the variety of reducible polynomials
HTML articles powered by AMS MathViewer
- by
A. L. Chistov
Translated by: the author - St. Petersburg Math. J. 24 (2013), 513-528
- DOI: https://doi.org/10.1090/S1061-0022-2013-01251-9
- Published electronically: March 21, 2013
- PDF | Request permission
Abstract:
Let ${\mathbb A}^N(\bar {K})$ denote the affine space of homogeneous polynomials of degree $d$ in $n+1$ variables with coefficients from the algebraic closure $\bar {K}$ of a field $K$ of arbitrary characteristic; so $N=\binom {n+d}{n}$. It is proved that the variety of all reducible polynomials in this affine space can be given by a system of polynomial equations of degree less than $56d^7$ in $N$ variables. This result makes it possible to formulate an efficient version of the first Bertini theorem for the case of a hypersurface.References
- Nicolas Bourbaki, Commutative algebra. Chapters 1–7, Elements of Mathematics (Berlin), Springer-Verlag, Berlin, 1998. Translated from the French; Reprint of the 1989 English translation. MR 1727221
- A. L. Chistov, An algorithm of polynomial complexity for factoring polynomials, and determination of the components of a variety in a subexponential time, Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 137 (1984), 124–188 (Russian, with English summary). Theory of the complexity of computations, II. MR 762101
- A. L. Chistov, A doubly exponential lower bound for the degree of a system of generators of a polynomial prime ideal, Algebra i Analiz 20 (2008), no. 6, 186–213 (Russian, with Russian summary); English transl., St. Petersburg Math. J. 20 (2009), no. 6, 983–1001. MR 2530898, DOI 10.1090/S1061-0022-09-01081-4
- —, A deterministic polynomial-time algorithm for the first Bertini theorem, Preprint of St. Petersburg Math. Soc., 2004, http://www.mathsoc.spb.ru/preprint/2004/index.html
- Alexander Chistov, Hervé Fournier, Leonid Gurvits, and Pascal Koiran, Vandermonde matrices, NP-completeness, and transversal subspaces, Found. Comput. Math. 3 (2003), no. 4, 421–427. MR 2009684, DOI 10.1007/s10208-002-0076-4
- A. K. Lenstra, H. W. Lenstra Jr., and L. Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), no. 4, 515–534. MR 682664, DOI 10.1007/BF01457454
- Oscar Zariski, Pencils on an algebraic variety and a new proof of a theorem of Bertini, Trans. Amer. Math. Soc. 50 (1941), 48–70. MR 4241, DOI 10.1090/S0002-9947-1941-0004241-4
Bibliographic Information
- A. L. Chistov
- Affiliation: St. Petersburg Branch, Steklov Mathematical Institute, Russian Academy of Sciences, Fontanka 27, Saint Petersburg 191023, Russia
- Email: alch@pdmi.ras.ru
- Received by editor(s): November 1, 2011
- Published electronically: March 21, 2013
- © Copyright 2013 American Mathematical Society
- Journal: St. Petersburg Math. J. 24 (2013), 513-528
- MSC (2010): Primary 14Q15; Secondary 14M99, 12Y05, 12E05, 13P05
- DOI: https://doi.org/10.1090/S1061-0022-2013-01251-9
- MathSciNet review: 3014133