Paperlane

no. 15 · Monday 16 November 2026

The Möbius function of factorizations with a simple prime factor

Madjid Mirzavaziri and Daniel Yaqubi

math.CO · 5 pp

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$.

comments
5 pages
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2611.18194 ↗