Papers
Topics
Authors
Recent
Search
2000 character limit reached

An irreducible class of polynomials over integers

Published 1 Apr 2020 in math.NT | (2004.00233v1)

Abstract: In this article, we consider polynomials of the form $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 $|a_0|\ge |a_{n_1}|+\dots+|a_{n_r}|,$ $|a_0|$ is a prime power and $|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 $n_1$. In the case of equality, apart from its cyclotomic factors, they have exactly one irreducible non-reciprocal factor.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.