Non-Convex Words

Xavier Provençal (1)

1 LAMA - Laboratoire de Mathématiques

Using a combinatorial characterization of digital convexity based on words, one defines the language of convex words. The complement of this language form an ideal whose minimal elements, with respect to the factorial ordering, appear to have a particular combinatoral structure very close to the Christoffel words. In this paper, those words are completely characterized as those of the form u w^k v where k 1, w = u * v and u, v, w are Christoffel words.

Domaines: Mathématique discrète [cs.DM]

Xavier Provençal. Non-Convex Words. 7-th International Conference on Words (Words 2009), Sep 2009, Italy. ⟨hal-00966965⟩