An improved bound for the length of matrix algebras

Abstract

Let $S$ be a set of $n\times n$ matrices over a field $\mathbb{F}$. We show that the $\mathbb{F}$-linear span of the words in $S$ of length at most $$2n{\log }_{2}n+4n$$ is the full $\mathbb{F}$-algebra generated by $S$. This improves on the $n^2/3+2/3$ bound by Paz (1984) and an $O\left(n^{1.5}\right)$ bound of Pappacena (1997).

6 pages

Cited by in corpus (9)

• Algorithms for orbit closure separation for invariants and semi-invariants of matrices
• The minimal canonical form of a tensor network
• Local theory of free noncommutative functions: germs, meromorphic functions and Hermite interpolation
• The geometric classification of nilpotent algebras
• Quantum version of Wielandt's Inequality revisited
• A generic quantum Wielandt's inequality
• A sum-bracket theorem for simple Lie algebras
• An elementary method to compute the algebra generated by some given matrices and its dimension
• Comment on "Generators of matrix algebras in dimension 2 and 3"