A Generalization of Markov Numbers
Abstract
We explore a generalization of the Markov numbers that is motivated by a specific generalized cluster algebra arising from an orbifold, in the sense of Chekhov and Shapiro. We give an explicit algorithm for computing these generalized Markov numbers and exhibit several patterns analogous to those that appear within the ordinary Markov numbers. Along the way, we present formulas related to continued fractions and snake graphs.
0
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.