Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On Christoffel and standard words and their derivatives (1602.03231v1)

Published 10 Feb 2016 in cs.DM, cs.FL, and math.CO

Abstract: We introduce and study natural derivatives for Christoffel and finite standard words, as well as for characteristic Sturmian words. These derivatives, which are realized as inverse images under suitable morphisms, preserve the aforementioned classes of words. In the case of Christoffel words, the morphisms involved map $a$ to $a{k+1}b$ (resp.,~$ab{k}$) and $b$ to $a{k}b$ (resp.,~$ab{k+1}$) for a suitable $k>0$. As long as derivatives are longer than one letter, higher-order derivatives are naturally obtained. We define the depth of a Christoffel or standard word as the smallest order for which the derivative is a single letter. We give several combinatorial and arithmetic descriptions of the depth, and (tight) lower and upper bounds for it.

Citations (1)

Summary

We haven't generated a summary for this paper yet.