Search arXivSearch

arXiv · 2412.18692

Most subrings of $\mathbb{Z}^n$ have large corank

Abstract

If $Λ\subseteq \mathbb{Z}^n$ is a sublattice of index $m$, then $\mathbb{Z}^n/Λ$ is a finite abelian group of order $m$ and rank at most $n$. Several authors have studied statistical properties of these groups as we range over all sublattices of index at most $X$. In this paper we investigate quotients by sublattices that have additional algebraic structure. While quotients $\mathbb{Z}^n/Λ$ follow the Cohen-Lenstra heuristics and are very often cyclic, we show that if $Λ$ is actually a subring, then once $n \ge 7$ these quotients are very rarely cyclic. More generally, we show that once $n$ is large enough the quotient typically has very large rank. In order to prove our main theorems, we combine inputs from analytic number theory and combinatorics. We study certain zeta functions associated to $\mathbb{Z}^n$ and also prove several results about matrices in Hermite normal form whose columns span a subring of $\mathbb{Z}^n$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gautam Chinta, Kelly Isham, Nathan Kaplan. 2024-12-24. Most subrings of $\mathbb{Z}^n$ have large corank. https://arxiv.org/abs/2412.18692

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT