Contents
- Character variety
- Norms and counting
- Proof of Aigner
- Proof by snakes (optional)
- Non convexity (optional
Character variety
H. Cohn, Approach to Markov’s Minimal Forms Through Modular Functions (1955)
- modular torus = quotient of upper half plane H by Γ = commutator subgroup of PSL(2,Z), acting by Mobius transformations
- relates Markoff numbers to lengths of simple closed geodesics
Back to the Torus
- Z2 acting on R2 by translation
- quotient space (orbit space) is a euclidean torus
- primitive elements (p,q)∈Z2
- → closed curve on torus = (p,q) curve
- (usual) length =‖(p,q)‖=√p2+q2
Usual Torus

Torus
- Z2 acts by translation in lots of different ways
- translation lengths of (1,0),(0,1),(1,−1) determine (up to conjugation)
- the representation Z2→isom(R2)
- length of (p,q) curve given by quadratic form
representation Z2→isom(R2)

representation Z2→isom(R2)
.png)
Threes, triangles, tori
- 3 side lengths determine a triangle
- need 3 numbers to build a euclidean torus
- what about the 3 Markoff numbers ?
- can build a hyperbolic punctured torus
- no simple formula for length of (p,q) curve
- modular torus = quotient of upper half plane H by Γ = commutator subgroup of PSL(2,Z), acting by Mobius transformations
- hyperbolic torus = quotient of upper half plane H by Γ=ρ(Z∗Z),
- ρ:Z∗Z→PSL(2,R) discrete faithful
Flat torus

Punctured torus

ρ:Z∗Z→PSL(2,R)
- lifts to ˆρ:Z∗Z→SL(2,R)
- character map χ:ρ↦(trˆρ(a),trˆρ(b),trˆρ(ab))
- a,b generators of the free group = fundamental group of the torus.
Traces behave "like squares of translation lengths"
- parallogram law
- b∈SL(2,C),b2−(trb)b+I2=0
- (Cayley-Hamilton) ⇒
- trab+trab−1=(tra)(trb)
Markoff cubic from the puncture
Loop round the puncture aba−1b−1
- isn't trivial but it's special (parabolic)
- corresponding matrix something like
- (±160±1)
puncture condition
trˆρ(aba−1b−1)=−2
- (x,y,z)=(trˆρ(a),trˆρ(b),trˆρ(ab))
- x2+y2+z2−xyz=2+trˆρ(aba−1b−1)=0.
- = Markoff cubic up to a change of variable
"inverse" character map
Section: character variety to representation variety
(x−110) (0η−η−1y)
z=trace of product=η+η−1
Cohn shows that the permutations and the Vieta flips used to construct Markov's binary tree are induced by automorphisms of the fundamental group of the torus.
Exo
- Nielsen move (a,b,ab)↦(a,b−1,ab−1)
- trab+trab−1=(tra)(trb)
Counting problem
N(t)= number of Markoff numbers ≤t
Counting closed simple geodesics
- character map χ:ρ↦(trˆρ(a),trˆρ(b),trˆρ(ab))
- a,b generators fundamental group of the torus.
- a generator iff ∃ essential simple closed curves representing its conjugacy class
Simple representatives

Simple representatives in homology
ϕ:Z∗Z→Z2≃H1(T,Z) abelianizing homomorphism.
- generators ∈Z∗Z ↦ primitive ∈Z2.
- (p,q)∈Z2 primitive ⇔p,q coprime.
La norme
Let c be an essential closed curve ℓc its length.
γ∈H1(T,Z),‖γ‖:=infc∈γℓc/2
- convexity/triangle inequality
- any pair of curves in linearly independent homology classes intersect
- a curve with self intersections is never a minimizer
more formally from our paper

Unit ball

Corollary
The length function does not coincide with any reasonable function
- not differentiable at rational slopes
- is well approximated by piecewise linear
Unit ball and counting
- ♯{γ,‖γ‖≤t}∼area unit ball×t2
- ♯{γ primitive,‖γ‖≤t}∼6π2area unit ball×t2
- the area of the unit ball depends on the hyperbolic structure
- with Rivin we studied it, but now it's called the Mirzakhani function :(
- 6π2 = proba 2 random integers coprime
Why log ?
N(t)=C(log3))2+O(logt)
- mp/q=13trˆρ(γp/q)
- =23cosh(ℓγp2)
- =23cosh(‖(q,p)‖s)
Aigner's conjectures

Aigner's conjectures
Let p,q be real non negative numbers and i>0 then
- ‖(q,p)‖s<‖(q+i,p)‖s
- ‖(q,p)‖s<‖(q,p+i)‖s
- If in addition p<q then ‖(q,p)‖s<‖(q+i,p−i)‖s
Aigners conjectures proof
