arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0210262math.GRmath.CO
收藏

Decomposition theorem for invertible substitutions on three-letter alphabet

B. Tan, Z. -X. Wen, Y. -P. Zhang

英文摘要:

We shall characterize the structure of invertible substitutions on three-letter alphabet. We show that any invertible substitution, after some cyclic operation, can be written as a finite product of permutations and Fibonacci's substitution. As a consequence, a matrix (of order 3 and with non-negative integral coefficients) is the matrix of an invertible substitution if and only if it is a finite product of non-negative elementary matrices.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑