🔢 mathematics

Rank of Pólya Groups in Lecacheux Parametric Family of Quintic Fields

This paper investigates the Pólya groups of Lecacheux quintic fields, demonstrating that their ranks can be arbitrarily large elementary abelian 5-groups with positive density, which implies the existence of infinite 5-class field towers for a positive proportion of these fields, while also establishing upper bounds for Pólya numbers and proving non-monogeneity for specific cases.

Original authors: Nimish Kumar Mahapatra, Prem Prakash Pandey

Published 2026-07-02

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Nimish Kumar Mahapatra, Prem Prakash Pandey

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are exploring a vast, mysterious landscape made of numbers. In this world, there are special "cities" called number fields. Just like a city has a layout of streets and buildings, a number field has a structure of numbers and rules for how they interact.

Sometimes, in these cities, things get messy. You might try to break a number down into its simplest building blocks (prime numbers), but the rules get confusing, and you can't do it in just one unique way. Mathematicians call this a failure of "unique factorization."

This paper is about a specific type of city called a Lecacheux quintic field. Think of these as a new, custom-built neighborhood where the layout is determined by a specific recipe (a polynomial equation) involving a variable we'll call $s$ . The authors, Nimish Kumar Mahapatra and Prem Prakash Pandey, decided to investigate the "traffic patterns" and "structural integrity" of these cities.

Here is a breakdown of their discoveries using simple analogies:

1. The "P´olya Group": Measuring the Messiness

In these number cities, there is a special group of rules called the P´olya group. You can think of this group as a scorecard that measures how far the city is from being perfectly organized.

If the score is zero, the city is perfectly organized (a "P´olya field").
If the score is high, the city is chaotic and complex.

The authors wanted to know: How messy can these Lecacheux cities get? Can we build a city with an arbitrarily high messiness score?

2. The Main Discovery: Infinite Messiness

The paper proves that yes, you can make these cities as messy as you want.
By changing the value of the variable $s$ (specifically using odd numbers), the authors showed that the "messiness score" (the rank of the P´olya group) can be pushed higher and higher.

The Analogy: Imagine you have a dial labeled $s$ . If you turn the dial to certain odd numbers, the city's complexity explodes. The authors proved that for any level of complexity you can name (say, "level 100" or "level 1 million"), there are infinitely many settings of $s$ that create a city with at least that much complexity.
The Density: It's not just that these messy cities exist; they are common. If you picked a random odd number for $s$ , there is a real, positive chance you'd land on a city with a very high messiness score.

3. The "Infinite Tower" (The Golod-Shafarevich Connection)

The paper connects this messiness to a famous concept called the class field tower.

The Analogy: Imagine a city trying to build a tower to fix its problems. If the city is too messy (has a high enough P´olya group), the tower never stops growing. It becomes an infinite tower.
The Result: Because the authors found so many cities with high messiness scores, they proved that for a significant portion of these Lecacheux cities, the "fix-it tower" will never end. It goes up forever. They even gave specific examples (like $s = -189$ ) where this infinite tower happens.

4. The "Index One" Mystery

There is a concept called monogeneity.

The Analogy: A city is "monogenic" if you can describe its entire layout using just one single master blueprint (a single number $\theta$ ). If you need multiple blueprints, it's "non-monogenic."
The Surprise: Usually, if a city is messy, it's because it's hard to describe with one blueprint. However, the authors found a strange group of Lecacheux cities that are non-monogenic (they need multiple blueprints) even though their "index" (a measure of how far they are from being simple) is 1.
Why it matters: This is like finding a house that looks perfectly simple from the outside (index 1) but has a secret, complex internal structure that requires multiple keys to unlock. The paper proves these specific "tricky" houses exist in this family.

5. The "Cube-Free" Condition

To make their math work, the authors had to ensure that certain numbers derived from their recipe ( $E_1$ and $E_2$ ) didn't have "cube" factors (like $2^3$ or $3^3$ ).

The Analogy: Think of these numbers as ingredients. If an ingredient has a "cube" hidden inside, it ruins the recipe. The authors used computer programs (SageMath and Mathematica) to check millions of recipes. They found that 99.37% of the time, the ingredients were clean (cube-free), meaning their mathematical rules applied to almost all the cities they looked at.

Summary

In short, this paper introduces a new family of number cities. The authors discovered that:

You can tune these cities to be infinitely complex.
These complex cities are common, not rare.
Because they are so complex, they have infinite towers of extensions.
Some of these cities are deceptively simple (index 1) but still require complex blueprints to understand.

They didn't just guess this; they used deep number theory, computer calculations, and famous theorems from the past to prove it rigorously.

Technical Summary: Rank of Pólya Groups in Lecacheux Parametric Family of Quintic Fields

Problem Statement
The paper investigates the structure and rank of the Pólya group, $Po(K)$, within a specific parametric family of cyclic quintic number fields known as Lecacheux quintic fields. The Pólya group is a subgroup of the ideal class group $Cl(K)$ generated by the classes of characteristic ideals $J_n(K)$ , which measure the deviation of a number field from being a "Pólya field" (a field where the ring of integer-valued polynomials admits a regular basis). While the classification of Pólya fields is well-established for quadratic, cyclic cubic, and cyclic quartic/sextic fields, the behavior of Pólya groups in quintic extensions remains less understood. Specifically, the authors address the distribution of the 5-rank of these groups and the existence of fields with arbitrarily large Pólya groups within the Lecacheux family.

Methodology
The authors employ a combination of algebraic number theory, analytic number theory, and computational verification:

Parametric Construction: The study focuses on fields $K_s = \mathbb{Q}(\theta_s)$ generated by roots of the Lecacheux quintic polynomial $f_s(X)$ . For odd integers $s$ , these polynomials are irreducible, and the resulting fields are cyclic quintic extensions.
Conductor and Ramification Analysis: Using results from Lecacheux and Chabert, the authors determine the conductor $f(K_s)$ and the ramification indices. They establish that the primes ramifying in $K_s/\mathbb{Q}$ are precisely the prime divisors of two specific quartic polynomials, $E_1(s, 1)$ and $E_2(s, 1)$ , provided these values are cube-free.
Algebraic Characterization: The paper utilizes the fact that for cyclic extensions of odd degree, the Pólya group is generated by ambiguous ideal classes. By analyzing the norm equations in $\mathbb{Q}(\zeta_5)$ , the authors prove that any prime $p \neq 5$ dividing $E_1(s, 1)$ or $E_2(s, 1)$ must satisfy $p \equiv 1 \pmod 5$ . This allows for a precise calculation of the order of the Pólya group: $|Po(K_s)| = 5^{\omega(E_1 E_2) - 1}$ , where $\omega(t)$ is the number of distinct prime factors of $t$ .
Density Arguments: To prove the existence of fields with large ranks, the authors apply Hooley's theorem on the distribution of power-free values of irreducible polynomials and the normal order of the number of prime factors $\omega(f(n))$ . They demonstrate that the set of odd integers $s$ for which $E_1(s, 1)$ and $E_2(s, 1)$ are simultaneously cube-free and possess a large number of distinct prime factors has positive lower natural density.
Monogeneity and Index Analysis: The paper investigates whether these fields are monogenic (i.e., $\mathcal{O}_K = \mathbb{Z}[\theta]$ ). By applying Gras's theorem on monogeneity of cyclic fields and Zylinski's bound on the index of the field, the authors analyze the discriminant relations to determine conditions under which the fields are non-monogenic despite having an index of 1.
Computational Verification: Extensive computations using SageMath and Wolfram Mathematica were performed to verify the irreducibility, cube-free conditions, and specific values of the Pólya group orders for $s$ in the range $[-200, 200]$ .

Key Contributions and Results

Arbitrarily Large 5-Rank: The primary result (Theorem 1.1) states that for every positive integer $k$ , the set of odd integers $s$ such that the 5-rank of the Pólya group of $K_s$ is at least $k$ has a positive density. Specifically, $(\mathbb{Z}/5\mathbb{Z})^k \subseteq Po(K_s)$ for a positive proportion of $s$ .
Infinite Class Field Towers: By combining the main result with the Golod-Shafarevich theorem, the authors prove (Corollary 1.2) that for a positive proportion of integers $s$ , the 5-class field tower of the Lecacheux quintic field $K_s$ is infinite. Explicit examples are provided (e.g., $s = -189, 177, 183$ ).
Characterization of Pólya Fields: The paper characterizes exactly when a Lecacheux quintic field is a Pólya field: $K_s$ is a Pólya field if and only if $s = \pm 1$ . For all other odd integers $s$ where $E_1$ and $E_2$ are cube-free, the field is not a Pólya field.
Non-Monogeneity with Index One: The authors prove (Theorem 1.3) that for odd integers $s \neq \pm 1$ where $E_1(s, 1)$ and $E_2(s, 1)$ are cube-free and $3 \nmid s$ , the field $K_s$ is not monogenic, yet its field index $I(K_s)$ is 1. This provides explicit examples of non-monogenic fields where the obstruction is not local.
Upper Bound on Pólya Numbers: An upper bound for the Pólya number $po_{K_s}$ (the minimal degree of an extension making the field a Pólya field) is established in terms of the order of the Pólya group: $po_{K_s} \leq |Po(K_s)|$ .

Significance
The paper claims to be the first instance where the distribution of ranks of Pólya groups within a specific family of number fields is systematically studied. The results provide strong evidence for the folklore conjecture that the $m$ -rank of the class group is unbounded for number fields of degree $d$ when $m|d$ (specifically for $m=d=5$ ). Furthermore, the construction of fields with infinite 5-class field towers and non-monogenic fields with index one contributes to the understanding of the arithmetic complexity of cyclic quintic fields. The computational data presented supports the theoretical density arguments, showing that the conditions required for large Pólya groups are satisfied by the vast majority of parameters in the studied range.