🔢 mathematics

On the Squarefree Values of Degree- $2q$ Polynomials

This paper establishes that irreducible monic integer polynomials of degree $2q$ (with $q$ prime) satisfying specific Galois-theoretic conditions take squarefree values with positive density, a result applied to prove the existence of an infinite subfamily of non-Galois totally real cubic fields whose unit shapes converge to the hexagonal lattice.

Original authors: Sergio Ricardo Zapata Ceballos, Fatemeh Jalalvand

Published 2026-08-12

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Sergio Ricardo Zapata Ceballos, Fatemeh Jalalvand

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 a detective trying to solve a mystery about numbers. In the world of mathematics, there is a special club called "squarefree numbers." A number belongs to this club if it isn't divisible by any perfect square (like 4, 9, 16, or 25) other than 1. Think of it like a building made of Lego bricks: a squarefree building is one where no two identical bricks are stacked directly on top of each other to form a solid square block. Mathematicians have long wondered: if you plug different whole numbers into a specific type of formula (a polynomial), will you keep finding these special "squarefree" results forever, or will the club eventually run out of members?

This question is a big deal in number theory, a branch of math that studies the hidden patterns of integers. For simple formulas, we already know the answer: yes, you find plenty of squarefree numbers. But as the formulas get more complicated, the mystery deepens. It's like trying to predict the weather; for a sunny day, it's easy, but for a complex storm system, it's incredibly hard to be sure. This paper dives into a specific, tricky type of formula to see if it produces squarefree numbers often enough to matter. The answer isn't just a dry "yes"; it unlocks a secret door to understanding the shapes of invisible mathematical lattices, which are like the crystal structures of the number world.

The Squarefree Hunt: A Tale of Polynomials and Lattices

In this paper, authors Sergio Ricardo Zapata Ceballos and Fatemeh Jalalvand tackle a stubborn puzzle: Do certain complicated math formulas produce "squarefree" numbers often enough to be considered a regular occurrence?

To understand their victory, let's look at the tools they used. Imagine you have a giant, complex machine (a polynomial of degree $2q$ , where $q$ is a prime number) that spits out numbers. The authors wanted to prove that if you feed this machine enough different whole numbers, it will keep churning out "squarefree" results (numbers with no hidden square factors) with a positive density. In plain English, this means you won't just find a few lucky examples; you will find them so frequently that they make up a significant chunk of all the numbers you could possibly test.

The Magic Trick: Breaking the Problem in Half
The authors didn't try to solve the whole monster problem at once. Instead, they used a clever trick involving a "sub-field." Think of the complex number world generated by their formula as a massive, multi-story mansion. Inside this mansion, there is a smaller, simpler room (a sub-field) that has a special symmetry (it's a Galois extension).

Because of this symmetry, the authors realized they could break their giant, complicated formula down into a much simpler quadratic equation (a degree-2 polynomial) living inside that smaller room. It's like trying to count the grains of sand on a massive beach; instead of counting every single grain, they found a way to count the grains in a small, representative bucket and then use a map (the "norm" map) to scale that count up to the whole beach.

They proved two critical things to make this work:

No Double-Counting: The "prime factors" (the building blocks of the numbers) in the smaller room behave nicely when they move back up to the big room. They don't get duplicated or confused with their "twins" (conjugates).
The Safety Net: They showed that as long as the formula doesn't have a specific "bad" property (related to its discriminant), the squarefree nature is preserved when moving from the small room to the big one.

By using a method called a "sieve" (which is like a kitchen strainer that lets the good numbers through while catching the bad ones), they demonstrated that for a specific family of these high-degree formulas, there is indeed a positive density of squarefree values. This means there are infinitely many such numbers, and they appear frequently.

The Surprising Application: Hexagonal Lattices
But the story doesn't end with just counting numbers. The authors used their new tool to solve a mystery about "cubic fields"—a different type of number system. Specifically, they looked at "exceptional cubic fields," which are special, non-symmetrical number worlds that are totally real (meaning all their numbers are on the real number line, not imaginary).

In these fields, there are special numbers called "units." If you take the logarithms of these units, they form a grid or a "lattice" in space. Mathematicians have long known that if a cubic field is perfectly symmetrical (Galois), its unit lattice looks like a perfect hexagonal lattice (like a honeycomb). However, for the messy, non-symmetrical exceptional fields, no one knew what their lattices looked like.

Using their new proof about squarefree numbers, the authors verified a conjecture by a mathematician named Ennola. They showed that for a huge, infinite family of these messy cubic fields, the "unit shapes" (the honeycomb patterns) actually converge to the hexagonal lattice.

Why This Matters
This is a big deal because it's the first time anyone has proven that a family of these non-symmetrical, totally real cubic fields has unit shapes that settle into the beautiful, efficient hexagonal pattern. It's like discovering that even in a chaotic, messy neighborhood, the houses eventually arrange themselves into a perfect honeycomb pattern if you look at enough of them.

The paper doesn't just guess this; it proves it. By establishing that the underlying formulas produce squarefree numbers often enough, they confirmed that the mathematical structures behave exactly as Ennola predicted for a positive proportion of these fields. So, while the general mystery of squarefree values for all high-degree polynomials remains unsolved, this paper has cracked the code for a specific, important family, revealing a hidden order in the chaos of number theory.

Technical Summary: On the Squarefree Values of Degree-2q Polynomials

Problem Statement
The paper addresses the longstanding conjecture regarding the existence of squarefree values for integer polynomials. Specifically, for a polynomial $h(x) \in \mathbb{Z}[x]$ , let $S$ be the set of positive integers $n$ such that $h(n)$ is squarefree (i.e., not divisible by the square of any prime). While it is conjectured that $S$ has positive density for any irreducible polynomial, this has only been rigorously verified for degrees 1, 2, and 3. For degrees $d \geq 4$ , the problem remains open in general, though it is known to follow from the $abc$ conjecture. The authors aim to establish the existence of a positive density of squarefree values for a specific family of polynomials of degree $2q$ , where $q$ is a prime number.

Methodology
The core of the methodology relies on the arithmetic structure of the number field $L = \mathbb{Q}(\alpha)$ , where $\alpha$ is a root of the irreducible monic polynomial $h(x)$ of degree $2q$ . The authors assume that $L$ contains a Galois subextension $K/\mathbb{Q}$ of degree $q$ . This structural assumption implies that the relative degree $[L:K] = 2$ .

The proof proceeds through the following logical steps:

Relative Norm Reduction: The authors utilize the relative norm map $N_{L/K}$ to express $h(n)$ as the norm of a quadratic polynomial over $K$ . Specifically, if $\beta$ is the Galois conjugate of $\alpha$ over $K$ , then $N_{L/K}(n - \alpha) = (n-\alpha)(n-\beta) = m(n)$ , where $m(x) = x^2 - sx + t \in \mathcal{O}_K[x]$ . Consequently, $h(n) = N_{K/\mathbb{Q}}(m(n))$ .
Sieve on Prime Ideals: An elementary sieve is applied to the prime ideals dividing the ideal $(m(n))$ in the ring of integers $\mathcal{O}_K$ .
Transfer to Rational Primes: The authors establish two critical properties to ensure that squarefreeness in the ideal factorization of $(m(n))$ $(m (n))$ translates to squarefreeness of the integer $h(n)$ $h (n)$ :
- Residue Degree: They prove that any prime ideal $\mathfrak{p}$ dividing $(m(n))$ (excluding those dividing the discriminant) must have residue degree $f_{\mathfrak{p}/p} = 1$ over $\mathbb{Q}$ (Proposition 2.1).
- Non-Conjugacy: They prove that no two distinct Galois conjugates of a prime ideal can simultaneously divide $(m(n))$ (Proposition 2.2).
Density Argument: By combining these properties with a sieve argument over the prime ideals of $\mathcal{O}_K$ , the authors demonstrate that a positive proportion of integers $n$ yield values where $(m(n))$ is squarefree away from a finite set of bad primes, and that this property lifts to $h(n)$ being squarefree.

Key Contributions and Results

Theorem 1.1: The main result states that if $h(x)$ is an irreducible monic polynomial of degree $2q$ (with $q$ prime) defining a field $L$ that contains a Galois subfield $K$ of degree $q$ , and if $\gcd\{h(n) : n \in \mathbb{Z}\}$ is squarefree, then there is a positive density of integers $n$ such that $h(n)$ is squarefree.
Corollary 2.4: As a direct application, the paper proves that irreducible quartic monic integer polynomials (degree 4) whose Galois group is neither $S_4$ nor $A_4$ take infinitely many squarefree values. This result applies to the specific subfamily of quartic polynomials satisfying the theorem's structural hypothesis (containing a quadratic subfield), rather than resolving the general degree 4 case for all such Galois groups.
Application to Unit Shapes: The authors apply Theorem 1.1 to the study of "exceptional cubic fields," defined by the polynomials $f_t(x) = x^3 + (t-1)x^2 - tx - 1$ $f_{t} (x) = x^{3} + (t - 1) x^{2} - t x - 1$ .
- They verify Ennola's Conjecture 3.1 for a positive proportion of these fields, confirming that $\{\alpha_t, \alpha_t - 1\}$ forms a fundamental system of units for the maximal order.
- Using this fundamental system, they analyze the "unit shape" (the equivalence class of the unit lattice under scaling, rotation, and reflection).
- Theorem 3.4: They prove that the unit shapes of this infinite subfamily of non-Galois totally real cubic fields converge to the hexagonal lattice.

Significance
The paper claims to provide the first example of a family of non-Galois totally real cubic fields whose unit shapes converge to the hexagonal lattice. Prior to this work, the hexagonal shape was known for totally real Galois cubic fields, but the behavior for non-Galois fields remained largely unexplored.

The significance of the work lies in bridging the gap between the difficult problem of proving squarefreeness for high-degree polynomials and the geometric properties of number fields. By leveraging the specific Galois structure of degree $2q$ extensions, the authors bypass the need for the $abc$ conjecture to prove the squarefree density result. This technical advance allows for the verification of Ennola's conjecture on a positive density of fields, which in turn enables the precise determination of the asymptotic geometry of their unit lattices. The authors note that establishing maximality of orders in such families typically requires difficult squarefree sieves, which their main theorem successfully provides.

The Squarefree Hunt: A Tale of Polynomials and Lattices

Technical Summary: On the Squarefree Values of Degree-2q Polynomials

More like this