Functional analysis behind a Family of Multidimensional Continued Fractions: Part II
Ilya Amburg, Thomas Garrity
备注：
To appear in Publicationes Mathematicae Debrecen. This is the second half of the earlier arXiv:1703.01589, which has been split into two under the recommendation of the journal. This also includes eleven pages of tables of formulas that will not be in the published version
This paper is a direct continuation of "Functional analysis behind a Family of Multidimensional Continued Fractions: Part I," in which we started the exploration of the functional analysis behind the transfer operators for triangle partition maps, a family that includes many, if not most, well-known multidimensional continued fraction algorithms. This allows us now to find eigenfunctions of eigenvalue 1 for transfer operators associated with select triangle partition maps on specified Banach spaces. We proceed to prove that the transfer operators, viewed as acting on one-dimensional families of Hilbert spaces, associated with select triangle partition maps are nuclear of trace class zero. We finish by deriving Gauss-Kuzmin distributions associated with select triangle partition maps.
We study the strong convergence of certain multidimensional continued fraction algorithms. In particular, in the two-dimensional case, we prove that the second Lyapunov exponent of Selmer's algorithm is negative and bound it away from zero. Moreover, we give heuristic results on several other continued fraction algorithms. Our results indicate that all classical multidimensional continued fraction algorithms cease to be strongly convergent for high dimensions. The only exception seems to be the Arnoux-Rauzy algorithm which, however, is defined only on a set of measure zero.
In the current paper we prove simplicity for the spectrum of Lyapunov exponents for triangle sequence and Selmer algorithm in dimension 3. We introduce a strategy that can be applied for a wide class of Markovian MCF.
Triangle partition maps form a family that includes many, if not most, well-known multidimensional continued fraction algorithms. This paper begins the exploration of the functional analysis behind the transfer operator of each of these maps. We show that triangle partition maps give rise to two classes of transfer operators and present theorems regarding the origin of these classes; we also present related theorems on the form of transfer operators arising from compositions of triangle partition maps. In the next paper, Part II, we will find eigenfunctions of eigenvalue 1 for transfer operato…
F.~Schweiger introduced the fibred system in \cite{Schweiger-MCF}, to unify and generalize many known continued fraction algorithms. An advantage of a fibred system is that it often provides a systematic construction of absolutely continuous invariant density. In this paper, we define and study the self-duality of fibred systems, a strong symmetry of a given system. We show that explicit algebraic self-duality holds in many systems and presents a curious system with "partial" self-duality.
Following Schweiger's generalization of multidimensional continued fraction algorithms, we consider a very large family of $p$-adic multidimensional continued fraction algorithms, which include Schneider's algorithm, Ruban's algorithms, and the $p$-adic Jacobi-Perron algorithm as special cases. The main result is to show that all the transformations in the family are ergodic with respect to the Haar measure.
We compute explicitly the density of the invariant measure for the Reverse algorithm which is absolutely continuous with respect to Lebesgue measure, using a method proposed by Arnoux and Nogueira. We also apply the same method on the unsorted version of Brun algorithm and Cassaigne algorithm. We illustrate some experimentations on the domain of the natural extension of those algorithms. For some other algorithms, which are known to have a unique invariant measure absolutely continuous with respect to Lebesgue measure, the invariant domain found by this method seems to have a fractal boundary,…
It has been a long standing problem to find good symbolic codings for translations on the $d$-dimensional torus that enjoy the beautiful properties of Sturmian sequences like low factor complexity and good local discrepancy properties. Inspired by Rauzy's approach we construct such codings in terms of multidimensional continued fraction algorithms that are realized by sequences of substitutions. In particular, given any exponentially convergent continued fraction algorithm, these sequences lead to renormalization schemes which produce symbolic codings of toral translations and bounded remainde…
How many points contain homothetic copies in their Hurwitz continued fraction expansion?
Faculty of Science and Engineering, Doshisha University（立命馆大学理工学部）；Keio Institute of Pure and Applied Sciences (KiPAS), Department of Mathematics, Keio University（庆应义塾大学纯理应用科学研究所（KiPAS）数学系）
We propose a new point of view on multidimensional continued fraction algorithms inspired by Rauzy induction. The generic behaviour of such an algorithm is described here as a random walk on a graph that we call simplicial system. These systems provide a family of examples for random walks with memory recorded by a finite dimensional vector. We introduce a general criterion on these graphs that induces ergodicity together with a bundle of many other dynamical properties. In particular, after computing the representation of Brun, Selmer and Arnoux-Rauzy-Poincare algorithm in this formalism, it …
In this notes we show how a problem regarding continued fractions of rational numbers, lead to several phenomena in number theory and dynamics, and eventually to the problem of shearing of divergent diagonal orbits in the space of adelic lattices. Finding these ideas quite interesting, the first half of these notes is about explaining theses ideas, the intuition and motivation behind them, and the second contains the details and proofs.
