Words have bounded width in SL(n,Z)
Abstract
We prove two results about width of words in SLn(Z). The first is that, for every n ≥ 3, there is a constant C(n) such that the width of any word in SLn(Z) is less than C(n). The second result is that, for any word w, if n is big enough, the width of w in SLn(Z) is at most 87.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.