相关论文: On the second Lyapunov exponent of some multidimen…
Homogeneous continued fraction algorithms are multidimensional generalizations of the classical Euclidean algorithm, the dissipative map $$ (x_1,x_2) \in \mathbb{R}_+^2 \longmapsto \left\{\begin{array}{ll} (x_1 - x_2, x_2), & \mbox{if $x_1…
A Lagrange Theorem in dimension 2 is proved, for a particular two-dimensional algorithm, with a very natural geometrical definition. Dirichlet-type properties for the convergence of the algorithm are also proved. These properties procced…
We first survey the current state of the art concerning the dynamical properties of multidimensional continued fraction algorithms defined dynamically as piecewise fractional maps and compare them with algorithms based on lattice reduction.…
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.…
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…
We prove the existence of a ternary sequence of factor complexity $2n+1$ for any given vector of rationally independent letter frequencies. Such sequences are constructed from an infinite product of two substitutions according to a…
Multidimensional Continued Fraction Algorithms are generalizations of the Euclid algorithm and find iteratively the gcd of two or more numbers. They are defined as linear applications on some subcone of $\mathbb{R}^d$. We consider…
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.
We give a new class of multidimensional $p$-adic continued fraction algorithms. We propose an algorithm in the class for which we can expect that multidimensional $p$-adic version of Lagrange's Theorem holds.
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…
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…
We show that the weak convergence of the Douglas--Rachford algorithm for finding a zero of the sum of two maximally monotone operators cannot be improved to strong convergence. Likewise, we show that strong convergence can fail for the…
We prove a suite of dynamical results, including exactness of the transformation and piecewise-analyticity of the invariant measure, for a family of continued fraction systems, including specific examples over reals, complex numbers,…
We statistically compare the relationships between frequencies of digits in continued fraction expansions of typical rational points in the unit interval and higher dimensional generalisations. This takes the form of a Large Deviation and…
Lyapunov-Schmidt reduction is a dimensionality reduction technique in nonlinear systems analysis that is commonly utilised in the study of bifurcation problems in high-dimensional systems. The method is a systematic procedure for reducing…
Classical results on Diophantine approximation, such as Roth's theorem, provide the most effective techniques for proving the transcendence of special kinds of continued fractions. Multidimensional continued fractions are a generalization…
We establish the (level-1) large deviation principles for three kinds of means associated with the backward continued fraction expansion. We show that: for the harmonic and geometric means, the rate functions vanish exactly at one point;…
By using a jump transformation associated to the Romik map, we define a new continued fraction algorithm called odd-odd continued fraction, whose principal convergents are rational numbers of odd denominators and odd numerators. Among…
Multidimensional continued fractions generalize classical continued fractions with the aim of providing periodic representations of algebraic irrationalities by means of integer sequences. However, there does not exist any algorithm that…
We show that linear analytic cocycles where all Lyapunov exponents are negative infinite are nilpotent. For such one-frequency cocycles we show that they can be analytically conjugated to an upper triangular cocycle or a Jordan normal form.…