On the monogenicity and Galois groups of $\boldsymbol{x^{2p}+ax^p+b^p}$

This paper characterizes the monogenicity of irreducible trinomials of the form $x^{2p}+ax^p+b^p$ (where $p$ is prime) by classifying them according to their Galois groups, thereby extending the authors' previous research.

The Gist

Imagine you are a master builder trying to construct a perfect, unbreakable fortress. In the world of mathematics, this "fortress" is a specific type of number system called a Number Field. To build it, you start with a blueprint, which is a polynomial equation (a math formula with $x$'s).

This paper, written by Joshua Harrington and Lenny Jones, is about figuring out exactly when a specific type of blueprint creates a "perfect" fortress.

Here is the breakdown of their discovery, translated into everyday language:

1. The Blueprint: The Trinomial

The authors are looking at a very specific shape of blueprint:
$$f(x) = x^{2p} + ax^p + b^p$$
Think of this as a recipe.

• $p$ is a prime number (like 3, 5, 7, 11). It's the "spice level" of the recipe.
• $a$ and $b$ are integers (whole numbers) that you can choose.
• The recipe is special because it only has three ingredients (a "trinomial").

2. The Goal: "Monogenicity" (The Perfect Foundation)

When you solve this equation, you get a new number, let's call it $\theta$. This number generates a whole new world of numbers (the Number Field).

Usually, to describe all the numbers in this new world, you need a messy, complicated set of building blocks. But sometimes, you get lucky. Sometimes, the simplest possible set of blocks—just powers of your single number $\theta$ (like $1, \theta, \theta^2, \dots$)—is enough to build the entire fortress perfectly.

• Monogenic = The fortress is built on a perfect, simple foundation. You don't need any extra, weird bricks.
• Not Monogenic = The foundation is cracked or messy. You need to import extra, strange bricks to finish the job.

The authors want to know: For which recipes ($a$ and $b$) do we get a perfect foundation?

3. The Detective Work: Galois Groups

To solve this, the authors act like detectives looking at the "symmetry" of the blueprint. In math, this is called the Galois Group.

• Think of the Galois Group as the "fingerprint" of the equation. It tells you how the roots of the equation can be shuffled around without breaking the rules of math.
• The paper classifies these fingerprints into three main types (like sorting keys into three different keychains).

4. The Big Discovery

The authors found that whether your fortress is "perfect" (monogenic) depends entirely on two things:

1. The Shape of the Fingerprint (Galois Group): Which of the three keychains does your equation belong to?
2. The Specific Ingredients ($a$ and $b$): Once you know the fingerprint, there are very strict rules about what numbers $a$ and $b$ can be.

Here are the three scenarios they found:

• Scenario A (The Rare Gem): If your equation has a specific "cyclic" fingerprint, it is only perfect if your numbers are very specific, like $a=3$ and $b=1$ (for prime 5). It's like finding a specific combination lock that only opens with one specific key.
• Scenario B (The Symmetrical Case): If your fingerprint is a mix of two groups, it's only perfect if you use the number 3 and specific small integers.
• Scenario C (The Infinite Ocean): If your fingerprint is the "standard" type, you have infinite possibilities! As long as your numbers $a$ and $b$ follow a simple rule (like "don't have any square factors"), you can build a perfect fortress.

5. The "Magic" Connection (Corollary 1.3)

The most exciting part of the paper is a side effect of their discovery. They found a link between building these perfect fortresses and finding prime numbers.

They proved that:

You can build an infinite number of these perfect fortresses using the recipe $x^{2p} + ax^p - 1$ IF AND ONLY IF there are infinitely many prime numbers that look like $z^2 + 4$ (a number squared, plus 4).

The Analogy:
Imagine you are trying to build an infinite supply of perfect houses. The authors say, "We can only do this if there is an infinite supply of a very specific type of brick (primes of the form $z^2+4$)."

• If mathematicians ever prove that there are infinite "z-squared-plus-4" primes, then we instantly know there are infinite perfect fortresses of this type.
• If there aren't, then the supply of perfect fortresses is limited.

Summary

This paper is a map. It tells mathematicians exactly which "recipes" for number fields result in a clean, simple foundation (monogenic) and which ones result in a messy one. It connects the abstract art of building number systems with the ancient, unsolved mystery of how prime numbers are distributed in nature.

In short: They figured out the exact ingredients needed to build a "perfect" mathematical world, and they discovered that doing so is tied to a fundamental mystery about prime numbers.

Technical Summary

Here is a detailed technical summary of the paper "On the Monogenicity and Galois Groups of $x^{2p} + ax^p + b^p$" by Joshua Harrington and Lenny Jones.

1. Problem Statement

The paper investigates the monogenicity of a specific family of trinomial polynomials defined as:
$$f(x) = x^{2p} + ax^p + b^p$$
where $p \geq 3$ is a prime number, and $a, b \in \mathbb{Z}$ with $ab \neq 0$.

Key Definitions:

• Monogenic: A polynomial $f(x)$ is monogenic if it is irreducible over $\mathbb{Q}$ and the powers of its root $\theta$ (i.e., $\{1, \theta, \theta^2, \dots, \theta^{2p-1}\}$) form an integral basis for the ring of integers $\mathcal{O}_K$ of the number field $K = \mathbb{Q}(\theta)$.
• Discriminant Relation: Monogenicity is equivalent to the condition that the discriminant of the polynomial, $\Delta(f)$, equals the discriminant of the number field, $\Delta(K)$. If they differ, the index $[\mathcal{O}_K : \mathbb{Z}[\theta]] > 1$.
• Context: The authors build upon previous work where they determined the Galois groups of these polynomials. The specific problem addressed here is characterizing exactly which parameters $(p, a, b)$ result in a monogenic polynomial, specifically focusing on the case where the prime $p$ divides the discriminant $\delta = a^2 - 4b^p$ (a case previously less understood than when $p \nmid \delta$).

2. Methodology

The authors employ a combination of algebraic number theory, Galois theory, and specific criteria for monogenicity.

• Reduction to Lower Degree: They utilize Theorem 2.1 (Kaur, Kumar, and Remete), which states that for $f(x) = g(x^p)$, $f(x)$ is monogenic if and only if:

  1. $g(0)$ is squarefree.
  2. The prime $p$ does not divide the index of $f(x)$.
  3. The base polynomial $g(x)$ is monogenic.
     In this context, $g(x) = x^2 + ax + b^p$.

• Index Analysis via Theorem 2.2: To determine if $p$ divides the index, they apply Theorem 2.2 (Jakhar, Khanduja, and Sangwan). This theorem provides necessary and sufficient conditions for a prime divisor of the discriminant not to divide the index. The authors specifically analyze Condition (iv) of this theorem, which involves checking the coprimality of two auxiliary polynomials, $H_1(x)$ and $H_2(x)$, modulo $p$.

• Case Analysis based on Galois Groups: The authors categorize the problem based on the structure of the Galois group $\text{Gal}(f)$, which was previously determined in Theorem 1.1. The structure depends on:

  • The congruence of $p$ modulo 4.
  • Whether $\delta = a^2 - 4b^p$ is of the form $\pm p y^2$.
  • The specific cases analyzed include:
    • $\text{Gal}(f) \simeq C_p \rtimes C_{p-1}$
    • $\text{Gal}(f) \simeq (C_p \rtimes C_{(p-1)/2}) \times C_2$
    • $\text{Gal}(f) \simeq (C_p \rtimes C_{p-1}) \times C_2$

• Squarefree Conditions: A crucial part of the methodology involves deriving conditions where specific quadratic forms (like $a^2 - 4b$) are squarefree, ensuring the base polynomial $g(x)$ is monogenic (via Lemma 2.3).

3. Key Contributions and Results

The paper provides a complete characterization of monogenic trinomials $f(x)$ under the condition $p \mid \delta$.

Theorem 1.2: Characterization of Monogenicity

The main result classifies monogenicity based on the Galois group structure:

1. Case $\text{Gal}(f) \simeq C_p \rtimes C_{p-1}$:

   • Occurs when $p \equiv 1 \pmod 4$ and $\delta = p y^2$.
   • Result: $f(x)$ is monogenic if and only if $(p, a, b) \in \{(5, \pm 3, 1), (a^2+4, a, -1)\}$.
   • This implies specific solutions like $x^{10} \pm 3x^5 + 1$ and an infinite family where $b=-1$ and $p = a^2+4$.

2. Case $\text{Gal}(f) \simeq (C_p \rtimes C_{(p-1)/2}) \times C_2$:

   • Occurs when $p \equiv 3 \pmod 4$ and $\delta = -p y^2$.
   • Result: $f(x)$ is monogenic if and only if $(p, a, b) = (3, \pm 1, 1)$.
   • This yields the specific polynomials $x^6 \pm x^3 + 1$.

3. Case $\text{Gal}(f) \simeq (C_p \rtimes C_{p-1}) \times C_2$:

   • Occurs when $\delta \neq (-1)^{p(p-1)/2} p y^2$.
   • Subcase (a): If $\delta = (-1)^{p(p+1)/2} p y^2$, monogenicity holds only for $(3, \pm 4, 1)$.
   • Subcase (b): If $\delta$ is not of the form above, monogenicity holds if:
     • $b=1$ and $(a-2)(a+2)$ is squarefree.
     • $b=-1$ and $(a^2+4)/\gcd(2,a)^2$ is squarefree.
   • Significance: The authors prove that for any prime $p \geq 3$, there exist infinitely many such monogenic trinomials in this category.

Corollary 1.3: Connection to Prime Distribution

A striking consequence links the existence of monogenic polynomials to the distribution of primes of the form $z^2 + 4$.

• Statement: For any $N > 2$, there exists a prime $p > N$ such that $f(x) = x^{2p} + ax^p - 1$ is monogenic with Galois group $C_p \rtimes C_{p-1}$ if and only if there exist infinitely many primes of the form $z^2 + 4$.
• This establishes a conditional equivalence between a deep number-theoretic conjecture (infinitude of primes $z^2+4$) and the existence of an infinite family of monogenic trinomials.

4. Significance

• Completeness of Classification: The paper fills a gap in the literature by fully characterizing the monogenicity of this trinomial family when $p$ divides the discriminant, a scenario where standard criteria often fail.
• Infinite Families: It demonstrates that while some Galois group configurations yield only finite examples of monogenic polynomials (e.g., the $p=3$ case), others yield infinite families, provided certain squarefree conditions are met.
• Interdisciplinary Link: By connecting the algebraic property of monogenicity to the analytic property of prime distribution (Corollary 1.3), the work highlights deep structural relationships between polynomial rings and prime number theory.
• Methodological Utility: The application of Theorem 2.2 to verify the non-divisibility of the index by $p$ provides a robust template for analyzing monogenicity in other high-degree trinomial families.

In summary, Harrington and Jones successfully map the landscape of monogenicity for $x^{2p} + ax^p + b^p$, providing explicit parameter sets for finite cases and proving the existence of infinite families for others, while linking these algebraic properties to the distribution of primes.