2019
DOI: 10.2140/ant.2019.13.1501
|View full text |Cite
|
Sign up to set email alerts
|

An improved bound for the lengths of matrix algebras

Abstract: Let S be a set of n × n matrices over a field F. We show that the F-linear span of the words in S of length at most 2n log 2 n + 4n is the full F-algebra generated by S. This improves on the n 2 /3 + 2/3 bound by Paz (1984) and an O(n 3/2 ) bound of Pappacena (1997).Let S be a subset of a finite-dimensional associative algebra A over a field F. An element a ∈ A is said to be a word of length k in S if there are a 1 , . . . , a k ∈ S such that a = a 1 . . . a k . We denote the set of all such words by S k , and… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
18
0
1

Year Published

2019
2019
2023
2023

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 32 publications
(19 citation statements)
references
References 12 publications
0
18
0
1
Order By: Relevance
“…It is clear that the choice of k = n 2 works. If we believe the Paz conjecture [9], one could take k = 2n − 2, although the best known bounds, obtained very recently by Shitov in [10], give that we can choose k = 2n log 2 n + 4n, improving the best previously known bounds by Pappacena [8]. All such methods necessitate a slowdown required to evalute such an exponentiation.…”
Section: Proof Sincementioning
confidence: 99%
“…It is clear that the choice of k = n 2 works. If we believe the Paz conjecture [9], one could take k = 2n − 2, although the best known bounds, obtained very recently by Shitov in [10], give that we can choose k = 2n log 2 n + 4n, improving the best previously known bounds by Pappacena [8]. All such methods necessitate a slowdown required to evalute such an exponentiation.…”
Section: Proof Sincementioning
confidence: 99%
“…Throughout this section we work under the assumption that dim L j = D 2 for j large enough. We start with a general lemma taken from [Shi18].…”
Section: Quantum Version Of Wielandt's Inequalitymentioning
confidence: 99%
“…He was able to prove an upper bound of D 2 /3+2/3, which was later improved to O D 1.5 by Pappacena [Pap97]. The latest best known bound is O(D log D) by the second author [Shi18]. The 2D − 2 conjecture is known to hold if L contains a non-derogatory matrix [GLMŠ18] and for D 5 (see [Shi18]).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…, T g . By[Shi+, Theorem 3], A is generated by polynomials in T of degree 2N log 2 N + 4N − 4. Therefore there exists f ∈ <x> of degree at most2N log 2 N + 4N − 4 such that f ℓ = ∆ ℓ Y f = ∆ ℓ Y f for ℓ ≤ L.Remark6.14.…”
mentioning
confidence: 99%