Catalog Home Page

Characterizations of finite and infinite episturmian words via lexicographic orderings

Glen, A. (2007) Characterizations of finite and infinite episturmian words via lexicographic orderings. In: Algebraic Combinatorics Seminar , The Fields Institute for Research in Mathematical Sciences, 12 February, Toronto, Canada.

[img]
Preview
PDF (Presentation)
Download (2MB)

Abstract

In this talk, I will present some new results arising from collaborative work with Jacques Justin (France) and Giuseppe Pirillo (Italy). This work, which extends previous results on extremal properties of infinite Sturmian and episturmian words, is purely combinatorial in nature. Specifically, we characterize by lexicographic order all finite Sturmian and episturmian words, i.e., all (finite) factors of such infinite words. Consequently, we obtain a characterization of infinite episturmian words in a wide sense (episturmian and episkew infinite words). That is, we characterize the set of all infinite words whose factors are (finite) episturmian. Similarly, we characterize by lexicographic order all balanced infinite words over a 2-letter alphabet; in other words, all Sturmian and skew infinite words, the factors of which are (finite) Sturmian.

Publication Type: Conference Item
URI: http://researchrepository.murdoch.edu.au/id/eprint/19386
Item Control Page Item Control Page

Downloads

Downloads per month over past year