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

From MaRDI portal
Publication:6138835

DOI10.1016/J.TCS.2023.114342arXiv2112.05347MaRDI QIDQ6138835FDOQ6138835


Authors: Xiao-Tao Lü, Jin Chen, Zhixiong Wen, Wen Wu Edit this on Wikidata


Publication date: 16 January 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Abstract: In this paper, we study the 2-binomial complexity bmathbftm,2(n) of the generalized Thue-Morse words mathbftm for every integer mgeq3. We obtain the exact value of bmathbftm,2(n) for every integer ngeqm2. As a consequence, bmathbftm,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, {�f 176} (2020) 105284].


Full work available at URL: https://arxiv.org/abs/2112.05347







Cites Work


Cited In (2)





This page was built for publication: On the 2-binomial complexity of the generalized Thue-Morse words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138835)