Skip to content

Combing Euclidean buildings

Gennady A. Noskov

math.GRarXiv:math/0001186

Abstract

For an arbitrary Euclidean building we define a certain combing, which satisfies the `fellow traveller property' and admits a recursive definition. Using this combing we prove that any group acting freely, cocompactly and by order preserving automorphisms on a Euclidean building of one of the types An,Bn,Cn admits a biautomatic structure.

Create a lesson