Lower bounds for the number of subrings in $\mathbb{Z}^n$
Kelly Isham

TL;DR
This paper establishes new lower bounds on the number of subrings of a given index in 1^n, analyzes the divergence of their zeta functions, and applies findings to counting orders in number fields.
Contribution
It introduces improved lower bounds for subring counts in 1^n and explores their implications for zeta functions and number field orders.
Findings
Improved lower bounds for f_n(p^e) when e e n-1
Analysis of divergence of subring zeta functions
Application to counting orders in number fields
Abstract
Let be the number of subrings of index in . We show that results of Brakenhoff imply a lower bound for the asymptotic growth of subrings in , improving upon lower bounds given by Kaplan, Marcinek, and Takloo-Bighash. Further, we prove two new lower bounds for when . Using these bounds, we study the divergence of the subring zeta function of and its local factors. Lastly, we apply these results to the problem of counting orders in a number field.
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
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory · Graph theory and applications
