Transformation groups of run-length decoding automata for Kolakoski-like sequences are subgroups of binary tree automorphisms with recursive structure, allowing exact count of maximal-length orbits when the iteration depth is odd.
Notes on the Kolakoski sequence
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Group Theory of the Kolakoski Sequence
Transformation groups of run-length decoding automata for Kolakoski-like sequences are subgroups of binary tree automorphisms with recursive structure, allowing exact count of maximal-length orbits when the iteration depth is odd.