# On the reducibility behaviour of Thue polynomials

Source: [On the reducibility behaviour of Thue polynomials](<https://www.sota2.com/research/paper/68fa53341e209131ce981704>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-28T13:55:39.788Z

Authors: Joachim K\\"onig

Published: 2016-10-04T18:00:00.000Z

## 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 $n$-cycle. This statement is finally proven with the help of the classification of primitive permutation groups containing an $n$-cycle (a result which rests on the classification of finite simple groups).

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1610.01110>)

[PDF](<https://arxiv.org/pdf/1610.01110.pdf>)
