Abstract

We formulate the generalized Sarnak's Möbius disjointness conjecture for an arbitrary number field K, and prove a quantitative disjointness result between polynomial nilsequences (Φ(g(n)Γ))n∈ZD and aperiodic multiplicative functions on OK, the ring of integers of K. Here D=[K:Q], X=G/Γ is a nilmanifold, g:ZD→G is a polynomial sequence, and Φ:X→C is a Lipschitz function. This result, being a generalization of a previous theorem of the author in [44], requires a significantly different approach, which involves with multi-dimensional higher order Fourier analysis, multi-linear analysis, orbit properties on nilmanifold, and an orthogonality criterion of Kátai in OK.We also use variations of this result to derive applications in number theory and combinatorics: (1) we prove a structure theorem for multiplicative functions on K, saying that every bounded multiplicative function can be decomposed into the sum of an almost periodic function (the structural part) and a function with small Gowers uniformity norm of any degree (the uniform part); (2) we give a necessary and sufficient condition for the Gowers norms of a bounded multiplicative function in OK to be zero; (3) we provide partition regularity results over K for a large class of homogeneous equations in three variables. For example, for a,b∈Z﹨{0}, we show that for every partition of OK into finitely many cells, where K=Q(a,b,a+b), there exist distinct and non-zero x,y belonging to the same cell and z∈OK such that ax2+by2=z2.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.