Matrices of 3iet preserving morphisms

Details Matrices of 3iet preserving morphisms Matrices of 3iet preserving morphisms

2007-02-12

arxiv.org/abs/math/0702336v1

Mathematics

Combinatorics

26 pages, 4 figures

Scientific paper

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)$.

Affiliated with

Also associated with

No associations

Rating

Matrices of 3iet preserving morphisms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Matrices of 3iet preserving morphisms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Matrices of 3iet preserving morphisms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-633688