A formula of counting divisors in integers rings: a generalization of the divisor function d₀(n)
Pith reviewed 2026-05-20 07:10 UTC · model grok-4.3
The pith
A closed formula derived from character theory counts the principal ideal divisors of any ideal by counting zero-sum subsequences.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The central result is a closed formula, obtained via character theory over finite abelian groups, that counts the exact number of zero-sum subsequences of a given sequence. Under the correspondence that identifies principal ideals with zero-sum sequences in the class group, this formula supplies the precise number of principal ideal divisors of any given ideal and therefore counts the common divisors of the two generators of I = (α, β). The same count distinguishes irreducible elements in the ring of integers.
What carries the argument
The closed character-sum formula that counts zero-sum subsequences of a sequence whose length is bounded by the Davenport constant, translated via the principal-ideal-to-zero-sum-sequence correspondence.
If this is right
- The number of principal divisors of any ideal becomes computable without listing the divisors explicitly.
- The common divisors of two generators α and β of an ideal I can be counted directly from the ideal they generate.
- Irreducible elements can be recognized by verifying that their associated sequence has no proper zero-sum subsequence.
- The classical divisor function d_0(n) appears as the special case in which the class group is trivial.
Where Pith is reading between the lines
- The formula may lead to practical algorithms for counting divisors in quadratic fields whose class number is small and cyclic.
- If the correspondence between ideals and sequences can be extended, similar counting formulas might apply to rings whose class group is not cyclic.
- The irreducible-element characterization could be used to study unique factorization failure in concrete number fields.
Load-bearing premise
There is an exact correspondence between principal ideals and zero-sum sequences that holds when the class group is cyclic.
What would settle it
Pick a concrete Dedekind domain with cyclic class group of order at least two, choose a non-principal ideal, count its principal divisors by direct enumeration, and check whether the number matches the output of the character-sum formula.
read the original abstract
In this paper we establish a formal connection between the structure of ideals in integers rings and the theory of additive combinatorics. For integers rings with cyclic class groups, we prove a structural theorem demonstrating that every non-zero ideal can be decomposed into a maximal principal part and a product of ideals whose total length is bounded by the Davenport constant. With this decomposition we find divisors for generators of the ideal $I=(\alpha, \beta)$. The central result of this work is the derivation of a closed formula using character theory over finite abelian groups to count the exact number of zero-sum subsequences of a given sequence. Under the established correspondence between principal ideals and zero-sum sequences, this formula provides a precise counting of the principal ideal divisors of any given ideal, and therefore counting common divisors of generators of the ideal $I=(\alpha,\beta)$. This result constitutes a natural generalization of the classical divisor function $d_0(n)$ from unique factorization domains to any Dedekind domain with a finite class group. Finally, we characterize irreducible elements in $\mathcal{O}_K$ based on the counting of these zero-sum subsequences.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript claims to establish a connection between ideal factorization in Dedekind domains whose class group is cyclic and zero-sum subsequence counting in additive combinatorics. It asserts a structural theorem decomposing any nonzero ideal into a maximal principal part times a product of prime ideals whose classes form a sequence of length at most the Davenport constant D(G). From this decomposition it derives a closed-form character-sum formula that counts the zero-sum subsequences of the class sequence; under an asserted bijection between such subsequences and principal ideal divisors, the formula is said to generalize the classical divisor function d_0(n) to any such ring and to characterize irreducible elements.
Significance. If the asserted exact correspondence between zero-sum subsequences and principal divisors were rigorously established, the work would supply a combinatorial method for counting divisors in non-UFD Dedekind domains, potentially useful for explicit computations when the class group is small and cyclic. The character-sum formula itself is standard and correct for finite abelian groups, but the paper supplies no independent verification that the translation preserves multiplicity or is surjective onto the set of principal divisors.
major comments (2)
- [structural theorem and correspondence paragraph] The central load-bearing step is the claim that every principal ideal divisor arises from a unique zero-sum subsequence of the class sequence of the non-principal factors (after multiplying by the maximal principal part). No argument is given that distinct subsequences produce distinct ideals or that every principal divisor is captured by a subsequence whose length is bounded by D(G). This gap directly undermines the asserted equality between the subsequence count and the number of principal ideal divisors of I = (α, β).
- [derivation of the closed formula] The manuscript invokes an 'ideal-to-sequence correspondence' whose independence from the target divisor count is not demonstrated. Because the sequence is built from the prime ideal factors of I, it is unclear whether the zero-sum condition is being used to define the divisors or merely to count them; without an explicit bijection or multiplicity-free map, the counting formula cannot be guaranteed to equal the number of principal divisors.
minor comments (2)
- [title and abstract] The abstract and title contain several grammatical issues ('integers rings', 'a formula of counting') that should be corrected for readability.
- [introduction] Notation for the classical divisor function is written d_0(n); the standard symbol is d(n) or τ(n). If a non-standard subscript is intended, it should be defined explicitly.
Simulated Author's Rebuttal
We thank the referee for the careful reading and constructive comments on our manuscript. We address the major comments point by point below. We agree that the presentation of the ideal-sequence correspondence and the supporting bijection can be strengthened with additional explicit details and will revise the manuscript accordingly.
read point-by-point responses
-
Referee: [structural theorem and correspondence paragraph] The central load-bearing step is the claim that every principal ideal divisor arises from a unique zero-sum subsequence of the class sequence of the non-principal factors (after multiplying by the maximal principal part). No argument is given that distinct subsequences produce distinct ideals or that every principal divisor is captured by a subsequence whose length is bounded by D(G). This gap directly undermines the asserted equality between the subsequence count and the number of principal ideal divisors of I = (α, β).
Authors: We appreciate the referee highlighting the need for greater explicitness here. Section 3 contains the structural theorem decomposing any nonzero ideal into a maximal principal part times a product of prime ideals whose classes form a sequence of length at most D(G). Section 4 then defines the correspondence by associating to each zero-sum subsequence the ideal formed by the product of the corresponding prime ideals (which is principal precisely because the subsequence sums to zero in the class group). Injectivity follows from the uniqueness of ideal factorization in Dedekind domains; surjectivity follows from the maximality of the principal part, which ensures that any additional principal divisor must be generated by a subsequence of the remaining factors. We will revise the manuscript to include a dedicated lemma that explicitly proves distinct subsequences yield distinct ideals and confirms that the length bound D(G) captures all principal divisors. revision: yes
-
Referee: [derivation of the closed formula] The manuscript invokes an 'ideal-to-sequence correspondence' whose independence from the target divisor count is not demonstrated. Because the sequence is built from the prime ideal factors of I, it is unclear whether the zero-sum condition is being used to define the divisors or merely to count them; without an explicit bijection or multiplicity-free map, the counting formula cannot be guaranteed to equal the number of principal divisors.
Authors: The sequence is constructed directly from the prime-ideal factorization of the non-principal part of I, using only the class-group images; this construction precedes and is independent of the subsequent counting step. The character-sum formula then counts the zero-sum subsequences of this fixed sequence via the standard formula for finite abelian groups. The equality with the number of principal divisors is obtained only after the bijection (established separately via the structural theorem) is applied. We agree that the manuscript would benefit from an explicit statement separating the construction of the sequence from the counting and from a lemma verifying that the bijection is multiplicity-free. These clarifications will be added in the revision. revision: yes
Circularity Check
No significant circularity; derivation relies on standard character theory and internally proven structural decomposition.
full rationale
The paper proves a structural theorem decomposing non-zero ideals into a maximal principal part plus a bounded-length product of prime ideals (length ≤ Davenport constant of the cyclic class group). It then applies the standard character-sum formula for the number of zero-sum subsequences in a finite abelian group to the sequence of ideal classes. This count is translated to the number of principal ideal divisors via a correspondence that the paper claims to establish as part of its own framework. The character-theoretic counting formula itself is a well-known external result in additive combinatorics and does not reduce to the paper's divisor-counting target by construction or fitting. No self-citation chain, self-definition, or renaming of known results is load-bearing for the central claim. The derivation chain is therefore self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption There exists a correspondence between principal ideals and zero-sum sequences in the class group.
- domain assumption The class group of the ring is cyclic.
Reference graph
Works this paper leans on
-
[1]
T. M. Apostol.Introduction to Analytic Number Theory. Springer-Verlag, New York, 1976
work page 1976
-
[2]
K. Conrad.Ideal Factorization, expository paper.https://kconrad.math.uconn.edu/ blurbs/gradnumthy/idealfactor.pdf
- [3]
-
[4]
A. Geroldinger and F. Halter-Koch.Non-Unique Factorizations: Algebraic, Combina- torial and Analytic Theory. Chapman & Hall/CRC, Boca Raton, FL, 2006
work page 2006
-
[5]
The LMFDB Collaboration.The L-functions and Modular Forms Database.https: //www.lmfdb.org, 2026
work page 2026
-
[6]
J. E. Olson.A combinatorial problem on finite abelian groups. J. Number Theory1 (1969), 8-10
work page 1969
-
[7]
The Sage Developers.SageMath, the Sage Mathematics Software System (Version 10.2).https://www.sagemath.org, 2024. 10
work page 2024
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.