2 papers
math.CO2026
Abelian maximal pattern complexity of two-dimensional words
Qingcheng Zeng, Yumei Xue, Cheng Zeng
In this paper, we study the maximal pattern complexity of two-dimensional words up to Abelian equivalence. We establish a lower bound for the Abelian maximal pattern complexity of…
math.CO2026
Gromov Hyperbolicity of Substitution graphs
Qingcheng Zeng, Cheng Zeng, Yumei Xue +1
In this paper, we construct a class of infinite graphs, called substitution graphs. The vertex set consists of all finite words over a finite alphabet. A directed graph is formed b…