English

Partition-theoretic formulas for arithmetic densities

Combinatorics 2017-05-10 v2 Number Theory

Abstract

If gcd(r,t)=1\gcd(r,t)=1, then a theorem of Alladi offers the M\"obius sum identity n2pmin(n)r(modt)μ(n)n1=1φ(t).-\sum_{\substack{ n \geq 2 \\ p_{\rm{min}}(n) \equiv r \pmod{t}}} \mu(n)n^{-1}= \frac{1}{\varphi(t)}. Here pmin(n)p_{\rm{min}}(n) is the smallest prime divisor of nn. The right-hand side represents the proportion of primes in a fixed arithmetic progression modulo tt. Locus generalized this to Chebotarev densities for Galois extensions. Answering a question of Alladi, we obtain analogs of these results to arithmetic densities of subsets of positive integers using qq-series and integer partitions. For suitable subsets §\S of the positive integers with density d§d_{\S}, we prove that limq1λPsm(λ)§μP(λ)qλ=d§,- \lim_{q \to 1} \sum_{\substack{ \lambda \in \mathcal{P} \\ \rm{sm}(\lambda) \in \S}} \mu_{\mathcal{P}} (\lambda)q^{\vert \lambda \vert} = d_{\S}, where the sum is taken over integer partitions λ\lambda, μP(λ)\mu_{\mathcal{P}}(\lambda) is a partition-theoretic M\"obius function, λ\vert \lambda \vert is the size of partition λ\lambda, and sm(λ)\rm{sm}(\lambda) is the smallest part of λ\lambda. In particular, we obtain partition-theoretic formulas for even powers of π\pi when considering power-free integers.

Keywords

Cite

@article{arxiv.1704.06636,
  title  = {Partition-theoretic formulas for arithmetic densities},
  author = {Ken Ono and Robert Schneider and Ian Wagner},
  journal= {arXiv preprint arXiv:1704.06636},
  year   = {2017}
}

Comments

The second version has been accepted for publication in Proceedings of Number Theory in Honor of Krishna Alladi's 60th Birthday, Springer

R2 v1 2026-06-22T19:24:05.569Z