On irreducible polynomials over \(\mathbb Q\) which are reducible over \(\mathbb F_p\) for all \(p\) (Q613521)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On irreducible polynomials over \(\mathbb Q\) which are reducible over \(\mathbb F_p\) for all \(p\) |
scientific article |
Statements
On irreducible polynomials over \(\mathbb Q\) which are reducible over \(\mathbb F_p\) for all \(p\) (English)
0 references
21 December 2010
0 references
In this paper, the author studies particular classes of irreducible polynomials over \({\mathbb Q}\) which are reducible over \({\mathbb F}_p\) for every prime number \(p\), a property referred to as \((P)\) in the paper, and also in this review. As examples, he shows that if two number fields satisfy some condition of linear disjointness, then the minimal polynomial of every algebraic integer which is a primitive element for the compositum of the two number fields satisfies \((P)\). It is also shown that the trinomial \(x^n-nax^{n-1}-b\) satisfies property \((P)\) for all even integers \(n\geq 4\), and integers \(a\neq 0\) and \(b\) not of the form \((-1)^{n/2}c^{2}- a^n(n-1)^{n-1}\) (for some arbitrary integer \(c\)) with finitely many exceptions. The proofs use standard tools from Galois theory and algebraic number theory together with Siegel's theorem concerning the finiteness of integer solutions to elliptic and hyperelliptic Diophantine equations.
0 references
irreducible polynomials
0 references
trinomials
0 references
applications of Siegel's theorem
0 references