En poursuivant votre navigation sur ce site, vous acceptez l'utilisation d'un simple cookie d'identification. Aucune autre exploitation n'est faite de ce cookie. OK
1

(Logarithmic) densities for automatic sequences along primes and squares

Bookmarks Report an error
Virtualconference
Authors : Drmota, Michael (Author of the conference)
CIRM (Publisher )

Loading the player...

Abstract : It is well known that the every letter $\alpha$ of an automatic sequence $a(n)$ has a logarithmic density -- and it can be decided when this logarithmic density is actually adensity. For example, the letters $0$ and $1$ of the Thue-Morse sequences $t(n)$ have both frequences $1/2$. The purpose of this talk is to present a corresponding result for subsequences of general automatic sequences along primes and squares. This is a far reaching of two breakthroughresults of Mauduit and Rivat from 2009 and 2010, where they solved two conjectures by Gelfond on the densities of $0$ and $1$ of $t(p_n)$ and $t(n^2)$ (where $p_n$ denotes thesequence of primes). More technically, one has to develop a method to transfer density results for primitive automatic sequences to logarithmic-density results for general automatic sequences. Then asan application one can deduce that the logarithmic densities of any automatic sequence along squares $(n^2){n\geq 0}$ and primes $(p_n)_{n\geq 1}$ exist and are computable. Furthermore, if densities exist then they are (usually) rational.

Keywords : automatic sequences; logarithmic densities; prime numbers

MSC Codes :
11A63 - Radix representation; digital problems
11B85 - Automata sequences
11L03 - Trigonometric and exponential sums, general
11L20 - Sums over primes
11N05 - Distribution of primes

    Information on the Video

    Film maker : Hennenfent, Guillaume
    Language : English
    Available date : 01/12/2020
    Conference Date : 23/11/2020
    Subseries : Research talks
    arXiv category : Number Theory ; Formal Languages and Automata Theory
    Mathematical Area(s) : Computer Science ; Number Theory
    Format : MP4 (.mp4) - HD
    Video Time : 00:46:04
    Targeted Audience : Researchers
    Download : https://videos.cirm-math.fr/2020-11-23_Drmota.mp4

Information on the Event

Event Title : Jean-Morlet Chair 2020 - Conference: Diophantine Problems, Determinism and Randomness / Chaire Jean-Morlet 2020 - Conférence : Problèmes diophantiens, déterminisme et aléatoire
Event Organizers : Rivat, Joël ; Tichy, Robert
Dates : 23/11/2020 - 27/11/2020
Event Year : 2020
Event URL : https://www.chairejeanmorlet.com/2256.html

Citation Data

DOI : 10.24350/CIRM.V.19686703
Cite this video as: Drmota, Michael (2020). (Logarithmic) densities for automatic sequences along primes and squares. CIRM. Audiovisual resource. doi:10.24350/CIRM.V.19686703
URI : http://dx.doi.org/10.24350/CIRM.V.19686703

See Also

Bibliography

  • ADAMCZEWSKI, Boris, DRMOTA, Michael, et MÜLLNER, Clemens. (Logarithmic) densities for automatic sequences along primes and squares. arXiv preprint arXiv:2009.14773, 2020. - https://arxiv.org/abs/2009.14773

  • MAUDUIT, Christian, RIVAT, Joël, et al. La somme des chiffres des carrés. Acta Mathematica, 2009, vol. 203, no 1, p. 107-148. - http://dx.doi.org/10.1007/s11511-009-0040-0

  • MAUDUIT, Christian et RIVAT, Joël. Sur un probleme de Gelfond: la somme des chiffres des nombres premiers. Annals of Mathematics, 2010, p. 1591-1646. - https://www.jstor.org/stable/20752248



Bookmarks Report an error