Cassaigne, J., Labbé, S., & Leroy, J. (2022). Almost everywhere balanced sequences of complexity 2n+1. Moscow Journal of Combinatorics and Number Theory.
Peer reviewed
Durand, F., & Leroy, J. (2022). Decidability of the isomorphism and the factorization between minimal substitution subshifts. Discrete Analysis. doi:10.19086/da.36901
Peer Reviewed verified by ORBi
Gheeraert, F., Lejeune, M., & Leroy, J. (2021). S-adic characterization of minimal ternary dendric shifts. Ergodic Theory and Dynamical Systems. doi:10.1017/etds.2021.84
Dendric shifts are defined by combinatorial restrictions of the extensions of the words
in their ...
Peer Reviewed verified by ORBi
Berthé, V., Bernales, P. C., Durand, F., Leroy, J., Perrin, D., & Petite, S. (2020). On The Dimension Group of Unimodular S-Adic Subshifts. Monatshefte für Mathematik. doi:10.1007/s00605-020-01488-3
Peer Reviewed verified by ORBi
Lejeune, M., Leroy, J., & Rigo, M. (2020). Computing the k-binomial complexity of the Thue–Morse word. Journal of Combinatorial Theory. Series A, 176. doi:10.1016/j.jcta.2020.105284
Two words are k-binomially equivalent whenever they share the same subwords, i.e., subsequences, ...
Peer Reviewed verified by ORBi
Berthé, V., Dolce, F., Durand, F., Leroy, J., & Perrin, D. (2018). Rigidity and substitutive dendric words. International Journal of Foundations of Computer Science, 29 (5), 705-720. doi:10.1142/S0129054118420017
Peer Reviewed verified by ORBi
Leroy, J., Rigo, M., & Stipulanti, M. (2018). Counting Subwords Occurrences in Base-b Expansions. Integers, 18A, 13, 32.
We consider the sequence (Sb(n))n≥0 counting the number of distinct (scattered) subwords occurrin...
Peer Reviewed verified by ORBi
Berthé, V., De Felice, C., Delecroix, V., Dolce, F., Leroy, J., Perrin, D., Reutenauer, C., & Rindone, G. (July 2017). Specular sets. Theoretical Computer Science, 684, 3-28. doi:10.1016/j.tcs.2017.03.001
Peer Reviewed verified by ORBi
Leroy, J., Rigo, M., & Stipulanti, M. (03 March 2017). Behavior of digital sequences through exotic numeration systems. Electronic Journal of Combinatorics, 24 (1), 1.44, 36. doi:10.37236/6581
Many digital functions studied in the literature, e.g., the summatory function
of the base-k sum-...
Peer Reviewed verified by ORBi
Durand, F., & Leroy, J. (February 2017). The constant of recognizability is computable for primitive morphisms. Journal of Integer Sequences, 20 (4).
Peer reviewed
Leroy, J., Rigo, M., & Stipulanti, M. (2017). Counting the number of non-zero coefficients in rows of generalized Pascal triangles. Discrete Mathematics, 340, 862-881. doi:10.1016/j.disc.2017.01.003
This paper is about counting the number of distinct (scattered) subwords occurring in a given wor...
Peer Reviewed verified by ORBi
Charlier, E., Leroy, J., & Rigo, M. (01 July 2016). Asymptotic properties of free monoid morphisms. Linear Algebra and its Applications, 500, 119-148. doi:10.1016/j.laa.2016.02.030
Peer Reviewed verified by ORBi
Leroy, J., Rigo, M., & Stipulanti, M. (2016). Generalized Pascal triangle for binomial coefficients of words. Advances in Applied Mathematics, 80, 24-47. doi:10.1016/j.aam.2016.04.006
We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. ...
Peer Reviewed verified by ORBi
Berthé, V., De Felice, C., Dolce, F., Leroy, J., Perrin, D., Reutenauer, C., & Rindone, G. (2015). Acyclic, connected and tree sets. Monatshefte für Mathematik, 176 (4), 521–550. doi:10.1007/s00605-014-0721-4
Peer Reviewed verified by ORBi
Berthé, V., De Felice, C., Dolce, F., Leroy, J., Perrin, D., Reutenauer, C., & Rindone, G. (2015). Bifix codes and interval exchanges. Journal of Pure and Applied Algebra, 219 (7), 2781–2798. doi:10.1016/j.jpaa.2014.09.028
Peer Reviewed verified by ORBi
Berthé, V., De Felice, C., Dolce, F., Leroy, J., Perrin, D., Reutenauer, C., & Rindone, G. (2015). Maximal bifix decoding. Discrete Mathematics, 338 (5), 725–742. doi:10.1016/j.disc.2014.12.010
Peer Reviewed verified by ORBi
Berthé, V., De Felice, C., Dolce, F., Leroy, J., Perrin, D., Reutenauer, C., & Rindone, G. (2015). The finite index basis property. Journal of Pure and Applied Algebra, 219 (7), 2521–2537. doi:10.1016/j.jpaa.2014.09.014
Peer Reviewed verified by ORBi
Charlier, E., Leroy, J., & Rigo, M. (2015). An analogue of Cobham's theorem for graph directed iterated function systems. Advances in Mathematics, 280, 86-120. doi:10.1016/j.aim.2015.04.008
Feng and Wang showed that two homogeneous iterated function systems in $\mathbb{R}$
with multipl...
Peer Reviewed verified by ORBi
Leroy, J. (2014). An $S$-adic characterization of minimal subshifts with first difference of complexity $1 p(n+1)-p(n)\le2$. Discrete Mathematics and Theoretical Computer Science, 16 (1), 233-286.
Peer Reviewed verified by ORBi
Durand, F., Leroy, J., & Richomme, G. (March 2013). Do the properties of an $S$-adic representation determine factor complexity? Journal of Integer Sequences, 16 (2), 13.2.6, 30.
Peer reviewed
Leroy, J., & Richomme, G. (January 2013). A combinatorial proof of S-adicity for sequences with linear complexity. Integers, 13, 5, 19.
Peer Reviewed verified by ORBi
Durand, F., & Leroy, J. (October 2012). $S$-adic conjecture and Bratteli diagrams. Comptes Rendus de l'Académie des Sciences. Série I. Mathématique, 350 (21-22), 979-983. doi:10.1016/j.crma.2012.10.015
Peer Reviewed verified by ORBi
Leroy, J. (January 2012). Some improvements of the S-adic conjecture. Advances in Applied Mathematics, 48 (1), 79-98. doi:10.1016/j.aam.2011.03.005
