On the abelian complexity of the Rudin-Shapiro sequence
classification
🧮 math.CO
math.CA
keywords
complexityabelianfunctionsequencelambdarudin-shapiroasymptoticcertain
read the original 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 $\rho(n)$ which satisfies certain recurrence relations. As a consequence, the abelian complexity function is $2$-regular. Further, we prove that the box dimension of the graph of the asymptotic function $\lambda(x)$ is $3/2$ where $\lambda(x)=\lim_{k\to\infty}\rho(4^{k}x)/\sqrt{4^{k}x}$ and $\rho(x)=\rho(\lfloor x\rfloor)$ for any $x> 0$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.