pith. sign in

arxiv: 0903.2495 · v1 · submitted 2009-03-13 · 🧮 math.GR

A polynomial isoperimetric inequality for SL(n,Z)

classification 🧮 math.GR
keywords loopscombinatorialdecomposingdehndiscelementaryfillform
0
0 comments X
read the original abstract

We prove that when n>=5, the Dehn function of SL(n,Z) is at most quartic. The proof involves decomposing a disc in SL(n,R)/SO(n) into a quadratic number of loops in generalized Siegel sets. By mapping these loops into SL(n,Z) and replacing large elementary matrices by "shortcuts," we obtain words of a particular form, and we use combinatorial techniques to fill these loops.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.