Words for generalized Markov numbers
Abstract
We construct a word-theoretic framework for generalized Markov numbers, that is, positive integers appearing in positive integer solutions of the generalized Markov equation x2+y2+z2+k1yz+k2zx+k3xy=(3+k1+k2+k3)xyz. For each positive rational slope t, we define a word ωt by a recursive rule on a binary tree and realize it geometrically by a line segment of slope t. Matrix evaluation of ωt gives a Markov--monodromy matrix encoding the generalized Markov number at t. We also show that ωt recovers the classical Cohn word by a local substitution rule, and that the completed word ωt=xyzωt-1 is related to the generalized Cohn matrices.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.