Hostname: page-component-7b7567c8c-m6dxt Total loading time: 0 Render date: 2026-11-18T20:04:28.745Z Has data issue: false hasContentIssue false

SIGN PATTERNS OF THE LIOUVILLE AND MÖBIUS FUNCTIONS

Published online by Cambridge University Press:  21 June 2016

KAISA MATOMÄKI
Affiliation:
Department of Mathematics and Statistics, University of Turku, 20014 Turku, Finland; ksmato@utu.fi
MAKSYM RADZIWIŁŁ
Affiliation:
Department of Mathematics, Rutgers University, Hill Center for the Mathematical Sciences, 110 Frelinghuysen Rd., Piscataway, NJ 08854-8019, USA; maksym.radziwill@gmail.com
TERENCE TAO
Affiliation:
Department of Mathematics, UCLA, 405 Hilgard Ave, Los Angeles, CA 90095, USA; tao@math.ucla.edu

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let ${\it\lambda}$ and ${\it\mu}$ denote the Liouville and Möbius functions, respectively. Hildebrand showed that all eight possible sign patterns for $({\it\lambda}(n),{\it\lambda}(n+1),{\it\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 $({\it\mu}(n),{\it\mu}(n+1))$ . A new feature in the latter argument is the need to demonstrate that a certain random graph is almost surely connected.

Information

Type
Research Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s) 2016