Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the number of subrings of $\mathbb{Z}^n$ of prime power index

Published 29 Nov 2022 in math.NT, math.CO, and math.RA | (2211.16595v1)

Abstract: Let $n$ and $k$ be positive integers, and $f_n(k)$ (resp. $g_n(k)$) be the number of unital subrings (resp. unital irreducible subrings) of $\mathbb{Z}n$ of index $k$. The numbers $f_n(k)$ are coefficients of certain zeta functions of natural interest. The function $k\mapsto f_n(k)$ is multiplicative, and the study of the numbers $f_n(k)$ reduces to computing the values at prime powers $k=pe$. Given a composition $\alpha=(\alpha_1, \dots, \alpha_{n-1})$ of $e$ into $n-1$ positive integers, let $g_\alpha(p)$ denote the number of irreducible subrings of $\mathbb{Z}n$ for which the associated upper triangular matrix in Hermite normal form has diagonal $(p{\alpha_1}, \dots, p{\alpha_{n-1}},1)$. Via combinatorial analysis, the computation of $f_n(pe)$ reduces to the computation of $g_\alpha(p)$ for all compositions of $i$ into $j$ parts, where $i\leq e$ and $j\leq n-1$. We extend results of Liu and Atanasov-Kaplan-Krakoff-Menzel, who explicitly compute $f_n(pe)$ for $e\leq 8$. The case $e=9$ proves to be significantly more involved. We evaluate $f_n(e9)$ explicitly in terms of a polynomial in n and p up to a single term which is conjecturally a polynomial. Our results provide further evidence for a conjecture, which states that for any fixed pair $(n,e)$, the function $p\mapsto f_n(pe)$ is a polynomial in $p$. A conjecture of Bhargava on the asymptotics for $f_n(k)$ as a function of $k$ motivates the study of the asymptotics for $g_\alpha(p)$ for certain infinite families of compositions $\alpha$, for which we are able to obtain general estimates using techniques from the geometry of numbers.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.