P-irreducibility of binding polynomials

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Irreducibility of Hecke Polynomials

In this note, we show that if the characteristic polynomial of some Hecke operator Tn acting on the space of weight k cusp forms for the group SL2(Z ) is irreducible, then the same holds for Tp, where p runs through a density one set of primes. This proves that if Maeda’s conjecture is true for some Tn, then it is true for Tp for almost all primes p.

متن کامل

IRREDUCIBILITY OF POLYNOMIALS MODULO p VIA NEWTON POLYTOPES

Ostrowski established in 1919 that an absolutely irreducible integral polynomial remains absolutely irreducible modulo all sufficiently large prime numbers. We obtain a new lower bound for the size of such primes in terms of the number of integral points in the Newton polytope of the polynomial, significantly improving previous estimates for sparse polynomials.

متن کامل

On the irreducibility of Hecke polynomials

Let Tn,k(X) be the characteristic polynomial of the nth Hecke operator acting on the space of cusp forms of weight k for the full modular group. We record a simple criterion which can be used to check the irreducibility of the polynomials Tn,k(X). Using this criterion with some machine computation, we show that if there exists n ≥ 2 such that Tn,k(X) is irreducible and has the full symmetric gr...

متن کامل

Irreducibility testing of lacunary 0, 1-polynomials

A reciprocal polynomial g(x) ∈ Z[x] is such that g(0) 6= 0 and if g(α) = 0 then g(1/α) = 0. The non-reciprocal part of a monic polynomial f(x) ∈ Z[x] is f(x) divided by the product of its irreducible monic reciprocal factors (to their multiplicity). This paper presents an algorithm for testing the irreducibility of the nonreciprocal part of a 0, 1-polynomial (a polynomial having each coefficien...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 1999

ISSN: 0898-1221

DOI: 10.1016/s0898-1221(99)00176-5