Reducibility of Polynomialsf(x, y) Modulo p
โ Scribed by Wolfgang M Ruppert
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 109 KB
- Volume
- 77
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
โฆ Synopsis
We consider absolutely irreducible polynomials f # Z[x, y] with deg x f=m, deg y f=n, and height H. We show that for any prime p with p>[m(n+1) n 2 + (m+1)(n&1) m 2 ] mn+(n&1)ร2 } H 2mn+n&1 the reduction f mod p is also absolutely irreducible. Furthermore if the Bouniakowsky conjecture is true we show that there are infinitely many absolutely irreducible polynomials f # Z[x, y] which are reducible mod p where p is a prime with p H 2m .
๐ SIMILAR VOLUMES
We consider a special case of the problem of computing the Galois group of a system of linear ordinary differential equations Y = M Y , M โ C(x) nรn . We assume that C is a computable, characteristic-zero, algebraically closed constant field with a factorization algorithm. There exists a decision pr
We consider the inequality u t โฅ u -1 2 x โข โu + ฮปu + h x t u p , for p > 1 ฮป โ , posed in N ร + N โฅ 1. We show that, in certain growth conditions, there is an absence of global weak solutions.