The Möbius function of the poset of triangular numbers under divisibility

Abstract

This paper analyzes the Möbius ($μ(i)$) function defined on the partially ordered set of triangular numbers ($\mathcal T(i)$) under the divisibility relation. We make conjectures on the asymptotic behavior of the classical Möbius and Mertens functions based on experimental data and other proven conjectures. We first introduce the growth of partial sums of $μ_{\mathcal T}(i)$ and analyze how the growth is different from the classical Möbius function, and then analyze the relation between the partial sums of $|μ_{\mathcal T}(i)|$, and how it is similar to the asymptotic classical Möbius function. Which also happens to involve the Riemann zeta function. Then we create Hasse diagrams of the poset, this helps introduce a method to visualize the divisibility relation of triangular numbers. This also serves as a basis for the zeta and Möbius matrices. Looking specifically into the poset defined by $(\mathbb{N}, \leq_{\mathcal T})$, or triangular numbers under divisibility and applying the Möbius function to it, we can create our desired matrices. And then using Python libraries we create visualizations for further analysis and can project previously mentioned patterns. Through this, we can introduce two more novel conjectures bounding $μ_{\mathcal T}(n)$ and the sums of $\frac{μ_{\mathcal T}}{i}$. We conclude the paper with divisibility patterns in the Appendix, with proofs of the helpful and necessary propositions.