Papers
Topics
Authors
Recent
Search
2000 character limit reached

Some observations concerning reducibility of quadrinomials

Published 20 Oct 2013 in math.NT | (1310.5346v1)

Abstract: In a paper \cite{Jan}, Jankauskas proved some interesting results concerning the reducibility of quadrinomials of the form $f(4,x)$, where $f(a,x)=x{n}+x{m}+x{k}+a$. He also obtained some examples of reducible quadrinomials $f(a,x)$ with $a\in\Z$, such that all the irreducible factors of $f(a,x)$ are of degree $\geq 3$. In this paper we perform a more systematic approach to the problem and ask about reducibility of $f(a,x)$ with $a\in\Q$. In particular by computing the set of rational points on some genus two curves we characterize in several cases all quadrinomials $f(a,x)$ with degree $\leq 6$ and divisible by a quadratic polynomial. We also give further examples of reducible $f(a,x)$, $a\in\Q$, such that all irreducible factors are of degree $\geq 3$.

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.

Authors (2)

Collections

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