Combinatorical and Algebraic Structures Seminar
Session details
| Date: | 11.12.2007 |
| Speaker: | Peter Baláži, FJFI, České vysoké učení technické |
| Title: | 3-Interval Exchange Transformations |
| Abstract: | We study words arising from a $r$-interval exchange transformation ($r$-iet), where $r \in \mathbb{N}$. We use a cut-and-project scheme as a geometrical representation of such words and show a necessary and sufficient condition for substitution invariance of words coding exchange of 2 or 3 intervals. For words coding an arbitrary irrational $r$-iet we show that the palindromic complexity $\mathcal{P}(n)$ is 1 for each $n$ even and is $r$ for each $n$ odd. |
Return to index.
last update: 27.9.2007, webmaster: Petr Ambrož