On a generalization of Christoffel words: epichristoffel words
| dc.creator | Paquin, Genevieve | |
| dc.date | 2008-05-27 | |
| dc.date | 2009-04-24 | |
| dc.date.accessioned | 2026-07-07T13:07:29Z | |
| dc.date.available | 2026-07-07T13:07:29Z | |
| dc.description | Sturmian sequences are well-known as the ones having minimal complexity over a 2-letter alphabet. They are also the balanced sequences over a 2-letter alphabet and the sequences describing discrete lines. They are famous and have been extensively studied since the 18th century. One of the {extensions} of these sequences over a $k$-letter alphabet, with $k\geq 3$, are the episturmian sequences, which generalizes a construction of Sturmian sequences using the palindromic closure operation. There exists a finite version of the Sturmian sequences called the Christoffel words. They are known since the works of Christoffel and have interested many mathematicians. In this paper, we introduce a generalization of Christoffel words for an alphabet with 3 letters or more, using the episturmian morphisms. We call them the {\it epichristoffel words}. We define this new class of finite words and show how some of the properties of the Christoffel words can be generalized naturally or not for this class. | |
| dc.description | 16 pages, submit to TCS | |
| dc.identifier | https://arxiv.org/abs/0805.4174 | |
| dc.identifier | http://arxiv.org/abs/0805.4174 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/228106 | |
| dc.subject | Combinatorics | |
| dc.title | On a generalization of Christoffel words: epichristoffel words | |
| dc.type | text |