115 citations · 208 across the 14 of their papers we have counts for
16 papers
Recovery of cyclic words by their subwords
Sergey Luchinin, Svetlana Puzynina, Michaël Rao
A problem of reconstructing words from their subwords involves determining the minimum amount of information needed, such as multisets of scattered subwords of a specific length or…
The 2-domination and Roman domination numbers of grid graphs
Michaël Rao, Alexandre Talon
We investigate the 2-domination number for grid graphs, that is the size of a smallest set of vertices of the grid such that each vertex of the grid belongs to or has at le…
Exhaustive search of convex pentagons which tile the plane
Michael Rao
We present an exhaustive search of all families of convex pentagons which tile the plane. This research shows that there are no more than the already 15 known families. In particul…
On cardinalities of -abelian equivalence classes
Juhani Karhumäki, Svetlana Puzynina, Michaël Rao +1
Two words and are -abelian equivalent if, for each word of length at most , occurs equally many times as a factor in both and . The notion of -abeli…
Avoiding two consecutive blocks of same size and same sum over
Michaël Rao, Matthieu Rosenfeld
A long standing question asks whether is uniformly 2-repetitive [Justin 1972, Pirillo and Varricchio, 1994], that is, whether there is an infinite sequence over a fini…
Avoidability of long -abelian repetitions
Michaël Rao, Matthieu Rosenfeld
We study the avoidability of long -abelian-squares and -abelian-cubes on binary and ternary alphabets. For , these are Mäkelä's questions. We show that one cannot avoid…