搜索结果: 1-1 共查到“偏微分方程数值解 ternary square-free circular words”相关记录1条 . 查询时间(0.125 秒)
Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alphabet exist for all l...
