A structure theorem for level sets of multiplicative functions and applications

@article{Bergelson2017AST,
title={A structure theorem for level sets of multiplicative functions and applications},
author={Vitaly Bergelson and Joanna Kułaga-Przymus and Mariusz Lema'nczyk and Florian Karl Richter},
journal={arXiv: Number Theory},
year={2017}
}
• Published 8 August 2017
• Mathematics
• arXiv: Number Theory
Given a level set $E$ of an arbitrary multiplicative function $f$, we establish, by building on the fundamental work of Frantzikinakis and Host [13,14], a structure theorem which gives a decomposition of $\mathbb{1}_E$ into an almost periodic and a pseudo-random parts. Using this structure theorem together with the technique developed by the authors in [3], we obtain the following result pertaining to polynomial multiple recurrence. Let $E=\{n_1<n_2<\ldots\}$ be a level set of an arbitrary…
3 Citations
A generalization of Kátai's orthogonality criterion with applications
• Mathematics
Discrete & Continuous Dynamical Systems - A
• 2019
We study properties of arithmetic sets coming from multiplicative number theory and obtain applications in the theory of uniform distribution and ergodic theory. Our main theorem is a generalization
Automatic sequences are orthogonal to aperiodic multiplicative functions
• Mathematics
2019-20 MATRIX Annals
• 2021
Given a finite alphabet $\mathbb{A}$ and a primitive substitution $\theta:\mathbb{A}\to\mathbb{A}^\lambda$ (of constant length $\lambda$), let $(X_\theta,S)$ denote the corresponding dynamical
Dynamical generalizations of the Prime Number Theorem and disjointness of additive and multiplicative semigroup actions
• Mathematics
• 2020
We establish two ergodic theorems which have among their corollaries numerous classical results from multiplicative number theory, including the Prime Number Theorem, a theorem of Pillai-Selberg, a

References

SHOWING 1-10 OF 38 REFERENCES
Higher order Fourier analysis of multiplicative functions and applications
• Mathematics
• 2014
We prove a structure theorem for multiplicative functions which states that an arbitrary bounded multiplicative function can be decomposed into two terms, one that is approximately periodic and
Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics
• Mathematics
Ergodic Theory and Dynamical Systems
• 2019
A set $R\subset \mathbb{N}$ is called rational if it is well approximable by finite unions of arithmetic progressions, meaning that for every $\unicode[STIX]{x1D716}>0$ there exists a set $B=\bigcup An inverse theorem for the Gowers U^{s+1}[N]-norm (announcement) • Mathematics • 2010 In this note we announce the proof of the inverse conjecture for the Gowers U^{s+1}[N]-norm for all s => 3; this is new for s => 4, the cases s = 1,2,3 having been previously established. More AN INVERSE THEOREM FOR THE GOWERS U4-NORM • Mathematics Glasgow Mathematical Journal • 2010 Abstract We prove the so-called inverse conjecture for the Gowers Us+1-norm in the case s = 3 (the cases s < 3 being established in previous literature). That is, we show that if f : [N] → ℂ is a Polynomial extensions of van der Waerden’s and Szemerédi’s theorems • Mathematics • 1996 An extension of the classical van der Waerden and Szemeredi the- orems is proved for commuting operators whose exponents are polynomials. As a consequence, for example, one obtains the following The polynomial multidimensional Szemerédi Theorem along shifted primes • Mathematics • 2010 AbstractIf$\vec q_1 ,...,\vec q_m $: ℤ → ℤℓ are polynomials with zero constant terms and E ⊂ ℤℓ has positive upper Banach density, then we show that the set E ∩ (E −$\vec q_1 \$ (p − 1)) ∩ … ∩ (E
An inverse theorem for the Gowers U^{s+1}[N]-norm
• Mathematics
• 2010
We prove the inverse conjecture for the Gowers U^{s+1}[N]-norm for all s >= 3; this is new for s > 3, and the cases s [-1,1] is a function with || f ||_{U^{s+1}[N]} > \delta then there is a
Linear equations in primes
• Mathematics
• 2006
Consider a system ψ of nonconstant affine-linear forms ψ 1 , ... , ψ t : ℤ d → ℤ, no two of which are linearly dependent. Let N be a large integer, and let K ⊆ [-N, N] d be convex. A generalisation
The Mobius function is strongly orthogonal to nilsequences
• Mathematics
• 2008
We show that the Mobius function (n) is strongly asymptotically or- thogonal to any polynomial nilsequence (F (g(n))) n2N. Here, G is a sim- ply-connected nilpotent Lie group with a discrete and
Multiple ergodic theorems for arithmetic sets
• Mathematics
• 2015
We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For