The enumeration of finite rings
Simon R. Blackburn, K. Robin McLean

TL;DR
This paper precisely counts the number of finite rings and finite commutative rings of order p^n, providing exact formulas with error bounds, correcting earlier incomplete proofs from past decades.
Contribution
It establishes exact asymptotic formulas for the number of finite rings and commutative rings of order p^n, correcting previous flawed proofs and refining earlier estimates.
Findings
Number of finite rings of order p^n is p^{(4/27)n^3 + O(n^{5/2})}
Number of finite commutative rings of order p^n is p^{(2/27)n^3 + O(n^{5/2})}
Provides rigorous proof and correction of earlier conjectures and partial results.
Abstract
Let be a fixed prime. We show that the number of isomorphism classes of finite rings of order is , where . This result was stated (with a weaker error term) by Kruse and Price in 1969; a problem with their proof was pointed out by Knopfmacher in 1973. We also show that the number of isomorphism classes of finite commutative rings of order is , where . This result was stated (again with a weaker error term) by Poonen in 2008, with a proof that relies on the problematic step in Kruse and Price's argument.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · semigroups and automata theory
