English

On the additive complexity of a Thue-Morse like sequence

Combinatorics 2018-07-16 v2

Abstract

In this paper, we study the additive complexity ρt+(n)\rho^{+}_{\mathbf{t}}(n) of a Thue-Morse like sequence t=σ(0)\mathbf{t}=\sigma^{\infty}(0) with the morphism σ:001,112,220\sigma: 0\to 01, 1\to 12, 2\to 20. We show that ρt+(n)=2log2(n)+3\rho^{+}_{\mathbf{t}}(n)=2\lfloor\log_2(n)\rfloor+3 for all integers n1n\geq 1. Consequently, (ρt(n))n1(\rho_{\mathbf{t}}(n))_{n\geq 1} is a 22-regular sequence.

Keywords

Cite

@article{arxiv.1802.03610,
  title  = {On the additive complexity of a Thue-Morse like sequence},
  author = {Jin Chen and Zhixiong Wen and Wen Wu},
  journal= {arXiv preprint arXiv:1802.03610},
  year   = {2018}
}

Comments

14 pages

R2 v1 2026-06-23T00:17:59.297Z