1 citations · 1 across the 2 of their papers we have counts for
3 papers
math.CO2020
A proof that a word of length n has less than 1.5n distinct squares
Adrien Thierry
We are interested in the maximal number of distinct squares in a word. This problem was introduced by Fraenkel and Simpson, who presented a bound of 2n for a word of length n, and…
math.CO2014
Combinatorics of The Interrupted Period
Adrien Thierry
This article is about discrete periodicities and their combinatorial structure. It describes the unique structure caused by the alteration of a pattern in a repetition. That altera…
math.CO2013★ 1 cited
How many double squares can a string contain?
Antoine Deza, Frantisek Franek, Adrien Thierry
Counting the types of squares rather than their occurrences, we consider the problem of bounding the number of distinct squares in a string. Fraenkel and Simpson showed in 1998 tha…