Value patterns of multiplicative functions and related sequences

Abstract

We study the existence of various sign and value patterns in sequences defined by multiplicative functions or related objects. For any set A whose indicator function is 'approximately multiplicative' and uniformly distributed on short intervals in a suitable sense, we show that the asymptotic density of the pattern n+1∈ A, n+2∈ A, n+3∈ A is positive, as long as A has density greater than 13. Using an inverse theorem for sumsets and some tools from ergodic theory, we also provide a theorem that deals with the critical case of A having density exactly 13, below which one would need nontrivial information on the local distribution of A in Bohr sets to proceed. We apply our results firstly to answer in a stronger form a question of Erdos and Pomerance on the relative orderings of the largest prime factors P+(n), P+(n+1), P+(n+2) of three consecutive integers. Secondly, we show that the tuple (ω(n+1),ω(n+2),ω(n+3)) 3 takes all the 27 possible patterns in (Z/3Z)3 with positive lower density, with ω(n) being the number of distinct prime divisors. We also prove a theorem concerning longer patterns n+i∈ Ai, i=1,… k in approximately multiplicative sets Ai having large enough densities, generalising some results of Hildebrand on his 'stable sets conjecture'. Lastly, we consider the sign patterns of the Liouville function λ and show that there are at least 24 patterns of length 5 that occur with positive upper density. In all of the proofs we make extensive use of recent ideas concerning correlations of multiplicative functions.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…