Research

Publications

Peer-reviewed journals

K. Aloui, D. Jamet, H. Kaneko, S. Kopecki, P. Popoli and T. Stoll, On the binary digits of n and n^2, Theoretical Computer Science, 939 (2023), 119-139.
D. Jamet, P. Popoli and T Stoll, Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences, Cryptography and Communications, 13 (5), (2021), 791-814.
P. Popoli, On The Maximum Order Complexity Of Thue-Morse And Rudin-Shapiro Sequences Along Polynomial Values, Uniform Distribution Theory 15 (2020), no. 2, 9-22.

Selective Conferences

P. Popoli, J. Shallit and M. Stipulanti, Additive Word Complexity and Walnut, FSTTCS 2024.
P. Popoli and M. Stipulanti, On the pseudorandomness of Parry-Bertrand automatic sequences, ICTCS 2024.
D. Laplace Mermoud and P. Popoli, Combinatorics on Social Configurations, EPTCS (Proceedings of GASCom 2024).

Preprints

E. Charlier, P. Popoli, M. Rigo, Computing Expansions in Infinitely Many Cantor Real Bases via a Single Transducer, preprint.
J.-M. Couvreur, M. Delacourt, N. Ollinger, P. Popoli, J. Shallit, M Stipulanti, Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences.
P. Popoli, Correlation of the Rudin-Shapiro sequence along prime numbers.

Talks

Conferences

Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences , SDA2 2025, May 2025, Montpellier.
Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences , Words and Subwords, April 2025, Liège.
Additive Word Complexity and Walnut, Uniform Distribution of Sequences Workshop, ESI, April 2025, Vienna.
Additive Word Complexity and Walnut, FSTTCS 2024, December 2024 Ghandinagar.
On the pseudorandomness of Parry-Bertrand automatic sequences, Italian Conference on Theoritical Computer Science, September 2024, Turin.
Additive Word Complexity and Walnut, 19e Journées Montoises d'Informatique Théorique, September 2024, Nice.
Automatic sequences and pseudorandomness, Young Scholar Day of the Belgian Mathematical Society, December 2023, Brussels.
On the binary digits of n and n^2, Journées Arithmétiques 2023 July 2023, Nancy.
On the binary digits of n and n^2, Numeration 2023, May 2023, Liège.
On the binary digits of n and n^2, Diophantine Analysis and Related Fields (DARF), March 2023, Hirosaki.
Maximum order complexity for some automatic and morphic sequences, 18e Journées Montoises d'Informatique Théorique , September 2022, Prague.
Maximum order complexity for some automatic and morphic sequences along polynomial values, MCQMC 2022, July 2022, Linz.
Maximum order complexity for some automatic and morphic sequences along polynomial values, Journées de Combinatoire de Bordeaux (JCB) 2022, June 2022, Bordeaux.
Mesures de complexités pour les suites automatiques et leurs sous-suites, Journées SDA2 2020, December 2020, Caen (online).
Complexité d’ordre maximal des suites de Thue–Morse et de Rudin–Shapiro le long des polynômes, EJCIM 2020, June 2020, Bordeaux (online).

Seminars

Additive Word Complexity and Walnut, Séminaire LIRMM, January 2025, Montpellier.
Additive Word Complexity and Walnut, Séminaire LIFO, December 2024, Orléans.
On the binary digits of n and n^2, Number Theory Seminar, October 2023, Waterloo (online).
On the binary digits of n and n^2, Mocqua Seminar (Loria), June 2023, Nancy.
On the binary digits of n and n^2, Séminaire Ernest (I2M), April 2023, Marseille.
Sum of digits, pseudorandomness and measures of complexity, Séminaire algorithmique GREYC, March 2023, Caen.
Pseudo-aléa de suites automatiques le long des sous-suites, Séminaire ADA, January 2023, Calais.
Maximum order complexity for some automatic and morphic sequences along polynomial values, Combinatorics on Words seminar (CoW), June 2022, online.
Maximum order complexity for some automatic and morphic sequences along polynomial values, One World Numeration Seminar (OWNS), March 2022, online.
Complexité d'ordre maximal pour certaines suites automatiques et morphiques le long de sous-suites polynomiales, Séminaire de Combinatoire et Théorie des Nombres, March 2022, Lyon.
Complexité d'ordre maximal pour certaines suites automatiques et morphiques le long de sous-suites polynomiales, Séminaire du LACIM, February 2022, Montréal.
Maximum order complexity for some automatic and morphic sequences along polynomial values, Rencontres de théorie analytique et élémentaire des nombres, January 2022, Paris.
Maximum order complexity for some automatic and morphic sequences along polynomial values, Discrete Mathematics Seminar RICAM, May 2021, Linz (online).

Posters

On the pseudorandomness of Parry-Bertrand automatic sequences, Journées Nationales du GDR IFM 2024, April 2024, Grenoble.
On the binary digits of n and n^2, Journées Nationales du GDR IM (JNIM) 2023, April 2023, Paris.
Suites automatiques et morphiques de grande complexité le long des sous-suites, Journées Nationales du GDR IM (JNIM) 2022, March 2022, Villeneuve d'Ascq.

Dissertations

Ph.D. thesis: Automatic and morphic sequences with large complexity along subsequences, directed by Damien Jamet (Loria) and Thomas Stoll (IECL), University of Lorraine, December 2022.
Master's thesis: La suite de Thue-Morse généralisée le long des cubes, directed by Thomas Stoll (IECL), University of Lorraine, June 2019.

Page updated

Google Sites

Report abuse