On the reducibility type of trinomials

Details On the reducibility type of trinomials On the reducibility type of trinomials

2011-12-19

arxiv.org/abs/1112.4267v1

Mathematics

Number Theory

to appear in Acta Arithmetica

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the reducibility type of trinomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the reducibility type of trinomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the reducibility type of trinomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-210271