2019
DOI: 10.7153/oam-2019-13-18
|View full text |Cite
|
Sign up to set email alerts
|

Images of multilinear polynomials of degree up to four on upper triangular matrices

Abstract: We describe the images of multilinear polynomials of degree up to four on the upper triangular matrix algebra.A famous open problem known as Lvov-Kaplansky's conjecture asserts: the image of a multilinear polynomial in noncommutative variables over a field K on the matrix algebra M n (K) is always a vector space [4].Recently, Kanel-Belov, Malev and Rowen [7] made a major breakthrough and solved the problem for n = 2.A special case on polynomials of degree two has been known for long time ([9] and [1]). Recent… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
17
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 21 publications
(17 citation statements)
references
References 9 publications
(19 reference statements)
0
17
0
Order By: Relevance
“…A general result in the direction was given in [3], where the author proves the conjecture for polynomials of arbitrary degree evaluated on strictly upper triangular matrices.…”
Section: Thiago Castilho De Mellomentioning
confidence: 99%
See 3 more Smart Citations
“…A general result in the direction was given in [3], where the author proves the conjecture for polynomials of arbitrary degree evaluated on strictly upper triangular matrices.…”
Section: Thiago Castilho De Mellomentioning
confidence: 99%
“…We remark that in the papers [3], [4] J k was denoted by U T (k−1) n . This is the set of matrices whose entries (i, j) are zero if i ≥ j + k, for k ≥ 1.…”
Section: Thiago Castilho De Mellomentioning
confidence: 99%
See 2 more Smart Citations
“…In particular, Im p is a vector space. In [40] Fagundes and de Mello describe the images of multilinear polynomials of degree ≤ 4 on the upper triangular matrices.…”
Section: Introductionmentioning
confidence: 99%