Abstract:
We present a practical algorithm which, given a non-archimedean local field K and any two elements A,B∈SL2(K), determines after finitely many steps whether or not the subgroup 〈A,B〉≤SL2(K) is discrete and free of rank two. This makes use of the Ping Pong Lemma applied to the action of SL2(K) by isometries on its Bruhat-Tits tree. The algorithm itself can also be used for two-generated subgroups of the isometry group of any locally finite simplicial tree, and has applications to the constructive membership problem. In an appendix joint with Frédéric Paulin, we give an erratum to his 1989 paper ‘The Gromov topology on R-trees’, which details some translation length formulae that are fundamental to the algorithm.
