Nancy-Metz number theory seminar

La suite d’Oldenburger-Kolakoski est l’unique mot infini sur l’alphabet {1,2} qui commence par un “1” et est point fixe de l’opérateur de dérivation. En 1991, M.S. Keane conjecture que cette suite admet une fréquence d’1/2 pour la lettre “1”.

Les suites dites “auto-descriptives” sont une généralisation du mot d’Oldenburger-Kolakoski. Ces suites sont en bijection naturelle avec l’ensemble de toutes les suites sur l’alphabet {1,2} : une suite auto-descriptive est dite “dirigée” par son homologue naturelle sur {1,2}. Est-il possible d’inférer les fréquences de lettres de l’une à partir de l’autre ?

Je présenterai dans cet exposé deux approches à cette question : l’une probabiliste (Boisson, Jamet, Marcovici — 2024), l’autre analytique (Akiyama, Jamet, Marcovici, T.C. — 2024).

Many arguments in mathematics rely on the introduction of an auxiliary function that is compactly supported. Sometimes this compactly supported function is required to satisfy some additional regularity, but this cannot be pushed too far. It can for instance not be analytic as follows by the identity principle.

In this talk, we wish to present a technique that may bypass this obstruction. Namely, instead of considering a single function, we shall construct a sequence of function that are supported in the same compact, and satisfy some good uniform bounds on their derivatives.

This method is a powerful tool as it can, in some circumstances, turn a heuristic argument relying on a compactly supported analytic auxiliary function, into a rigorous proof. As an application, we shall discuss how this technique leads to improvements in some quantified Tauberian theorems.

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

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

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

Résumé