Group Theory – Analyzing the Galois group of the polynomial x^n + x^{n-1} + … + x^2 + 1

galois-theorygroup-theoryirreducible-polynomialspolynomials

As we already know, the following polynomial is irreducible over $\mathbb Q[x]$:

$$x^n + x^{n-1} + \cdots + x^2 + x – 1 = \frac{x^{n+1} – 2x + 1 }{ x-1}.$$

By Descartes' rule of signs, it has only 1 positive real root.
It seems, though I do not know how to prove it yet, that there is only 1 real root if $n$ is odd and 2 real roots of opposite signs if $n$ is even.

Computational tests, conducted with GAP, suggest that the Galois group
of this polynomial is $S_n$. How we can actually prove it?

Any help is greatly appreciated.

Best Answer

The polynomial $$ f(x)=x^n+x^{n-1}+\cdots +x^2+x-1 $$ is the negative reciprocal of the generalised Fibonacci polynomial $x^n-x^{n-1}-\cdots -x-1$. Its Galois group is indeed isomorphic to $S_n$, because both $f(x)$ and $g(x)=-x^nf(1/x)$ do have the same Galois group. The Galois group of $g(x)$ was computed in the article The Galois group of $x^n-x^{n-1}-\cdots -x-1$ by P. A Martin in $2004$, for even $n$ and odd prime $n$. The result is the symmetric group $S_n$. He conjectures that it is true for all $n$.

See also the article On the Galois group of the generalised Fibonacci polynomial by Mihai Cipu and Florian Luca, which also comment on the fact that both Galois groups are isomorphic.

Related Question