
2 MARKUS PERLING
coincide (Theorem 7.11). The boundary points are quadratic as well and their explicit formulas and
periodic continued fraction expansions are computed in Secton 7.
We point out that the quotients rg/g have shown up in earlier work as the slopes of exceptional vector
bundles on P2, see [Rud89], [DL85], and their fractal nature has already been observed in [DL85].
Overview. In Section 2 we fix some general conventions regarding the Markoff tree that we will follow
for the rest of these notes. In Section 3, we collect all fundamental facts and computations related to
Markoff triples that will be needed in the subsequent sections. This includes some well-known formulas,
but also some new formulas for which we could not find any reference in the literature. Also, we review
Frobenius’ results on continued fractions related to Markoff triples. In Section 4 we use the results of
Section 3 to analyze the Cantor set that emerges from the quotients rg/g. In Section 5, we introduce
T-weights and perform some calculations similar as in Section 3. In Section 6, we analyze the continued
fraction expansions of T-singularities. We then apply these results in the final Section 7 in order to
classify the minimal resolutions for T-singularities associated to the Markoff equation and to describe
the Cantor set that emerges from the quotients wg/g.
In Appendix A we collect some basic facts about continued fractions and continuants that we will need
throughout the text. In Appendix B we introduce a new class of polynomials related to T-singularities.
These are not needed in the main body of these notes, but they may be of independent interest. In
Appendix C, we collect some material that we need in order to deal with the Hausdorff dimension. In
Appendix D, we display the first few levels of the Markoff tree, both only the maximal elements and the
triples. We found it quite useful to be able to occasionally pinpoint a specific example and its location
in the tree in one peek. Appendix E has a computer generated list of the first 300 Markoff numbers
together with their weights and T-weights. If needed, the table can be extracted from this documents
L
A
T
E
X source. In Appendix F we present some simplistic numerical experiments regarding the growth of
Markoff numbers and the uniqueness conjecture.
2. The Markoff Tree
In this section we will state some general facts and fix our general conventions regarding the Markoff
tree (we refer to [Aig13] for an overview). We are exclusively interested in positive integral solutions
(e, f, g) of the Markoff equation e2+f2+g2= 3efg, which we will call Markoff triples. If for any given
Markoff triple (e, f, g) we denote E= 3fg −e,F= 3eg −f, and G= 3ef −g, then we obtain three
more Markoff triples (E, f, g), (e, F, g), and (e, f, G). We call these substitutions mutations of the triple
(e, f, g). By rearranging the formulas 3eg =f+F, 3fg =e+E, and 3ef =g+G, it becomes obvious that
mutations are reversible. All Markoff triples can be obtained by mutation, starting from the fundamental
solution (1,1,1). So we can consider the set of all Markoff triples as vertices of a trivalent acyclic graph
whose edges are labeled by the mutations, where the fundamental solution is the natural root. By the
symmetry of the Markoff equation, we have a natural action of the symmetric group S3on the set of
Markoff triples. This action has an almost everywhere trivial stabilizer with exceptions (1,1,1) and the
permutations of (1,2,1). These triples, which are the only ones where e, f, g are not pairwise distinct,
are called singular solutions of the Markoff equation. All other Markoff triples are called regular. The
set of regular Markoff triples up to permutation forms a binary tree, whose root is represented by the
triple (1,5,2). Figure 1 shows the first few levels of this tree. As in Figure 1, we will use from now on
(1,5,2)
(1,13,5)
(1,34,13)
(1,89,34) (34,1325,13)
(13,194,5)
(13,7561,194) (194,2897,5)
(5,29,2)
(5,433,29)
(5,6466,433) (433,37666,29)
(29,169,2)
(29,14701,169) (169,985,2)
Figure 1. A part of the Markoff tree.
the convention that every regular Markoff triple will be represented by (e, g, f), such that 0 < e, f < g.
Because g < E, F , mutation of eor fdoes mean that we descend downwards the Markoff tree, where we