On the abelian complexity of the Rudin-Shapiro sequence
Combinatorics
2017-03-14 v1 Classical Analysis and ODEs
Abstract
In this paper, we study the abelian complexity of the Rudin-Shapiro sequence and a related sequence. We show that these two sequences share the same complexity function which satisfies certain recurrence relations. As a consequence, the abelian complexity function is -regular. Further, we prove that the box dimension of the graph of the asymptotic function is where and for any .
Keywords
Cite
@article{arxiv.1606.06935,
title = {On the abelian complexity of the Rudin-Shapiro sequence},
author = {Xiaotao Lü and Jin Chen and Zhixiong Wen and Wen Wu},
journal= {arXiv preprint arXiv:1606.06935},
year = {2017}
}
Comments
18 pages, 1 figure