论文标题
解码Rauzy归纳：Bufetov问题的有效答案
Decoding Rauzy Induction: An Effective Answer to Bufetov's Question
论文作者
论文摘要
典型的间隔交换转换具有通过连续的Rauzy诱导迭代术的无限矩阵序列。 2010年，W。A。Veech通过表明间隔交换本身可以从这些矩阵中恢复，并且必须是唯一的，才能在拓扑结合中恢复，从而回答了A. Bufetov的问题。在这项工作中，我们将通过提供算法来改进这些结果，以确定这些矩阵足够长的有限子序列的初始转换。我们还通过构建具有多个不同（甚至达到共轭）初始转换的Rauzy感应的有限序列来显示所需的定义长度。
A typical interval exchange transformation has an infinite sequence of matrices associated to it by successive iterations of Rauzy induction. In 2010, W. A. Veech answered a question of A. Bufetov by showing that the interval exchange itself may be recovered from these matrices and must be unique up to topological conjugation. In this work, we will improve upon these results by providing an algorithm to determine the initial transformation from a sufficiently long finite subsequence of these matrices. We also show the defined length to be necessary by constructing finite sequences of Rauzy induction with multiple distinct (even up to conjugacy) initial transformations.
