arXiv · 2611.18194
The Möbius function of factorizations with a simple prime factor
Abstract
The poset of factorizations of a positive integer $n$ (ordered by refinement) is known to have a very irregular Möbius function. We prove that this function becomes completely explicit whenever $n$ is divisible by a prime $q$ to the first power only ($q^2 \nmid n$). Specifically, between a factorization with $k$ factors and $n$ itself, the Möbius function is given by $(-1)^{k-1}$ multiplied by the number of ways to order the factors that are not divisible by $q$. As a consequence, the sum of the absolute values of the Möbius function over this interval equals twice the number of ordered factorizations of $n/q$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Madjid Mirzavaziri, Daniel Yaqubi. 2026-11-13. The Möbius function of factorizations with a simple prime factor. https://searcharxiv.com/abs/2611.18194
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.