Abstract
We saw in the last chapter that the neighbor relation between Markov triples can be conveniently encoded in an infinite binary tree. All early researchers from Markov onward used this device, but went only a little beyond it. In the 1950s, however, there was a major new development regarding Markov numbers and the uniqueness problem when Harvey Cohn noticed that a wellknown identity involving traces of integral \(2 \times 2\) matrices looks very much like Markov’s equation. His discovery initiated a completely new approach to the Markov theme, with amazingly simple proofs of some further uniqueness results. In this chapter, we work out the precise relationship between Markov numbers and matrices and move on to a deeper study of the algebraic structure of the group generated by these matrices in the next part.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Aigner, M. (2013). The Cohn Tree. In: Markov's Theorem and 100 Years of the Uniqueness Conjecture. Springer, Heidelberg. https://doi.org/10.1007/978-3-319-00888-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-00888-2_4
Published:
Publisher Name: Springer, Heidelberg
Print ISBN: 978-3-319-00887-5
Online ISBN: 978-3-319-00888-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)