搜索结果: 1-1 共查到“运筹学 Sufficiently Long Abelian Squares”相关记录1条 . 查询时间(0.078 秒)
A finite word w is an abelian square if w = xx′ with x′ a permutation of x. In 1972,
Entringer, Jackson, and Schatz proved that every binary word of length k2+6k contains an abelian square of length ...