In one dimension, an infinite word is said to be recurrent if every prefix occurs at least twice. A straightforward extension of this definition in higher dimensions turns out to be rather unsatisfying. In this talk, we present several notions of recurrence in the multidimensional case. In particular, we are interested in words having the property to be strongly uniformly recurrent: for each direction q, every prefix occurs in that direction (i.e. in positions iq) with bounded gaps. We will provide several constructions of such words and focus on the strongly uniform recurrence in the case of square morphisms. Joint work with Émilie Charlier and Svetlana Puzynina
Many combinatorial and arithmetical properties have been studied for infinite words ub associated wi...
The central notionof thisthesisis repetitionsin words. We studyproblemsrelated to contiguous repetit...
Abstract. We explore a family of nested recurrence relations with arbitrary levels of nesting, which...
In one dimension, an infinite word is said to be recurrent if every prefix occurs at least twice. A ...
peer reviewedIn this paper we study various modifications of the notion of uniform recurrence in mul...
peer reviewedIn this paper we introduce and study new notions of uniform recurrence in multidimensio...
special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Appli...
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, ...
Abstract. We study recurrence, and multiple recurrence, properties along the k-th powers of a given ...
AbstractIn this paper, we provide a new characterization of uniformly recurrent words with finite de...
International audienceWe study recurrence, and multiple recurrence, properties along the $k$-th powe...
A direct product of two words is a naturally defined word on the alphabet of pairs of symbols. We in...
Article dans revue scientifique avec comité de lecture.A repetition in a word is a subword with the ...
AbstractWe study recurrence and periodicity in infinite words by using local conditions. In particul...
International audienceFor infinite words, we study the properties of uniform recurrence, which trans...
Many combinatorial and arithmetical properties have been studied for infinite words ub associated wi...
The central notionof thisthesisis repetitionsin words. We studyproblemsrelated to contiguous repetit...
Abstract. We explore a family of nested recurrence relations with arbitrary levels of nesting, which...
In one dimension, an infinite word is said to be recurrent if every prefix occurs at least twice. A ...
peer reviewedIn this paper we study various modifications of the notion of uniform recurrence in mul...
peer reviewedIn this paper we introduce and study new notions of uniform recurrence in multidimensio...
special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Appli...
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, ...
Abstract. We study recurrence, and multiple recurrence, properties along the k-th powers of a given ...
AbstractIn this paper, we provide a new characterization of uniformly recurrent words with finite de...
International audienceWe study recurrence, and multiple recurrence, properties along the $k$-th powe...
A direct product of two words is a naturally defined word on the alphabet of pairs of symbols. We in...
Article dans revue scientifique avec comité de lecture.A repetition in a word is a subword with the ...
AbstractWe study recurrence and periodicity in infinite words by using local conditions. In particul...
International audienceFor infinite words, we study the properties of uniform recurrence, which trans...
Many combinatorial and arithmetical properties have been studied for infinite words ub associated wi...
The central notionof thisthesisis repetitionsin words. We studyproblemsrelated to contiguous repetit...
Abstract. We explore a family of nested recurrence relations with arbitrary levels of nesting, which...