Sign patterns of the Liouville and Möbius functions
Abstract: Let $\lambda$ and $\mu$ denote the Liouville and M\"obius functions respectively. Hildebrand showed that all eight possible sign patterns for $(\lambda(n), \lambda(n+1), \lambda(n+2))$ occur infinitely often. By using the recent result of the first two authors on mean values of multiplicative functions in short intervals, we strengthen Hildebrand's result by proving that each of these eight sign patterns occur with positive lower natural density. We also obtain an analogous result for the nine possible sign patterns for $(\mu(n), \mu(n+1))$. A new feature in the latter argument is the need to demonstrate that a certain random graph is almost surely connected.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.