Séminaire de Théorie des Nombres de Nancy-Metz

Let $p$ be a prime number. For each positive integer $k\geq 2$, it is widely believed that the smallest prime that is a $k$th power residue modulo $p$ should be $O(p^{\epsilon})$, for any $\epsilon>0$. Elliott proved that such a prime is at most $p^{\frac{k-1}{4}+\epsilon}$, for each $\epsilon>0$. In this talk we discuss the distribution of prime $k$th power residues modulo $p$ in the range $[1, p]$, with a more emphasis on the subrange $[1,p^{\frac{k-1}{4}+\epsilon}]$ for $\epsilon>0$.

Un théorème classique de Macaulay en Algèbre commutative (1927) caractérise les fonctions de Hilbert des algèbres graduées standard. Ce théorème a des conséquences remarquables en Combinatoire additive, comme cela n’a été observé que tout récemment. L’objet de l’exposé est de montrer deux telles applications, sur la conjecture de Wilf portant sur les semigroupes numériques, et sur la croissance des ensembles sommes itérés dans un groupe abélien.

I will survey what is known about the distribution of the orders of integers mod $p$, as $p$ varies. Particular attention will be paid to problems of the following sort: For fixed $a$ and $b$, how do the order of $a$ mod $p$ and the order of $b$ mod $p$ compare, as $p$ varies? The proofs will draw from the elementary, algebraic, and analytic strands of number theory. (So hopefully something for everyone!)

We first describe an efficient algorithm to compute
$L’/L(1,\chi)$, where $\chi$ is a non-principal Dirichlet character
mod q, and q is an odd prime. We then discuss
some results on the distribution of
$m_q := \min_{\chi\ne \chi_0} \vert L’/L(1,\chi) \vert $
and about the Euler-Kronecker constants for cyclotomic fields.

A classic paper of Salem and Zygmund investigates the distribution of trigonometric polynomials whose coefficients are chosen randomly (say +1 or -1 with equal probability) and independently. Salem and Zygmund characterized the typical distribution of such polynomials (gaussian) and the typical magnitude of their sup-norms (a degree N polynomial typically has sup-norm of size $\sqrt{N \log N}$ for large N). In this talk we will explore what happens when a weak dependence is introduced between coefficients of the polynomials; namely we consider polynomials with coefficients given by random multiplicative functions. We consider analogues of Salem and Zygmund’s results, exploring similarities and some differences.

Special attention will be given to a beautiful point-counting argument introduced by Vaughan and Wooley which ends up being useful.

This is joint work with Jacques Benatar and Alon Nishry.

Résumé

https://dev-iecl.univ-lorraine.fr/Les-Seminaires/Theorie-Des-Nombres/wolfcms/seminaire.html