Trimming
Cooper, Daryl ; Long, Darren D.
Experiment. Math., Tome 7 (1998) no. 4, p. 325-332 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We consider the question of deciding whether or not certain subgroups of certain cocompact Kleinian groups are geometrically finite or infinite. This is reduced to a question about similarity interval exchange maps. The concept of trimming produces an practical algorithm to settle the latter question. This algorithm has been implemented on a computer and the results are perplexing.
Publié le : 1998-05-14
Classification:  30F40,  57R30 
@article{1047674150,
     author = {Cooper, Daryl and Long, Darren D.},
     title = {Trimming},
     journal = {Experiment. Math.},
     volume = {7},
     number = {4},
     year = {1998},
     pages = { 325-332},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1047674150}
}

Cooper, Daryl; Long, Darren D. Trimming. Experiment. Math., Tome 7 (1998) no. 4, pp.  325-332. http://gdmltest.u-ga.fr/item/1047674150/