On the 2-binomial complexity of the generalized Thue-Morse words

Abstract

In this paper, we study the 2-binomial complexity btm,2(n) of the generalized Thue-Morse words tm for every integer m≥ 3. We obtain the exact value of btm,2(n) for every integer n≥ m2. As a consequence, btm,2(n) is ultimately periodic with period m2. This result partially answers a question of M. Lejeune, J. Leroy and M. Rigo [Computing the k-binomial complexity of the Thue-Morse word, J. Comb. Theory Ser. A, 176 (2020) 105284].

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…