Search arXivSearch

arXiv · 1704.06636

Partition-theoretic formulas for arithmetic densities

Abstract

If $\gcd(r,t)=1$, then a theorem of Alladi offers the Möbius sum identity $$-\sum_{\substack{ n \geq 2 \\ p_{\rm{min}}(n) \equiv r \pmod{t}}} μ(n)n^{-1}= \frac{1}{φ(t)}. $$ Here $p_{\rm{min}}(n)$ is the smallest prime divisor of $n$. The right-hand side represents the proportion of primes in a fixed arithmetic progression modulo $t$. 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 $q$-series and integer partitions. For suitable subsets $§$ of the positive integers with density $d_§$, we prove that \[- \lim_{q \to 1} \sum_{\substack{ λ\in \mathcal{P} \\ \rm{sm}(λ) \in §}} μ_{\mathcal{P}} (λ)q^{\vert λ\vert} = d_§,\] where the sum is taken over integer partitions $λ$, $μ_{\mathcal{P}}(λ)$ is a partition-theoretic Möbius function, $\vert λ\vert$ is the size of partition $λ$, and $\rm{sm}(λ)$ is the smallest part of $λ$. In particular, we obtain partition-theoretic formulas for even powers of $π$ when considering power-free integers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ken Ono, Robert Schneider, Ian Wagner. 2017-05-09. Partition-theoretic formulas for arithmetic densities. https://arxiv.org/abs/1704.06636

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO