activity
20172024
most citedGeneralized Pascal triangle for binomial coefficients of words

14 citations · 25 across the 10 of their papers we have counts for

collaborators

15 papers

math.CO2024

Additive word complexity and Walnut

Pierre Popoli, Jeffrey Shallit, Manon Stipulanti

In combinatorics on words, a classical topic of study is the number of specific patterns appearing in infinite sequences. For instance, many works have been dedicated to studying t…

math.CO2022

A full characterization of Bertrand numeration systems

Émilie Charlier, Célia Cisternino, Manon Stipulanti

Among all positional numeration systems, the widely studied Bertrand numeration systems are defined by a simple criterion in terms of their numeration languages. In 1989, Bertrand-…

math.NT2022

On digital sequences associated with Pascal's triangle

Pierre Mathonet, Michel Rigo, Manon Stipulanti +1

We consider the sequence of integers whose th term has base- expansion given by the th row of Pascal's triangle modulo (where is a prime number). We first present…

math.CO2021

Closed Ziv-Lempel factorization of the -bonacci words

Marieh Jahannia, Morteza Mohammad-noori, Narad Rampersad +1

A word is said to be closed if it has a proper factor which occurs exactly twice in , as a prefix and as a suffix of . Based on the concept of Ziv-Lempel factorizatio…

cs.FL2021

Revisiting regular sequences in light of rational base numeration systems

Michel Rigo, Manon Stipulanti

Regular sequences generalize the extensively studied automatic sequences. Let be an abstract numeration system. When the numeration language is prefix-closed and regular, a…

math.CO2020

Regular sequences and synchronized sequences in abstract numeration systems

Émilie Charlier, Célia Cisternino, Manon Stipulanti

The notion of -regular sequences was generalized to abstract numeration systems by Maes and Rigo in 2002. Their definition is based on a notion of -kernel that exte…