The subword complexity of a two-parameter family of sequences
The electronic journal of combinatorics, The Fraenkel Festschrift volume, Tome 8 (2001) no. 2
We determine the subword complexity of the characteristic functions of a two-parameter family $\{A_n\}_{n=1}^\infty$ of infinite sequences which are associated with the winning strategies for a family of 2-player games. A special case of the family has the form $A_n=\lfloor n\alpha\rfloor$ for all $n\in {\bf Z}_{>0}$, where $\alpha$ is a fixed positive irrational number. The characteristic functions of such sequences have been shown to have subword complexity $n+1$. We show that every sequence in the extended family has subword complexity $O(n)$.
@article{10_37236_1609,
author = {Aviezri S. Fraenkel and Tamar Seeman and Jamie Simpson},
title = {The subword complexity of a two-parameter family of sequences},
journal = {The electronic journal of combinatorics},
year = {2001},
volume = {8},
number = {2},
doi = {10.37236/1609},
zbl = {0981.68125},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1609/}
}
TY - JOUR AU - Aviezri S. Fraenkel AU - Tamar Seeman AU - Jamie Simpson TI - The subword complexity of a two-parameter family of sequences JO - The electronic journal of combinatorics PY - 2001 VL - 8 IS - 2 UR - http://geodesic.mathdoc.fr/articles/10.37236/1609/ DO - 10.37236/1609 ID - 10_37236_1609 ER -
Aviezri S. Fraenkel; Tamar Seeman; Jamie Simpson. The subword complexity of a two-parameter family of sequences. The electronic journal of combinatorics, The Fraenkel Festschrift volume, Tome 8 (2001) no. 2. doi: 10.37236/1609
Cité par Sources :