保3 iet态射的矩阵
Matrices of 3iet preserving morphisms
摘要:
我们研究矩阵的态射保持家庭的话编码3-区间交换变换。众所周知,保持sturmian词(即具有最大可能因子复杂度的词编码2-区间交换变换)的态射矩阵形成幺半群$\{\boldsymbol{M}\in\mathbb{N}^{2\times 2} | \det\boldsymbol{M}=\pm1\} = \{\boldsymbol{M}\in\mathbb{N}^{2\times 2} | \boldsymbol{M}\boldsymbol{E}\boldsymbol{M}^T = \pm\boldsymbol{E}\}$,其中$\boldsymbol{E} = (\begin{smallmatrix}0&1 -1&0\end{smallmatrix})$。我们证明了在交换三个区间的情况下,保留编码这些变换的字并具有最大可能子字复杂度的矩阵属于幺半群$\{\boldsymbol{M}\in\mathbb{N}^{3\times 3} | \boldsymbol{M}\boldsymbol{E}\boldsymbol{M}^T = \pm\boldsymbol{E},\ \det\boldsymbol{M}=\pm 1\}$,其中$\boldsymbol{E} = \Big(\begin{smallmatrix}0&1&1 -1&0&1 -1&-1&0\end{smallmatrix}\Big)$。
英文摘要:
We study matrices of morphisms preserving the family of words coding 3-interval exchange transformations. It is well known that matrices of morphisms preserving sturmian words (i.e. words coding 2-interval exchange transformations with the maximal possible factor complexity) form the monoid $\{\boldsymbol{M}\in\mathbb{N}^{2\times 2} | \det\boldsymbol{M}=\pm1\} = \{\boldsymbol{M}\in\mathbb{N}^{2\times 2} | \boldsymbol{M}\boldsymbol{E}\boldsymbol{M}^T = \pm\boldsymbol{E}\}$, where $\boldsymbol{E} = (\begin{smallmatrix}0&1 -1&0\end{smallmatrix})$. We prove that in case of exchange of three intervals, the matrices preserving words coding these transformations and having the maximal possible subword complexity belong to the monoid $\{\boldsymbol{M}\in\mathbb{N}^{3\times 3} | \boldsymbol{M}\boldsymbol{E}\boldsymbol{M}^T = \pm\boldsymbol{E},\ \det\boldsymbol{M}=\pm 1\}$, where $\boldsymbol{E} = \Big(\begin{smallmatrix}0&1&1 -1&0&1 -1&-1&0\end{smallmatrix}\Big)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。