Mertens Sums requiring Fewer Values of the M\"{o}bius function
M. N. Huxley, N. Watt

TL;DR
This paper develops identities involving the Möbius function and Mertens sums to efficiently compute these sums for large N, using spectral analysis and matrix methods, with potential applications in number theory.
Contribution
It introduces new identities for Möbius sums that reduce computational complexity and applies spectral and matrix analysis to understand their properties.
Findings
Identifies eigenvalues and eigenvectors of the matrix A related to Möbius sums.
Provides estimates for traces of A and A^2, aiding in sum approximation.
Discusses spectral decomposition and Perron's formula for sum estimation.
Abstract
We discuss certain identities involving and , the functions of M\"{o}bius and Mertens. These identities allow calculation of , for , as a sum of terms, each a product of the form with and . We prove a more general identity in which is replaced by , where is an arbitrary totally multiplicative function, while each has its own range of summation, . We focus on the case , , , where the identity has the form , with being the matrix of elements , while . Our results in Sections 2 and 3…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Algebraic Geometry and Number Theory · Coding theory and cryptography
