2000 character limit reached
The distribution of the number of subgroups of the multiplicative group
Published 30 Sep 2017 in math.NT | (1710.00124v1)
Abstract: Let $I(n)$ denote the number of isomorphism classes of subgroups of $(\Bbb Z/n\Bbb Z)\times$, and let $G(n)$ denote the number of subgroups of $(\Bbb Z/n\Bbb Z)\times$ counted as sets (not up to isomorphism). We prove that both $\log G(n)$ and $\log I(n)$ satisfy Erd\"os-Kac laws, in that suitable normalizations of them are normally distributed in the limit. Of note is that $\log G(n)$ is not an additive function but is closely related to the sum of squares of additive functions. We also establish the orders of magnitude of the maximal orders of $\log G(n)$ and $\log I(n)$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.