Searcharxiv⌕ Search

arXiv subjects

Sourabhashis Das

Publications and source records attributed to Sourabhashis Das.

10 recordsLinked to original sources
arXiv2025

On the distribution of the total number of generators of $h$-free and $h$-full elements in an abelian monoid

Let $\mathfrak{m}$ be an element of an abelian monoid, with $\Omega(\mathfrak{m})$ denoting the total number of prime elements generating $\mathfrak{m}$. We study the moments of $\Omega(\mathfrak{m})$ over subsets of $h$-free and $h$-full elements, establishing the normal order of $\Omega(\mathfrak{m})$ within these subsets. This work continues the study on the distribution of generalized arithmetic functions over $h$-free and $h$-full elements in abelian monoids as introduced in the authors' previous work.

math.NT↗
arXiv2025

An effective version of Chebotarev's density theorem

Chebotarev's density theorem asserts that the prime ideals are equidistributed among the conjugacy classes of the Galois group of any normal extension of number fields. An effective version of this theorem was first established by Lagarias and Odlyzko in 1977. In this article, we present an explicit refinement of their statement that applies to all non-rational fields, with every implicit constant expressed explicitly in terms of the field invariants. Additionally, we provide a sharper bound for extensions of sufficiently small degree. Our approach begins by proving an explicit formula for a smoothed prime ideal counting function. This relies on recent zero-free regions for Dedekind zeta functions, improved estimates on the number of low-lying zeros, and precise bounds for sums over the non-trivial zeros of the Dedekind $\zeta$-function.

math.NT↗
arXiv2025

Generalizations of Erd\H{o}s-Kac theorem with applications

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, and in 2004, the third author generalized their theorem to all abelian monoids. In this paper, we extend her theorem to any subsets of an abelian monoid satisfying some additional conditions, and apply this result to the subsets of $h$-free and $h$-full elements. We study generalizations of several arithmetic functions, such as the prime counting omega functions and the divisor function in a unified framework. Finally, we apply our results to number fields, global function fields, and geometrically irreducible projective varieties, demonstrating the broad relevance of our approach.

math.NT↗
arXiv2025

A subset generalization of the Erd\H{o}s-Kac theorem over number fields with applications

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.

math.NT↗
arXiv2025

On the distribution of the number of distinct generators of h-free and h-full elements in an abelian monoid

This work introduces the first in-depth study of h-free and h-full elements in abelian monoids, providing a unified approach for understanding their role in various mathematical structures. Let m be an element of an abelian monoid, with {\omega}(m) denoting the number of distinct prime elements generating m. We study the moments of {\omega}(m) over subsets of h-free and h-full elements, establishing the normal order of {\omega}(m) within these subsets. Our findings are then applied to number fields, global function fields, and geometrically irreducible projective varieties, demonstrating the broad relevance of this approach.

math.NT↗
arXiv2024

On limiting distributions of arithmetic functions

For a natural number n, let M(n) denote the maximum exponent of any prime power dividing n, and let m(n) denote the minimum exponent of any prime power dividing n. We study the second moments of these arithmetic functions and establish their limiting distributions. We introduce a new discrete probabilistic distribution dependent on a function f taking values in [0,1], study its first two moments, and provide examples of several arithmetic functions satisfying such distribution as their limiting behavior.

math.NT↗
arXiv2024

On the number of prime factors with a given multiplicity over h-free and h-full numbers

Let $k$ and $n$ be natural numbers. Let $\omega_k(n)$ denote the number of distinct prime factors of $n$ with multiplicity $k$ as studied by Elma and the third author. We obtain asymptotic estimates for the first and the second moments of $\omega_k(n)$ when restricted to the set of $h$-free and $h$-full numbers. We prove that $\omega_1(n)$ has normal order $\log \log n$ over $h$-free numbers, $\omega_h(n)$ has normal order $\log \log n$ over $h$-full numbers, and both of them satisfy the Erd\H{o}s-Kac Theorem. Finally, we prove that the functions $\omega_k(n)$ with $1 < k < h$ do not have normal order over $h$-free numbers and $\omega_k(n)$ with $k > h$ do not have normal order over $h$-full numbers.

math.NT↗
arXiv2024

Distribution of $\omega(n)$ over $h$-free and $h$-full numbers

Let $\omega(n)$ denote the number of distinct prime factors of a natural number $n$. In 1917, Hardy and Ramanujan proved that $\omega(n)$ has normal order $\log \log n$ over naturals. In this work, we establish the first and the second moments of $\omega(n)$ over $h$-free and $h$-full numbers using a new counting argument and prove that $\omega(n)$ has normal order $\log \log n$ over these subsets.

math.NT↗
arXiv2024

On the number of irreducible factors with a given multiplicity in function fields

Let $k \geq 1$ be a natural number and $f \in \mathbb{F}_q[t]$ be a monic polynomial. Let $\omega_k(f)$ denote the number of distinct monic irreducible factors of $f$ with multiplicity $k$. We obtain asymptotic estimates for the first and the second moments of $\omega_k(f)$ with $k \geq 1$. Moreover, we prove that the function $\omega_1(f)$ has normal order $\log (\text{deg}(f))$ and also satisfies the Erd\H{o}s-Kac Theorem. Finally, we prove that the functions $\omega_k(f)$ with $k \geq 2$ do not have normal order.

math.NT↗