Related papers: Classical homogeneous multidimensional continued f…
The two-dimensional homogeneous Euclidean algorithm is the central motivation for the definition of the classical multidimensional continued fraction algorithms, as Jacobi-Perron, Poincar\'e, Brun and Selmer algorithms. The Rauzy induction,…
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…
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…
Our goal is to show that both the fast and slow versions of the triangle map (a type of multi-dimensional continued fraction algorithm) in dimension $n$ are ergodic, resolving a conjecture of Messaoudi, Noguiera and Schweiger. This…
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 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.…
We consider homogeneous multidimensional continued fraction algorithms, in particular a family of maps which was introduced by F. Schweiger. We prove his conjecture regarding the existence of an absorbing set for those maps. We also…
We describe Gauss-type maps as geometric realizations of certain codes in the monoid of nonnegative matrices in the extended modular group. Each such code, together with an appropriate choice of unimodular intervals in P^1R, determines a…
We give continued fraction algorithms for a particular class of Fuchsian triangle groups. In particular, we give an explicit form of each such group that is a subgroup of the Hilbert modular group of its trace field and provide an interval…
The disadvantage of `traditional' multidimensional continued fraction algorithms is that it is not known whether they provide simultaneous rational approximations for generic vectors. Following ideas of Dani, Lagarias and Kleinbock-Margulis…
We propose and study a generalized continued fraction algorithm that can be executed in an arbitrary imaginary quadratic field, the novelty being a non-restriction to the five Euclidean cases. Many hallmark properties of classical continued…
The theory of ergodic optimization for distance-expanding maps is extended to Gauss's continued fraction map. Since the set of invariant probability measures is not weak$^*$ closed, we establish a characterisation of the closure of this…
We compare two families of continued fractions algorithms, the symmetrized Rosen algorithm and the Veech algorithm. Each of these algorithms expands real numbers in terms of certain algebraic integers. We give explicit models of the natural…
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.…
In this paper, we apply results on number systems based on continued fraction expansions to modular arithmetic. We provide two new algorithms in order to compute modular multiplication and modular division. The presented algorithms are…
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.
In 2008, Dan Romik studied in this journal Primitive Pythagorean Triples, or PPTs. In order to do so, he introduced a modified slow (subtractive) Euclidean algorithm, and showed that the underlying dynamical system of this Euclidean…
We extend the Series' connection between the modular surface $\mathcal{M}=\operatorname{PSL}(2,\mathbb{Z})\backslash\mathbb{H}$, cutting sequences, and regular continued fractions to the slow converging Lehner and Farey continued fractions…
We describe geometric algorithms that generalize the classical continued fraction algorithm for the torus to all translation surfaces in hyperelliptic components of translation surfaces. We show that these algorithms produce all saddle…
We prove the convergence and ergodicity of a wide class of real and higher-dimensional continued fraction algorithms, including folded and $\alpha$-type variants of complex, quaternionic, octonionic, and Heisenberg continued fractions,…