In this talk we link discrete Markov spectrum to geometry of continued fractions. As a result of that we get a natural generalization of classical Markov tree which leads to an efficient computation of Markov minima for all elements in generalized Markov trees.
This website stores cookies on your computer. These cookies are used to collect information about how you interact with our website and allow us to remember you. We use this information in order to improve and customize your browsing experience and for analytics and metrics about our visitors both on this website and other media.