| Publication | Date of Publication | Type |
|---|
| 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 |
| https://portal.mardi4nfdi.de/entity/Q6076149 | 2023-10-23 | Paper |
| Properties of a ternary infinite word | 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 | 2021-04-14 | Paper |
| Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101 | 2020-12-16 | Paper |
| The repetition threshold for binary rich words | 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$ | 2020-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5212139 | 2020-01-27 | Paper |
| Some further results on squarefree arithmetic progressions in infinite words | 2019-11-13 | Paper |
| The undirected repetition threshold | 2019-11-06 | Paper |
| Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture | 2019-06-06 | Paper |
| On some problems of Harju concerning squarefree arithmetic progressions in infinite words | 2018-12-05 | Paper |
| Unary patterns under permutations | 2018-08-23 | Paper |
| Avoidance bases for formulas with reversal | 2018-06-18 | Paper |
| On avoidability of formulas with reversal | 2018-05-04 | Paper |
| A family of formulas with reversal of high avoidability index | 2017-10-06 | Paper |
| A ternary square-free sequence avoiding factors equivalent to \(abcacba\) | 2016-06-01 | Paper |
| Avoidability index for binary patterns with reversal | 2016-03-04 | Paper |
| Binary words avoiding xx^Rx and strongly unimodal sequences | 2015-12-16 | Paper |
| Growth rate of binary words avoiding \(xxx^{R}\) | 2015-12-08 | Paper |
| Unary Patterns with Permutations | 2015-11-10 | Paper |
| Suffix conjugates for a class of morphic subshifts | 2015-09-11 | Paper |
| Chromatic properties of the Euclidean plane | 2015-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5246208 | 2015-04-20 | Paper |
| Avoiding Three Consecutive Blocks of the Same Size and Same Sum | 2014-09-12 | Paper |
| Square-free words with square-free self-shuffles | 2014-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5408177 | 2014-04-09 | Paper |
| Extremal words in morphic subshifts | 2014-02-27 | Paper |
| Cubefree words with many squares | 2014-02-03 | Paper |
| Infinite ternary square-free words concatenated from permutations of a single word | 2014-01-09 | Paper |
| Suffix Conjugates for a Class of Morphic Subshifts | 2013-09-20 | Paper |
| UNARY PATTERNS WITH INVOLUTION | 2013-07-30 | Paper |
| Extremal Words in the Shift Orbit Closure of a Morphic Sequence | 2013-06-28 | Paper |
| Fixed points avoiding abelian \(k\)-powers | 2012-05-04 | Paper |
| Lexicographically least words in the orbit closure of the Rudin-Shapiro word | 2011-09-12 | Paper |
| Recurrent words with constant abelian complexity | 2011-06-14 | Paper |
| A proof of Dejean’s conjecture | 2011-04-19 | Paper |
| There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\) | 2010-04-28 | Paper |
| Infinite words containing squares at every position | 2010-03-12 | Paper |
| Dejean's conjecture holds for N ≥ 27 | 2009-12-18 | Paper |
| Dejean's conjecture holds for \(n\geq 30\) | 2009-08-07 | Paper |
| For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \) | 2009-04-07 | Paper |
| A cyclic binary morphism avoiding abelian fourth powers | 2009-02-19 | Paper |
| Long binary patterns are abelian 2-avoidable | 2009-01-08 | Paper |
| Least Periods of Factors of Infinite Words | 2008-12-22 | Paper |
| Palindrome positions in ternary square-free words | 2008-05-28 | Paper |
| Attainable lengths for circular binary words avoiding \(k\) powers | 2008-03-11 | Paper |
| On abelian 2-avoidable binary patterns | 2007-04-19 | Paper |
| Dejean's conjecture and Sturmian words | 2007-03-27 | Paper |
| Binary words containing infinitely many overlaps | 2007-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5486008 | 2006-09-06 | Paper |
| The fixing block method in combinatorics on words | 2006-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024004 | 2005-07-11 | Paper |
| Pattern avoidance: themes and variations | 2005-06-30 | Paper |
| The Thue-Morse word contains circular \(5/2^+\) power free words of every length | 2005-04-06 | Paper |
| The number of binary words avoiding Abelian fourth powers grows exponentially | 2004-08-10 | Paper |
| A word on 7 letters which is non-repetitive up to mod 5 | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453213 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453436 | 2004-03-07 | Paper |
| There exist binary circular \(5/2^+\) power free words of every length | 2004-02-05 | Paper |
| The set of \(k\)-power free words over \(\Sigma\) is empty or perfect | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4412125 | 2003-07-13 | Paper |
| Counting endomorphisms of crown-like orders | 2003-06-09 | Paper |
| There are ternary circular square-free words of length \(n\) for \(n \geq\) 18 | 2003-05-13 | Paper |
| No iterated morphism generates any arshon sequence of odd order | 2003-03-16 | Paper |
| Non-repetitive tilings | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768132 | 2002-06-03 | Paper |
| Words strongly avoiding fractional powers | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4939575 | 2000-02-06 | Paper |
| Extremal infinite overlap-free binary words | 1998-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3125182 | 1997-03-16 | Paper |
| Non-repetitive words: Ages and essences | 1996-10-07 | Paper |
| A note on antichains of words | 1996-07-21 | Paper |
| On the structure and extendibility of \(k\)-power free words | 1995-05-30 | Paper |
| Open Problems in Pattern Avoidance | 1994-07-10 | Paper |
| Words without Near-Repetitions | 1993-02-16 | Paper |
| Connectivity of distance graphs | 1993-01-16 | Paper |
| The number of order-preserving maps of fences and crowns | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3981346 | 1992-06-26 | Paper |
| Which graphs allow infinite nonrepetitive walks? | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3768668 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3040560 | 1984-01-01 | Paper |
| Class Numbers and Biquadratic Reciprocity | 1982-01-01 | Paper |
