The Dehn function of \(\text{SL}(n;\mathbb Z)\). (Q1955948): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963948855 / rank
 
Normal rank

Revision as of 00:30, 20 March 2024

scientific article
Language Label Description Also known as
English
The Dehn function of \(\text{SL}(n;\mathbb Z)\).
scientific article

    Statements

    The Dehn function of \(\text{SL}(n;\mathbb Z)\). (English)
    0 references
    0 references
    19 June 2013
    0 references
    The Dehn function of a group equipped with a generating set is a geometric invariant that measures the difficulty in reducing a word written in the generators that represents the identity to the trivial word. In the paper under review, the author proves that for \(n\geq 5\), the Dehn function of \(\mathrm{SL}(n,\mathbb Z)\) is quadratic. Thurston conjectured that this holds for all \(n\geq 4\). The result for \(n=4\) is still open. The proof reduces the probem of filling of words in \(\mathrm{SL}(n,\mathbb Z)\) to the problem of filling curves in the symmetric space \(\mathrm{SL}(n,\mathbb R)/\mathrm{SO}(n)\). The author's proof involves then the decomposition of a disk in \(\mathrm{SL}(n,\mathbb R)/\mathrm{SO}(n)\) into triangles of varying sizes. By mapping these triangles into \(\mathrm{SL}(n,\mathbb Z)\) and replacing large elementary matrices by ``shortcuts'', the author obtains words of a particular form and he uses combinatorial techniques to fill in these loops. In particular, the arguments involve the question of filling in words in parabolic subgroups of the group.
    0 references
    quadratic Dehn functions
    0 references
    filling inequalities
    0 references
    special linear groups
    0 references
    word problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references