8 problems
Triangle algorithm invariant-domain conjecture. The invariant domain for the Triangle algorithm in dimension is nonconvex and fractal. For the associated win-lose induction,…
Fractal invariant domain conjecture. The natural invariant domain for this algorithm possesses a fractal structure, in contrast to the simplex domains arising in the classical Tria…
Almost-everywhere entry conjecture. For Lebesgue-almost every point in , the region can be reached after finitely many iterations of the TRIP…
Hidden structure conjecture. The TRIP maps that have hidden structure are precisely the maps
Full-measure conjecture. There is a subset of of full Lebesgue measure on which condition (I') or condition (II') is satisfied.
Let range over the positive integers, and consider the Jacobi–Perron algorithm (JPA) expansion of … A positive integer is called eventually periodic when this expansion is…
Let , and let be the Poincaré multidimensional algorithm defined by … where…
Finite-family Hermite matrix conjecture. There is a family of multidimensional continued fractions spanned by finitely many multidimensional continued fraction algorithms such that