We study the complexity of
-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
-adic
sequences corresponding to the triangle map (called the
-TRIP map in this paper)
has upper bound at most
.
Our second main result is to prove an upper bound of
on
complexity for another TRIP map. We discuss a dynamical phenomenon, which we call
“hidden
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
,
except for one remaining case for which we conjecture such an upper bound to hold.
Keywords
S-adic sequences, multidimensional continued fractions