← Latest papers
🔢 mathematics

Discriminants and Large Pólya Groups in Septic Number Fields

This paper investigates a new family of cyclic septic fields derived from the Hashimoto--Hoshi construction, explicitly computing their discriminants and characterizing their Pólya properties to demonstrate the existence of infinitely many non-Pólya fields with unbounded Pólya groups, infinitely many Pólya fields under Bunyakovsky's conjecture, and infinitely many non-monogenic fields with field index one.

Original authors: Nimish Kumar Mahapatra

Published 2026-02-03
📖 5 min read🧠 Deep dive

Original authors: Nimish Kumar Mahapatra

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, infinite library of mathematical worlds called "Number Fields." Each world has its own unique rules, structures, and hidden treasures. One of the most interesting treasures in these worlds is something mathematicians call a Pólya Group.

Think of a Pólya Group as a "symmetry score" for a number field.

  • If the score is zero (or trivial), the world is perfectly organized and "clean." Mathematicians call this a Pólya Field.
  • If the score is high, the world is messy, with complex, tangled structures that are hard to untangle. These are non-Pólya fields.

For a long time, mathematicians knew how to calculate this score for small, simple worlds (like quadratic or cubic fields). But for Septic Fields (worlds built on 7th-degree equations), it was like trying to navigate a dense jungle without a map. No one had found a way to predict the "symmetry score" for an infinite family of these complex 7-dimensional worlds.

The Discovery: A New Map

In this paper, Nimish Kumar Mahapatra builds a new map for a specific family of these 7-dimensional worlds, created by mathematicians Hashimoto and Hoshi.

The author discovers that the "messiness" (the size of the Pólya Group) of these worlds is controlled by a single, magical formula:
E(t) = t⁶ + 2t⁵ + 11t⁴ + t³ + 16t² + 4t + 8

Think of E(t) as a "fingerprint scanner." When you plug a number t into this formula, it spits out a result. The prime numbers that divide this result act like the ingredients in a recipe that determine how messy the number field will be.

The Three Big Findings

1. The "Fifth-Power" Rule
The paper finds that if the result of E(t) is "clean" (specifically, if it doesn't contain any prime number raised to the 5th power, like 252^5 or 353^5), we can calculate the exact size of the Pólya Group.

  • The Analogy: Imagine E(t) is a bag of marbles. If the bag contains a "super-marble" (a prime number raised to the 5th power), the rules get complicated. But if the bag is "fifth-power free," the author provides a simple formula to count the marbles.
  • The Result: Depending on whether your starting number t is even or odd, the size of the Pólya Group is determined by how many different prime numbers are in the bag of E(t).

2. The "Infinite Mess" (Unbounded Groups)
The author proves that you can find infinitely many of these worlds where the Pólya Group is arbitrarily large.

  • The Analogy: Imagine a row of houses. The author shows you can build a neighborhood where you can find 100 houses in a row, and in every single one, the "symmetry score" is higher than any number you can name. You can make the score as huge as you want, and you can do this for blocks of houses of any length (2 houses, 10 houses, 1,000 houses).
  • Why it matters: This proves that these 7-dimensional worlds can be incredibly complex and chaotic, and there is no limit to how complex they can get.

3. The "Perfectly Clean" Mystery
The paper also asks: Can we find infinitely many of these worlds that are perfectly clean (Pólya Fields)?

  • The Condition: This depends on a famous, unsolved guess in math called Bunyakovsky's Conjecture. This conjecture basically asks: "Does this formula E(t) produce prime numbers infinitely often?"
  • The Result: If that famous guess is true, then yes, there are infinitely many perfectly clean worlds in this family. However, since the guess hasn't been proven yet, the author says, "We believe there are infinitely many clean worlds, but we can't prove it yet without solving a much bigger puzzle."

A Side Note: The "Monogenic" Puzzle

The paper also touches on whether these worlds can be built from a single "master key" (a concept called being monogenic).

  • The author proves that for this specific family of 7-dimensional worlds, the answer is no. They are never built from a single key; they always require a more complex set of keys. However, the "complexity" of needing extra keys is surprisingly low (the "index" is 1), which is a bit of a silver lining.

Summary

In simple terms, this paper:

  1. Solved a mystery: It figured out exactly how to measure the complexity of a specific family of 7-dimensional number fields.
  2. Found chaos: It proved you can find these fields with complexity scores that go to infinity, and you can find them in long, consecutive rows.
  3. Found a cliff: It showed that proving there are infinitely many perfectly simple fields in this family depends on solving a major, unsolved problem in mathematics (Bunyakovsky's Conjecture).

The paper doesn't claim these findings will fix bridges or cure diseases; it's purely about understanding the deep, hidden architecture of numbers. It's like an explorer mapping a new continent and saying, "Here is the mountain range, here is the endless ocean, and here is the uncharted territory we still need to explore."

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →