English

Envelope Word and Gap Sequence in Doubling Sequence

Dynamical Systems 2014-08-26 v1

Abstract

Let ω\omega be a factor of Doubling sequence D=x1x2D_\infty=x_1x_2\cdots, then it occurs in the sequence infinitely many times. Let ωp\omega_p be the pp-th occurrence of ω\omega and Gp(ω)G_p(\omega) be the gap between ωp\omega_p and ωp+1\omega_{p+1}. In this paper, we discuss the structure of the gap sequence {Gp(ω)}p1\{G_p(\omega)\}_{p\geq1}. We prove that all factors can be divided into two types, one type has exactly two distinct gaps G1(ω)G_1(\omega) and G2(ω)G_2(\omega), the other type has exactly three distinct gaps G1(ω)G_1(\omega), G2(ω)G_2(\omega) and G4(ω)G_4(\omega). We determine the expressions of gaps completely. And also give the substitution of each gap sequence. The main tool in this paper is "envelope word", which is a new notion, denoted by Em,iE_{m,i}. As an application, we determine the positions of all ωp\omega_p, discuss some combinatorial properties of factors, and count the distinct squares beginning in D[1,N]D_\infty[1,N] for N1N\geq1.

Cite

@article{arxiv.1408.5495,
  title  = {Envelope Word and Gap Sequence in Doubling Sequence},
  author = {Yuke Huang and Hanxiong Zhang},
  journal= {arXiv preprint arXiv:1408.5495},
  year   = {2014}
}

Comments

14 pages, 7 figures. arXiv admin note: text overlap with arXiv:1408.3724

R2 v1 2026-06-22T05:37:33.302Z