Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Preprint . 2026
License: CC BY
Data sources: ZENODO
ZENODO
Preprint . 2026
License: CC BY
Data sources: Datacite
ZENODO
Preprint . 2026
License: CC BY
Data sources: Datacite
versions View all 2 versions
addClaim

The Resolution Hunt: Cyclotomic Smoothness, σ-Closure, and Structural Obstructions to Odd Perfect Numbers

Authors: Jeremy Rodgers;

The Resolution Hunt: Cyclotomic Smoothness, σ-Closure, and Structural Obstructions to Odd Perfect Numbers

Abstract

This paper continues a structural investigation into the odd perfect number problem, building on a valuation-conservation and σ-graph framework developed previously. We show that all known approaches based on valuation volume, congruence constraints, and local order arguments are subject to a fundamental limitation: the system can evade contradiction by concentrating exponent mass into smooth, low-complexity exponents, creating an “inbreeding” or recycling loophole. We prove that valuation volume at the maximal prime is strictly capped, ruling out brute-force accumulation arguments. We then formalize the σ-closure condition as a system of S-unit constraints on cyclotomic values and show that congruence-debt and lcm-based arguments are insensitive to multiplicity, explaining why recycling remains possible. The core contribution is a complete structural map of the obstruction landscape. We demonstrate that any proof of nonexistence must rely on quantitative smoothness scarcity for cyclotomic values, and we isolate a precise missing lemma, Exponent Prime-Factor Explosion (EPF), which would force the appearance of a large prime divisor in an exponent. Assuming the abc conjecture, EPF yields an immediate contradiction via known lower bounds for prime factors of exponential expressions. This work reframes the odd perfect number problem as a Diophantine scarcity problem rather than a valuation or combinatorial one, reducing nonexistence to a sharply defined question about smoothness of cyclotomic values in finite prime sets. Odd Perfect Numbers — Structural Resolution Series This paper is part of a three-paper structural investigation of the odd perfect number problem: Structural Constraints, Valuation Conservation, and σ-Graph Obstructions in the Odd Perfect Number Problemhttps://doi.org/10.5281/zenodo.18446275(Introduces the valuation conservation framework and σ-graph formalism, and proves the maximal-prime multiplier obstruction.) The Resolution Hunt: Cyclotomic Smoothness, σ-Closure, and Structural Obstructions to Odd Perfect Numbershttps://doi.org/10.5281/zenodo.18451695(Exhausts all valuation, congruence, and recycling strategies, reformulating the problem in terms of cyclotomic smoothness and S-unit constraints.) The Final Bottleneck: Structural Obstructions to Odd Perfect Numbershttps://doi.org/10.5281/zenodo.18453978(Completes the structural analysis, proving that all known approaches reduce to a single quantitative Diophantine bottleneck and establishing conditional nonexistence results.)

Keywords

sigma function, odd perfect numbers, valuation theory, Diophantine equations, unsolved problems in mathematics, Zsigmondy theorem, prime factorization, smooth numbers, arithmetic structures, cyclotomic polynomials, S-unit equations, divisor functions, number theory, Subspace Theorem, abc conjecture

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Green