Abstract

The well-known Lvov-Kaplansky conjecture states that the image of a multilinear polynomial ff evaluated on n×nn\times n matrices is a vector space. A weaker version of this conjecture, known as the Mesyan conjecture, states that if m=deg(f)m=deg( f) and n≥m−1n\geq m-1 then its image contains the set of trace zero matrices. Such conjecture has been proved for polynomials of degree m≤4m \leq 4. The proof of the case m=4m=4 contains an error in one of the lemmas. In this paper, we correct the proof of such lemma and present some evidences which allow us to state the Mesyan conjecture for the new bound n≥m+12n \geq \frac{m+1}{2}, which cannot be improved.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.