A bound for the degree of a system of equations determining the variety of reducible polynomials

DOI10.1090/S1061-0022-2013-01251-9zbMATH Open1283.14026MaRDI QIDQ2849092FDOQ2849092

Authors: A. L. Chistov 

Publication date: 16 September 2013

Published in: St. Petersburg Mathematical Journal (Search for Journal in Brave)

Recommendations

• Irreducibility of Hypersurfaces
• Effective Noether irreducibility forms and applications
• scientific article
• Reduzibilität ebener Kurven.
• Reducibility of polynomials in two variables

zbMATH Keywords

latticesBertini theoremabsolute irreducibility

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials, factorization in commutative rings (13P05) Computational aspects of higher-dimensional varieties (14Q15) Special varieties (14M99)

Cites Work

• Factoring polynomials with rational coefficients
• Vandermonde matrices, NP-completeness and transversal subspaces
• Title not available (Why is that?)
• Pencils on an Algebraic Variety and a New Proof of a Theorem of Bertini

Cited In (9)

• Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. III
• Irreducibility of Hypersurfaces
• A deterministic polynomial-time algorithm for the first Bertini theorem. III
• Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I
• Translates of Polynomials
• Efficient absolute factorization of polynomials with parametric coefficients
• A deterministic polynomial-time algorithm for the first Bertini theorem. II
• An estimate for the number of reducible Bessel polynomials of bounded degree
• Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II

This page was built for publication: A bound for the degree of a system of equations determining the variety of reducible polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849092)