English

An irreducible class of polynomials over integers

Number Theory 2020-04-02 v1

Abstract

In this article, we consider polynomials of the form f(x)=a0+an1xn1+an2xn2++anrxnrZ[x],f(x)=a_0+a_{n_1}x^{n_1}+a_{n_2}x^{n_2}+\dots+a_{n_r}x^{n_r}\in \mathbb{Z}[x], where a0an1++anr,|a_0|\ge |a_{n_1}|+\dots+|a_{n_r}|, a0|a_0| is a prime power and a0an1anr|a_0|\nmid |a_{n_1}a_{n_r}|. We will show that under the strict inequality these polynomials are irreducible for certain values of n1n_1. In the case of equality, apart from its cyclotomic factors, they have exactly one irreducible non-reciprocal factor.

Keywords

Cite

@article{arxiv.2004.00233,
  title  = {An irreducible class of polynomials over integers},
  author = {Biswajit Koley and A. Satyanarayana Reddy},
  journal= {arXiv preprint arXiv:2004.00233},
  year   = {2020}
}

Comments

12 pages

R2 v1 2026-06-23T14:34:50.219Z