Biasymptotics of the M\"obius- and Liouville-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(π). \] Building on the author's previous work on the quantities p(n,μ) and p(n,λ), where μ and λ are the M\"obius and Liouville functions of prime number theory, respectively, on assumptions about the zeros of the Riemann zeta function we establish an alternation of the terms p(n,μ) between two asymptotic behaviors as n∞. Similar results for the quantities p(n,λ) are established. However, it is also demonstrated that if the Riemann Hypothesis (RH) holds, then it is possible that the quantities p(n,λ) maintain a single asymptotic behavior as n∞. In particular, this stable asymptotic behavior occurs if, in addition to RH, it holds that all zeros of ζ(s) in the critical strip \0 < (s) < 1\ are simple and the residues of 1/ζ(s) at these zeros are not too large. To formally describe these stable and alternating behaviors, the notions of asymptotic and biasymptotic sequences are introduced using a modification of the real logarithm.

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…