Words have bounded width in SL(n,mathbb{Z})
classification
🧮 math.GR
keywords
mathbbwidthwordwordsboundedconstantenoughevery
read the original abstract
We prove two results about width of words in $SL_n(\mathbb{Z})$. The first is that, for every $n \geq 3$, there is a constant $C(n)$ such that the width of any word in $SL_n(\mathbb{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 $SL_n(\mathbb{Z})$ is at most 87.
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.