A new characteristic property of the palindrome prefixes of a standard Sturmian word.
On Hales-Jewett's theorem.
Shuffle-invariant total orders.
A hierarchy for circular codes
We first prove an extremal property of the infinite Fibonacci word : the family of the palindromic prefixes {} of is not only a circular code but “almost” a comma-free one (see Prop. 12 in Sect. 4). We also extend to a more general situation the notion of a necklace introduced for the study of trinucleotides codes on the genetic alphabet, and we present a hierarchy relating two important classes of codes, the comma-free codes and the circular ones.
Decimations and sturmian words
On a characteristic property of Arnoux–Rauzy sequences
Here we give a characterization of Arnoux–Rauzy sequences by the way of the lexicographic orderings of their alphabet.
On a characteristic property of ARNOUX–RAUZY sequences
Here we give a characterization of Arnoux–Rauzy sequences by the way of the lexicographic orderings of their alphabet.
Alcune condizioni sul prodotto di due elementi in un semigruppo.
Sia S un semigruppo finitamente generato. Se per ogni coppia x,y di elementi di S si ha che xy oppure yx è un idempotente allora S è finito.
Page 1