arXiv subjects

Maxie Dion Schmidt

Publications and source records attributed to Maxie Dion Schmidt.

5 recordsLinked to original sources

arXiv2026

Picking up the partial sums of the Möbius function problem with probabilistic number theory

We revisit several hybrid multiplicative-to-additive type functions from a recent preprint article. These functions, $g(n)$ with Dirichlet generating function (DGF) $ζ(s)^{-1} (1+P(s))^{-1}$ for $\Re(s) > 1$ where $P(s) = \sum_p p^{-s}$ is the prime zeta function, $|g(n)| = λ(n) g(n)$ with DGF $ζ(2s)^{-1}(1-P(s))^{-1}$, and $C_Ω(n)$ with DGF $(1-P(s))^{-1}$. Each of these function variants are defined in terms of the additive (respectively, strongly additive) functions $ω(n)$ and $Ω(n)$. These two auxiliary functions are used in the prior manuscript to relate partial sums of the classical Möbius function, $μ(n)$, to signed partial sums involving the prime counting function, $π(x)$, and the Liouville lambda function, $λ(n) := (-1)^{Ω(n)}$. In this article, we explore summing the identities from the first manuscript using several probabilistic assumptions about the independence of the values of $Ω(n)$ and $μ^2(n)$ for $n \leq x$ at large $x$. We recover proofs of the limiting asymptotic growth of $|M(x)| / \sqrt{x}$ whose hypotheses promise to be substantially more attainable to make rigorous than past results from other authors relying on the Riemann Hypothesis or assumption of the linear independence of the simple, non-trivial zeros of $ζ(s)$.

math.NT↗

arXiv2026

A catalog of interesting and useful Lambert series identities

A Lambert series generating function is a special series summed over an arithmetic function $f$ defined by \[ L_f(q) := \sum_{n \geq 1} \frac{f(n) q^n}{1-q^n} = \sum_{m \geq 1} (f \ast 1)(m) q^m. \] Because of the way the left-hand-side terms of this type of generating function generate divisor sums of $f$ convolved by Dirichlet convolution with one, these expansions are natural ways to enumerate the ordinary generating functions of many multiplicative special functions in number theory. We present an overview of key properties of Lambert series generating function expansions, their more combinatorial generalizations, and include a compendia of tables illustrating known formulas for special cases of these series. In this sense, we focus more on the formal properties of the sequences that are enumerated by the Lambert series, and do not spend significant time treating these series as analytic objects subject to rigorous convergence constraints. The first question one might ask before reading this document is: Why has is catalog of interesting Lambert series identities compiled? As with the indispensible reference by H. W. Gould and T. Shonhiwa, A catalog of interesting Dirichlet series, for Dirichlet series (DGF) identities, there are many situations in which one needs a summary reference on Lambert series and their properties. New work has been done recently tying Lambert series expansions to partition functions by expansions of their generating functions. In addition to these new expansions and providing an introduction to Lambert series, we have listings of classically relevant and "odds and ends'' examples for Lambert series summations that are occasionally useful in applications. If you see any topics or identities the author has missed, please contact us over email to append to this reference.

math.NT↗

arXiv2026

Magic partition functions: Sign smoothing convolutions with Dirichlet invertible arithmetic functions

Sign changes in sums of arithmetic functions and their inverses are a subtle topic with room to grow new results. Suppose that $S_f(x) := \sum_{n \leq x} f(n)$ is the summatory function of some arithmetic function $f$ such that $f(1) \neq 1$. There are known lower bounds on the limiting growth of $V(S_f, Y)$ -- the number of sign changes of $S_f(y)$ on the interval $y \in (0, Y]$ as $Y \rightarrow \infty$. We observe a partition theoretic sign smoothing by discrete convolution of the local oscillatory properties of the Dirichlet inverse of $f$, $S_{f^{-1}}(x)$. These so-called invertible ``magic partition function`` encodings lead to a sequence of convolution sums which have predictable sign properties provided the sequence of $f(n)$ ($f^{-1}(n)$, respectively) has reasonable asymptotic upper bounds with respect to $n$.

math.NT↗

arXiv2022

Factorization theorems and canonical representations for generating functions of special sums

This manuscript explores many convolution (restricted summation) type sequences via certain types of matrix based factorizations that can be used to express their generating functions. The last primary (non-appendix) section of the thesis explores the topic of how to best rigorously define a so-termed ``\emph{canonically best}'' matrix based factorization for a given class of convolution sum sequences. The notion of a canonical factorization for the generating function of such sequences needs to match the qualitative properties we find in the factorization theorems for Lambert series generating functions (LGFs). The expected qualitatively most expressive expansion we find in the LGF case results naturally from algebraic constructions of the underlying LGF series type. We propose a precise quantitative requirement to generalize this notion in terms of optimal cross-correlation statistics for certain sequences that define the matrix based factorizations of the generating function expansions we study. We finally pose a few conjectures on the types of matrix factorizations we expect to find when we are able to attain the maximal (respectively minimal) correlation statistic for a given sum type.

math.NT↗

arXiv2022

Exact formulas for partial sums of the Möbius function expressed by partial sums weighted by the Liouville lambda function

The Mertens function, $M(x) := \sum_{n \leq x} μ(n)$, is defined as the summatory function of the classical Möbius function. The Dirichlet inverse function $g(n) := (ω+1)^{-1}(n)$ is defined in terms of the shifted strongly additive function $ω(n)$ that counts the number of distinct prime factors of $n$ without multiplicity. The Dirichlet generating function (DGF) of $g(n)$ is $ζ(s)^{-1} (1+P(s))^{-1}$ for $\Re(s) > 1$ where $P(s) = \sum_p p^{-s}$ is the prime zeta function. We study the distribution of the unsigned functions $|g(n)|$ with DGF $ζ(2s)^{-1}(1-P(s))^{-1}$ and $C_Ω(n)$ with DGF $(1-P(s))^{-1}$ for $\Re(s) > 1$. We establish formulas for the average order and variance of $\log C_Ω(n)$ and prove a central limit theorem for the distribution of its values on the integers $n \leq x$ as $x \rightarrow \infty$. Discrete convolutions of the partial sums of $g(n)$ with the prime counting function provide new exact formulas for $M(x)$.

math.NT↗