2000 character limit reached
A subset generalization of the Erdős-Kac theorem over number fields with applications
Published 3 Jun 2025 in math.NT | (2506.03215v1)
Abstract: Let $\omega(n)$ denote the number of distinct prime factors of a natural number $n$. In 1940, Erd\H{o}s and Kac established that $\omega(n)$ obeys the Gaussian distribution over natural numbers. In 2004, the third author generalized their theorem to all abelian monoids. In this work, we extend the work of the third author to any subset of the set of ideals of a number field satisfying some additional conditions. Finally, we apply this theorem to prove the Erd\H{o}s-Kac theorem over $h$-free and over $h$-full ideals of the number field.
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.