【24h】

BRUN MEETS SELMER

机译:布朗遇见塞尔默

获取原文
           

摘要

The most famous 2-dimensional continued fraction algorithm is the Jacobi algorithm. However, Brun and Selmer algorithms are also interesting 2-dimensional subtractive algorithms. Schratzberger shows that all these three algorithms are deeply related by a process similar to insertion and extension for continued fractions. In this note the basic ergodic properties of two mixtures of both maps are explored. Furthermore a digression to a quite different map is made which exhibits an “exotic” invariant measure.
机译:最着名的二维持续分数算法是Jacobi算法。然而,Brun和Selmer算法也是有趣的二维减法算法。 Schratzberger表明,所有这三种算法都受到类似于持续分数的插入和延伸的过程中的深度相关。在本说明,探讨了两种地图两种混合物的基本ergodic属性。此外,对一个相当不同的地图进行了次数,它呈现出“异国情调”不变措施。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号