English

On the reducibility behaviour of Thue polynomials

Number Theory 2016-10-05 v1

Abstract

We prove a result about reducibility behaviour of Thue polynomials over the rationals that was conjectured by M\"uller. More precisely, we show that, apart from few explicitly given exceptions, these polynomials have only finitely many reducible integer specializations. Special cases have been proved e.g. by M\"uller and Langmann. The proof uses ramification theory to reduce the assertion to a statement about permutation groups containing an nn-cycle. This statement is finally proven with the help of the classification of primitive permutation groups containing an nn-cycle (a result which rests on the classification of finite simple groups).

Keywords

Cite

@article{arxiv.1610.01110,
  title  = {On the reducibility behaviour of Thue polynomials},
  author = {Joachim König},
  journal= {arXiv preprint arXiv:1610.01110},
  year   = {2016}
}

Comments

8 pages

R2 v1 2026-06-22T16:10:30.556Z