Reducibility of polynomials \(f(x,y)\) modulo \(p\) (Q1293123): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Reduzibilität ebener Kurven. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility of polynomials \(a_0(x)+a_1(x)y+a_2(x)y^2\) modulo \(p\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur certaines hypothèses concernant les nombres premiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the reduction modulo \(p\) of an absolutely irreducible polynomial \(f(x,y)\) / rank
 
Normal rank

Revision as of 20:00, 28 May 2024

scientific article
Language Label Description Also known as
English
Reducibility of polynomials \(f(x,y)\) modulo \(p\)
scientific article

    Statements

    Reducibility of polynomials \(f(x,y)\) modulo \(p\) (English)
    0 references
    22 February 2000
    0 references
    Let \(f=\sum_{i,j}a_{ij}x^iy^j\in{\mathbb Z}[x,y]\) be an absolutely irreducible polynomial with \(\deg_x f=m\), \(\deg_y f=n\) and let \(H(f)= \max_{i,j} |a_{ij}|\). The author shows that the reduction of \(f\) modulo a prime \(p\) is still absolutely irreducible whenever \[ p>[m(n+1)n^2+(m+1)(n-1)m^2]^{mn+(n-1)/2}\cdot H(f)^{2mn+n-1}. \] This improves upon a result of \textit{U. Zannier} [Arch. Math. 68, 129-138 (1997)] and can be seen as a refinement of a previous result of \textit{W. Ruppert} [J. Reine Angew. Math. 369, 167-191 (1986; Zbl 0584.14012)] (in the latter case the estimate on \(p\) was given in terms of \(H(f)\) and the total degree \(d\) of the polynomial \(f\)). Regarding the quality of the estimate, the author observes that, if the Bouniakowsky conjecture (or the better known Schinzel H conjecture) is true, then there are infinitely many polynomials \(f\in{\mathbb Z}[x,y]\) which are reducible modulo \(p\), where \(p\) is a prime with \(p\geq H(f)^{2m}\).
    0 references
    polynomials
    0 references
    reduction modulo primes
    0 references

    Identifiers