Short words of infinite order

Given an infinite linear group with a finite set of generators, we show that the shortest word length of an element of infinite order has an upper bound that depends only on the number of generators and the degree. This provides a quantification of the Burnside problem for linear groups. In degree two, an explicit bound is computed using an exceptional connection to reflection groups.