SL
Shuo Li
math.COmath.NT
On Valency
published · living versionsW_mjv66jsy·v1 · currentpublished
Preprints & journals
15 papers in the corpus · 2017–2024The characteristic sequence of the integers that are the sum of two squares is not morphic2404.08822v1 · Shuo Li2024 · 0 citationsarXiv
Block-counting sequences are not purely morphic2304.14595v1 · Antoine Abram, Yining Hu, Shuo Li2023 · 1 citationarXiv
An upper bound of the number of distinct powers in binary words2209.06891v1 · Shuo Li2022 · 0 citationsarXiv
A note on the Lie complexity and beyond2207.05859v1 · Shuo Li2022 · 0 citationsarXiv
A note on the maximum number of -powers in a finite word2205.10156v1 · Shuo Li, Jakub Pachocki, Jakub Radoszewski2022 · 2 citationsarXiv
On the number of squares in a finite word2204.10204v2 · Srecko Brlek, Shuo Li2022 · 1 citationarXiv
On the number of -powers in a finite word2203.16742v1 · Shuo Li2022 · 4 citationsarXiv
Zeckendorf expansion, Dirichlet series and infinite series involving the infinite Fibonacci word2106.05672v2 · Shuo Li2021 · 0 citationsarXiv
Palindromic length sequence of the ruler sequence and of the period-doubling sequence2007.08317v1 · Shuo Li2020 · 1 citationarXiv
-Thue-Morse sequences and infinite products2006.04909v1 · Shuo Li2020 · 0 citationsarXiv
Palindromic length complexity and a generalization of Thue-Morse sequences1907.12543v1 · Shuo Li2019 · 3 citationsarXiv
Automatic sequences defined by Theta functions and some infinite products1907.07572v2 · Shuo Li2019 · 0 citationsarXiv
On completely multiplicative automatic sequences1903.04385v3 · Shuo Li2019 · 7 citationsarXiv
(non)-automaticity of completely multiplicative sequences having negligible many non-trivial prime factors1708.04265v1 · Shuo Li2017 · 1 citationarXiv
Generalized Dirichlet series of n variables associated with automatic sequences1701.08603v2 · Shuo Li2017 · 1 citationarXiv
Career total: 22 works. 15 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.