Bounds on the M\"obius-signed partition numbers

Abstract

For n ∈ N let [n] denote the set of partitions of n, i.e., the set of positive integer tuples (x1,x2,…,xk) such that x1 ≥ x2 ≥ ·s ≥ xk and x1 + x2 + ·s + xk = n. Fixing f:N\0, 1\, for π = (x1,x2,…,xk) ∈ [n] let f(π) := f(x1)f(x2)·s f(xk). In this way we define the signed partition numbers \[ p(n,f) = Σπ∈[n] f(π). \] Following work of Vaughan and Gafni on partitions into primes and prime powers, we derive asymptotic formulae for quantities p(n,μ) and p(n,λ), where μ and λ denote the M\"obius and Liouville functions from prime number theory, respectively. In addition we discuss how quantities p(n,f) generalize the classical notion of restricted partitions.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…