Volume 4, issue 1 (2000)

Download this article
For printing
Recent Issues

Volume 21
Issue 6, 3191–3810
Issue 5, 2557–3190
Issue 4, 1931–2555
Issue 3, 1285–1930
Issue 2, 647–1283
Issue 1, 1–645

Volume 20, 6 issues

Volume 19, 6 issues

Volume 18, 5 issues

Volume 17, 5 issues

Volume 16, 4 issues

Volume 15, 4 issues

Volume 14, 5 issues

Volume 13, 5 issues

Volume 12, 5 issues

Volume 11, 4 issues

Volume 10, 4 issues

Volume 9, 4 issues

Volume 8, 3 issues

Volume 7, 2 issues

Volume 6, 2 issues

Volume 5, 2 issues

Volume 4, 1 issue

Volume 3, 1 issue

Volume 2, 1 issue

Volume 1, 1 issue

The Journal
About the Journal
Subscriptions
Editorial Board
Editorial Interests
Editorial Procedure
Submission Guidelines
Submission Page
Author Index
To Appear
ISSN (electronic): 1364-0380
ISSN (print): 1465-3060
Combing Euclidean buildings

Gennady A Noskov

Geometry & Topology 4 (2000) 85–116

arXiv: math.GR/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.

Keywords
Euclidean building, automatic group, combing
Mathematical Subject Classification 2000
Primary: 20F32
Secondary: 20F10
References
Forward citations
Publication
Received: 9 February 1999
Revised: 10 November 1999
Accepted: 13 January 1999
Published: 28 January 2000
Proposed: Walter Neumann
Seconded: Joan Birman, Wolfgang Metzler
Authors
Gennady A Noskov
IITAM SORAN
Pevtsova 13
Omsk 644099
Russia