Download this article
 Download this article For screen
For printing
Recent Issues
Volume 15, Issue 4
Volume 15, Issue 3
Volume 15, Issue 2
Volume 15, Issue 1
Volume 14, Issue 3-4
Volume 14, Issue 2
Volume 14, Issue 1
Volume 13, Issue 4
Volume 13, Issue 3
Volume 13, Issue 2
Volume 13, Issue 1
Volume 12, Issue 4
Volume 12, Issue 3
Volume 12, Issue 2
Volume 12, Issue 1
Volume 11, Issue 4
Volume 11, Issue 3
Volume 11, Issue 2
Volume 11, Issue 1
Volume 10, Issue 4
Volume 10, Issue 3
Volume 10, Issue 2
Volume 10, Issue 1
Volume 9, Issue 4
Volume 9, Issue 3
Volume 9, Issue 2
Volume 9, Issue 1
Volume 8, Issue 4
Volume 8, Issue 3
Volume 8, Issue 2
Volume 8, Issue 1
Older Issues
Volume 7, Issue 4
Volume 7, Issue 3
Volume 7, Issue 2
Volume 7, Issue 1
Volume 6, Issue 4
Volume 6, Issue 2-3
Volume 6, Issue 1
Volume 5, Issue 4
Volume 5, Issue 3
Volume 5, Issue 1-2
Volume 4, Issue 4
Volume 4, Issue 3
Volume 4, Issue 2
Volume 4, Issue 1
Volume 3, Issue 3-4
Volume 3, Issue 2
Volume 3, Issue 1
Volume 2, Issue 4
Volume 2, Issue 3
Volume 2, Issue 2
Volume 2, Issue 1
Volume 1, Issue 4
Volume 1, Issue 3
Volume 1, Issue 2
Volume 1, Issue 1
The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
founded and published with the
scientific support and advice of
mathematicians from the
Moscow Institute of
Physics and Technology
Subscriptions
 
ISSN 2996-220X (online)
ISSN 2996-2196 (print)
Author Index
To Appear
 
Other MSP Journals
On the factor complexity associated with a family of multidimensional continued fraction algorithms

Thomas Garrity and Otto Vaughn Osterman

Vol. 15 (2026), No. 4, 239–292
Abstract

We study the complexity of S-adic sequences corresponding to a family of 216 multidimensional continued fractions maps, called triangle partition maps (TRIP maps), with an emphasis on those with low upper bounds on complexity. Our main result is to prove that the complexity of S-adic sequences corresponding to the triangle map (called the (e,e,e)-TRIP map in this paper) has upper bound at most 3n. Our second main result is to prove an upper bound of 2n + 1 on complexity for another TRIP map. We discuss a dynamical phenomenon, which we call “hidden ℝ2 behavior,” that occurs in this map and its relationship to complexity. Combining this with previously known results and a list of counterexamples, we provide a complete list of the TRIP maps which have upper bounds on complexity of at most 3n, except for one remaining case for which we conjecture such an upper bound to hold.

Keywords
S-adic sequences, multidimensional continued fractions
Mathematical Subject Classification
Primary: 37B10
Secondary: 11B85, 11J70, 68R15
Milestones
Received: 30 May 2025
Revised: 29 June 2026
Accepted: 14 July 2026
Published: 13 November 2026
Authors
Thomas Garrity
Department of Mathematics and Statistics
Williams College
Williamstown, MA
United States
Otto Vaughn Osterman
Department of Mathematics
University of Maryland
College Park, MD
United States