| Publication | Date of Publication | Type |
|---|
Reduced complexities for sequences over finite alphabets
Integers | 2026-03-05 | Paper |
| Words avoiding half-flips | 2025-11-14 | Paper |
Complement avoidance in binary words
The Electronic Journal of Combinatorics | 2025-11-12 | Paper |
The analogue of overlap-freeness for the Fibonacci morphism
RAIRO. Theoretical Informatics and Applications | 2025-09-02 | Paper |
The repetition threshold for ternary rich words
The Electronic Journal of Combinatorics | 2025-07-11 | Paper |
The lexicographically least binary rich word achieving the repetition threshold
The Electronic Journal of Combinatorics | 2025-01-27 | Paper |
Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers
SIAM Journal on Discrete Mathematics | 2024-12-18 | Paper |
Antisquares and critical exponents
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-06 | Paper |
A small morphism for which the fixed point has an abelian critical exponent less than 2
RAIRO. Theoretical Informatics and Applications | 2024-06-07 | Paper |
| A small morphism giving Abelian repetition threshold less than 2 | 2023-12-27 | Paper |
| The analogue of overlap-freeness for the Fibonacci morphism | 2023-11-21 | Paper |
The analog of overlap-freeness for the period-doubling sequence
(available as arXiv preprint) | 2023-10-23 | Paper |
| The analog of overlap-freeness for the period-doubling sequence | 2023-10-23 | Paper |
Properties of a ternary infinite word
RAIRO - Theoretical Informatics and Applications | 2023-05-25 | Paper |
| Complement Avoidance in Binary Words | 2022-09-20 | Paper |
| Extending Dekking's construction of an infinite binary word avoiding abelian $4$-powers | 2021-11-15 | Paper |
The undirected repetition threshold and undirected pattern avoidance
Theoretical Computer Science | 2021-04-14 | Paper |
Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101
Theoretical Computer Science | 2020-12-16 | Paper |
The repetition threshold for binary rich words
(available as arXiv preprint) | 2020-10-28 | Paper |
| There are level ternary circular square-free words of length $n$ for $n\ne 5,7,9,10,14,17.$ | 2020-05-13 | Paper |
The number of threshold words on \(n\) letters grows exponentially for every \(n \geq 27\)
(available as arXiv preprint) | 2020-05-12 | Paper |
| The number of threshold words on \(n\) letters grows exponentially for every \(n \geq 27\) | 2020-05-12 | Paper |
Finite test sets for morphisms that are squarefree on some of Thue's squarefree ternary words
(available as arXiv preprint) | 2020-01-27 | Paper |
| Finite test sets for morphisms that are squarefree on some of Thue's squarefree ternary words | 2020-01-27 | Paper |
Some further results on squarefree arithmetic progressions in infinite words
Theoretical Computer Science | 2019-11-13 | Paper |
The undirected repetition threshold
(available as arXiv preprint) | 2019-11-06 | Paper |
Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
The Electronic Journal of Combinatorics | 2019-06-06 | Paper |
Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
The Electronic Journal of Combinatorics | 2019-06-06 | Paper |
| On some problems of Harju concerning squarefree arithmetic progressions in infinite words | 2018-12-05 | Paper |
Unary patterns under permutations
Theoretical Computer Science | 2018-08-23 | Paper |
Avoidance bases for formulas with reversal
Theoretical Computer Science | 2018-06-18 | Paper |
On avoidability of formulas with reversal
RAIRO - Theoretical Informatics and Applications | 2018-05-04 | Paper |
A family of formulas with reversal of high avoidability index
International Journal of Algebra and Computation | 2017-10-06 | Paper |
A ternary square-free sequence avoiding factors equivalent to abcacba
The Electronic Journal of Combinatorics | 2016-06-01 | Paper |
A ternary square-free sequence avoiding factors equivalent to abcacba
The Electronic Journal of Combinatorics | 2016-06-01 | Paper |
Avoidability index for binary patterns with reversal
The Electronic Journal of Combinatorics | 2016-03-04 | Paper |
Avoidability index for binary patterns with reversal
The Electronic Journal of Combinatorics | 2016-03-04 | Paper |
| Binary words avoiding xx^Rx and strongly unimodal sequences | 2015-12-16 | Paper |
Binary words avoiding xx^Rx and strongly unimodal sequences
(available as arXiv preprint) | 2015-12-16 | Paper |
Growth rate of binary words avoiding \(xxx^{R}\)
Theoretical Computer Science | 2015-12-08 | Paper |
Unary patterns with permutations
Developments in Language Theory | 2015-11-10 | Paper |
| Chromatic properties of the Euclidean plane | 2015-09-11 | Paper |
Suffix conjugates for a class of morphic subshifts
Ergodic Theory and Dynamical Systems | 2015-09-11 | Paper |
| The least self-shuffle of the Thue-Morse sequence | 2015-04-20 | Paper |
Avoiding three consecutive blocks of the same size and same sum
Journal of the ACM | 2014-09-12 | Paper |
Square-free words with square-free self-shuffles
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
| Abelian complexity of fixed point of morphism \(0 \mapsto 012, 1 \mapsto 02, 2 \mapsto 1\) | 2014-04-09 | Paper |
Extremal words in morphic subshifts
Discrete Mathematics | 2014-02-27 | Paper |
Cubefree words with many squares
(available as arXiv preprint) | 2014-02-03 | Paper |
| Cubefree words with many squares | 2014-02-03 | Paper |
Infinite ternary square-free words concatenated from permutations of a single word
Theoretical Computer Science | 2014-01-09 | Paper |
Suffix Conjugates for a Class of Morphic Subshifts
Lecture Notes in Computer Science | 2013-09-20 | Paper |
Unary patterns with involution
International Journal of Foundations of Computer Science | 2013-07-30 | Paper |
Extremal words in the shift orbit closure of a morphic sequence
Developments in Language Theory | 2013-06-28 | Paper |
Fixed points avoiding abelian k-powers
Journal of Combinatorial Theory. Series A | 2012-05-04 | Paper |
Lexicographically least words in the orbit closure of the Rudin-Shapiro word
Theoretical Computer Science | 2011-09-12 | Paper |
Recurrent words with constant abelian complexity
Advances in Applied Mathematics | 2011-06-14 | Paper |
A proof of Dejean’s conjecture
Mathematics of Computation | 2011-04-19 | Paper |
There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\)
Discrete Applied Mathematics | 2010-04-28 | Paper |
Infinite words containing squares at every position
RAIRO - Theoretical Informatics and Applications | 2010-03-12 | Paper |
Infinite words containing squares at every position
RAIRO - Theoretical Informatics and Applications | 2010-03-12 | Paper |
Dejean's conjecture holds for N ≥ 27
RAIRO - Theoretical Informatics and Applications | 2009-12-18 | Paper |
Dejean's conjecture holds for N ≥ 27
RAIRO - Theoretical Informatics and Applications | 2009-12-18 | Paper |
Dejean's conjecture holds for \(n\geq 30\)
Theoretical Computer Science | 2009-08-07 | Paper |
For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \)
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \)
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \)
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
A cyclic binary morphism avoiding abelian fourth powers
Theoretical Computer Science | 2009-02-19 | Paper |
Long binary patterns are abelian 2-avoidable
Theoretical Computer Science | 2009-01-08 | Paper |
Least Periods of Factors of Infinite Words
RAIRO - Theoretical Informatics and Applications | 2008-12-22 | Paper |
Least Periods of Factors of Infinite Words
RAIRO - Theoretical Informatics and Applications | 2008-12-22 | Paper |
Palindrome positions in ternary square-free words
Theoretical Computer Science | 2008-05-28 | Paper |
Attainable lengths for circular binary words avoiding \(k\) powers
Bulletin of the Belgian Mathematical Society - Simon Stevin | 2008-03-11 | Paper |
On abelian 2-avoidable binary patterns
Acta Informatica | 2007-04-19 | Paper |
Dejean's conjecture and Sturmian words
European Journal of Combinatorics | 2007-03-27 | Paper |
Binary words containing infinitely many overlaps
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
Binary words containing infinitely many overlaps
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
Binary words containing infinitely many overlaps
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
| Cantor sets and Dejean's conjecture | 2006-09-06 | Paper |
The fixing block method in combinatorics on words
Combinatorica | 2006-06-27 | Paper |
| scientific article; zbMATH DE number 2186883 (Why is no real title available?) | 2005-07-11 | Paper |
| scientific article; zbMATH DE number 2186883 (Why is no real title available?) | 2005-07-11 | Paper |
Pattern avoidance: themes and variations
Theoretical Computer Science | 2005-06-30 | Paper |
The Thue-Morse word contains circular \(5/2^+\) power free words of every length
Theoretical Computer Science | 2005-04-06 | Paper |
The number of binary words avoiding Abelian fourth powers grows exponentially
Theoretical Computer Science | 2004-08-10 | Paper |
A word on 7 letters which is non-repetitive up to mod 5
Acta Informatica | 2004-03-11 | Paper |
| scientific article; zbMATH DE number 2050938 (Why is no real title available?) | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 2051147 (Why is no real title available?) | 2004-03-07 | Paper |
There exist binary circular 5/2^+ power free words of every length
The Electronic Journal of Combinatorics | 2004-02-05 | Paper |
The set of k-power free words over is empty or perfect
European Journal of Combinatorics | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 1948509 (Why is no real title available?) | 2003-07-13 | Paper |
Counting endomorphisms of crown-like orders
Order | 2003-06-09 | Paper |
There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
The Electronic Journal of Combinatorics | 2003-05-13 | Paper |
There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
The Electronic Journal of Combinatorics | 2003-05-13 | Paper |
No iterated morphism generates any arshon sequence of odd order
Discrete Mathematics | 2003-03-16 | Paper |
Non-repetitive tilings
The Electronic Journal of Combinatorics | 2002-07-25 | Paper |
Non-repetitive tilings
The Electronic Journal of Combinatorics | 2002-07-25 | Paper |
The metric dimension and metric independence of a graph
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2002-06-03 | Paper |
Avoiding patterns in the abelian sense
Canadian Journal of Mathematics | 2002-06-02 | Paper |
Words strongly avoiding fractional powers
European Journal of Combinatorics | 2000-04-26 | Paper |
| scientific article; zbMATH DE number 1400022 (Why is no real title available?) | 2000-02-06 | Paper |
Extremal infinite overlap-free binary words
The Electronic Journal of Combinatorics | 1998-05-24 | Paper |
Extremal infinite overlap-free binary words
The Electronic Journal of Combinatorics | 1998-05-24 | Paper |
| scientific article; zbMATH DE number 992016 (Why is no real title available?) | 1997-03-16 | Paper |
Non-repetitive words: Ages and essences
Combinatorica | 1996-10-07 | Paper |
A note on antichains of words
The Electronic Journal of Combinatorics | 1996-07-21 | Paper |
A note on antichains of words
The Electronic Journal of Combinatorics | 1996-07-21 | Paper |
On the structure and extendibility of \(k\)-power free words
European Journal of Combinatorics | 1995-05-30 | Paper |
Open Problems in Pattern Avoidance
The American Mathematical Monthly | 1994-07-10 | Paper |
Words without Near-Repetitions
Canadian Mathematical Bulletin | 1993-02-16 | Paper |
Connectivity of distance graphs
Discrete Mathematics | 1993-01-16 | Paper |
The number of order-preserving maps of fences and crowns
Order | 1992-06-27 | Paper |
| scientific article; zbMATH DE number 21731 (Why is no real title available?) | 1992-06-26 | Paper |
Which graphs allow infinite nonrepetitive walks?
Discrete Mathematics | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4027159 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3835387 (Why is no real title available?) | 1984-01-01 | Paper |
Class Numbers and Biquadratic Reciprocity
Canadian Journal of Mathematics | 1982-01-01 | Paper |
Antisquares and Critical Exponents
(available as arXiv preprint) | N/A | Paper |
