Paper detail

On the reducibility type of trinomials

Say a trinomial $x^n+A x^m+B \in \Q[x]$ has reducibility type $(n_1,n_2,...,n_k)$ if there exists a factorization of the trinomial into irreducible polynomials in $\Q[x]$ of degrees $n_1$, $n_2$,...,$n_k$, ordered so that $n_1 \leq n_2 \leq ... \leq n_k$. Specifying the reducibility type of a monic polynomial of fixed degree is equivalent to specifying rational points on an algebraic curve. When the genus of this curve is 0 or 1, there is reasonable hope that all its rational points may be described; and techniques are available that may also find all points when the genus is 2. Thus all corresponding reducibility types may be described. These low genus instances are the ones studied in this paper.