Higher order Fourier analysis of multiplicative functions and applications

  title={Higher order Fourier analysis of multiplicative functions and applications},
  author={Nikos Frantzikinakis and Bernard Host},
  journal={arXiv: Number Theory},
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 another that has small Gowers uniformity norm of an arbitrary degree. The proof uses tools from higher order Fourier analysis and some soft number theoretic input that comes in the form of an orthogonality criterion of K\'atai. We use variants of this structure theorem to derive applications of number… 
A structure theorem for level sets of multiplicative functions and applications
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
A structure theorem for multiplicative functions over the Gaussian integers and applications
It is proved that for any finite coloring of the Gaussian integers, there exist distinct nonzero elements x and y of the same color such that x2−y2 = n2 for some Gaussian integer n.
Multiple ergodic theorems for arithmetic sets
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
A generalization of Kátai's orthogonality criterion with applications
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
Rigidity theorems for multiplicative functions
We establish several results concerning the expected general phenomenon that, given a multiplicative function $$f:\mathbb {N}\rightarrow \mathbb {C}$$f:N→C, the values of f(n) and $$f(n+a)$$f(n+a)
Weighted multiple ergodic averages and correlation sequences
We study mean convergence results for weighted multiple ergodic averages defined by commuting transformations with iterates given by integer polynomials in several variables. Roughly speaking, we
Dynamical generalizations of the Prime Number Theorem and disjointness of additive and multiplicative semigroup actions
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
Almost full entropy subshifts uncorrelated to the M\"obius function
We show that if $y=(y_n)_{n\ge 1}$ is a bounded sequence with zero average along every infinite arithmetic progression then for every $N\ge 2$ there exist (unilateral or bilateral) subshifts $\Sigma$
An averaged Chowla and Elliott conjecture along independent polynomials
We generalize a result of Matomaki, Radziwill, and Tao, by proving an averaged version of a conjecture of Chowla and a conjecture of Elliott regarding correlations of the Liouville function, or more
The structure of correlations of multiplicative functions at almost all scales, with applications to the Chowla and Elliott conjectures
We study the asymptotic behaviour of higher order correlations $$ \mathbb{E}_{n \leq X/d} g_1(n+ah_1) \cdots g_k(n+ah_k)$$ as a function of the parameters $a$ and $d$, where $g_1,\dots,g_k$ are


A structure theorem for multiplicative functions over the Gaussian integers and applications
It is proved that for any finite coloring of the Gaussian integers, there exist distinct nonzero elements x and y of the same color such that x2−y2 = n2 for some Gaussian integer n.
A Quantitative Ergodic Theory Proof of Szemerédi's Theorem
  • T. Tao
  • Mathematics
    Electron. J. Comb.
  • 2006
A quantitative, self-contained version of this ergodic theory proof is presented, which is ``elementary'' in the sense that it does not require the axiom of choice, the use of infinite sets or measures, or theUse of the Fourier transform or inverse theorems from additive combinatorics.
Root numbers and the parity problem
Let E be a one-parameter family of elliptic curves over a number field. It is natural to expect the average root number of the curves in the family to be zero. All known counterexamples to this folk
On higher order Fourier analysis
We develop a theory of higher order structures in compact abelian groups. In the frame of this theory we prove general inverse theorems and regularity lemmas for Gowers's uniformity norms. We put
A sharp inequality of Halász type for the mean value of a multiplicative arithmetic function
Let g ( n ) be a complex valued multiplicative function such that | g ( n )| ≤ 1. In this paper we shall be concerned with the validity of the inequality under the weak condition g ( p )∈ for all
Decompositions, approximate structure, transference, and the Hahn–Banach theorem
We discuss three major classes of theorems in additive and extremal combinatorics: decomposition theorems, approximate structure theorems, and transference principles. We also show how the
Linear equations in primes
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
Uniformity seminorms on ℓ∞ and applications
A key tool in recent advances in understanding arithmetic progressions and other patterns in subsets of the integers is certain norms or seminorms. One example is the norms on ℤ/Nℤ introduced by
An Arithmetic Regularity Lemma, An Associated Counting Lemma, and Applications
To Endre Szemeredi on the occasion of his 70th birthday Szemeredi’s regularity lemma can be viewed as a rough structure theorem for arbitrary dense graphs, decomposing such graphs into a structured
On solution‐free sets for simultaneous quadratic and linear equations
We consider a translation and dilation invariant system consisting of a diagonal quadratic equation and a linear equation with integer coefficients in s variables, where s ⩾ 9. We show via the