F Nous contacter


0

Documents  11N37 | enregistrements trouvés : 5

O
     

-A +A

Sélection courante (0) : Tout sélectionner / Tout déselectionner

P Q

The Chowla conjecture asserts that the signs of the Liouville function are distributed randomly on the integers. Reinterpreted in the language of ergodic theory this conjecture asserts that the Liouville dynamical system is a Bernoulli system. We prove that ergodicity of the Liouville system implies the Chowla conjecture. Our argument has an ergodic flavor and combines recent results in analytic number theory, finitistic and infinitary decomposition results involving uniformity norms, and equidistribution results on nilmanifolds. The Chowla conjecture asserts that the signs of the Liouville function are distributed randomly on the integers. Reinterpreted in the language of ergodic theory this conjecture asserts that the Liouville dynamical system is a Bernoulli system. We prove that ergodicity of the Liouville system implies the Chowla conjecture. Our argument has an ergodic flavor and combines recent results in analytic number theory, finitistic and infinitary ...

11N60 ; 11B30 ; 11N37 ; 37A45

Multi angle  Large character sums
Lamzouri, Youness (Auteur de la Conférence) | CIRM (Editeur )

For a non-principal Dirichlet character $\chi$ modulo $q$, the classical Pólya-Vinogradov inequality asserts that
$M (\chi) := \underset{x}{max}$$| \sum_{n \leq x}$$\chi(n)| = O (\sqrt{q} log$ $q)$.
This was improved to $\sqrt{q} log$ $log$ $q$ by Montgomery and Vaughan, assuming the Generalized Riemann hypothesis GRH. For quadratic characters, this is known to be optimal, owing to an unconditional omega result due to Paley. In this talk, we shall present recent results on higher order character sums. In the first part, we discuss even order characters, in which case we obtain optimal omega results for $M(\chi)$, extending and refining Paley's construction. The second part, joint with Alexander Mangerel, will be devoted to the more interesting case of odd order characters, where we build on previous works of Granville and Soundararajan and of Goldmakher to provide further improvements of the Pólya-Vinogradov and Montgomery-Vaughan bounds in this case. In particular, assuming GRH, we are able to determine the order of magnitude of the maximum of $M(\chi)$, when $\chi$ has odd order $g \geq 3$ and conductor $q$, up to a power of $log_4 q$ (where $log_4$ is the fourth iterated logarithm).
For a non-principal Dirichlet character $\chi$ modulo $q$, the classical Pólya-Vinogradov inequality asserts that
$M (\chi) := \underset{x}{max}$$| \sum_{n \leq x}$$\chi(n)| = O (\sqrt{q} log$ $q)$.
This was improved to $\sqrt{q} log$ $log$ $q$ by Montgomery and Vaughan, assuming the Generalized Riemann hypothesis GRH. For quadratic characters, this is known to be optimal, owing to an unconditional omega result due to Paley. In this talk, we ...

11L40 ; 11N37 ; 11N13 ; 11M06

There have many developments on the disjointness conjecture of the Möbius (and related) function to topologically deterministic sequences. We review some of these highlighting some related arithmetical questions.

11N37 ; 37A45

Given an additive function $f$ and a multiplicative function $g$, let
$E(f,g;x)=\#\left \{ n\leq x:f(n)=g(n) \right \}$
We study the size of $E(f,g;x)$ for those functions $f$ and $g$ such that $f(n)\neq g(n)$ for at least one value of $n> 1$. In particular, when $f(n)=\omega (n)$ , the number of distinct prime factors of $n$ , we show that for any $\varepsilon >0$ , there exists a multiplicative function $g$ such that
$E(\varepsilon ,g;x)\gg \frac{x}{\left ( \log \log x\right )^{1+\varepsilon }}$,
while we prove that $E(\varepsilon ,g;x)=o(x)$ as $x\rightarrow \infty$ for every multiplicative function $g$.
Given an additive function $f$ and a multiplicative function $g$, let
$E(f,g;x)=\#\left \{ n\leq x:f(n)=g(n) \right \}$
We study the size of $E(f,g;x)$ for those functions $f$ and $g$ such that $f(n)\neq g(n)$ for at least one value of $n> 1$. In particular, when $f(n)=\omega (n)$ , the number of distinct prime factors of $n$ , we show that for any $\varepsilon >0$ , there exists a multiplicative function $g$ such that
$E(\varepsilon ...

11N37 ; 11K65 ; 11N60

This talk presents some news on bilinear decompositions of the Möbius function. In particular, we will exhibit a family of such decompositions inherited from Motohashi's proof of the Hoheisel Theorem that leads to
$\sum_{n\leq X,(n,q)=1) }^{} \mu (n)e(na/q)\ll X\sqrt{q}/\varphi (q)$
for $q \leq X^{1/5}$ and any $a$ prime to $q$.

11N37 ; 11Y35 ; 11A25

Nuage de mots clefs ici

Z