矩形阵列的周期性
Periodicity in Rectangular Arrays
摘要:
我们讨论了几个二维推广熟悉的林登Schutzenberger周期定理的话。我们考虑原始数组的概念(不能表示为较小数组的重复)。我们计算原始的m x n数组的数量。最后,我们证明了一个可以测试磁阻和计算原根的数组在线性时间。
英文摘要:
We discuss several two-dimensional generalizations of the familiar Lyndon-Schutzenberger periodicity theorem for words. We consider the notion of primitive array (as one that cannot be expressed as the repetition of smaller arrays). We count the number of m x n arrays that are primitive. Finally, we show that one can test primitivity and compute the primitive root of an array in linear time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。