The almost-everywhere entry conjecture for the region U
The almost-everywhere entry conjecture for the region U
Let be the simplex for the TRIP map, and let
Almost-everywhere entry conjecture. For Lebesgue-almost every point in , the region can be reached after finitely many iterations of the TRIP map.
If true, this would extend the reduction to a two-dimensional TRIP map from points initially in to almost every point of the simplex. The source reports computational evidence and leaves the proof to future work.
Sources & referencesView supporting material
Primary source
Thomas Garrity and Otto Vaughn Osterman, “On the Factor Complexity Associated with a Family of Multidimensional Continued Fraction Algorithms”, arXiv:2410.02032 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.