- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- A graph-theoretic approach to a conjecture of Dixon...
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
A graph-theoretic approach to a conjecture of Dixon and Pressman Brassil, Matthew
Abstract
Given n×n matrices, A_1,...,A_k, define the linear operator L(A_1,...,A_k): Mat_n -> Mat_n by L(A_1,...,A_k)(A_(k+1)) = sum_sigma sgn(sigma) sgn(sigma)A_sigma(1)A_sigma(2)...A_sigma(k+1). The Amitsur-Levitzki theorem asserts that L(A_1,...,A_k) is identically 0 for every k > 2n − 1. Dixon and Pressman conjectured that if 2
Item Metadata
| Title |
A graph-theoretic approach to a conjecture of Dixon and Pressman
|
| Creator | |
| Publisher |
University of British Columbia
|
| Date Issued |
2020
|
| Description |
Given n×n matrices, A_1,...,A_k, define the linear operator L(A_1,...,A_k): Mat_n -> Mat_n by L(A_1,...,A_k)(A_(k+1)) = sum_sigma sgn(sigma) sgn(sigma)A_sigma(1)A_sigma(2)...A_sigma(k+1). The Amitsur-Levitzki theorem asserts that L(A_1,...,A_k) is identically 0 for every k > 2n − 1. Dixon and Pressman
conjectured that if 2
|
| Genre | |
| Type | |
| Language |
eng
|
| Date Available |
2020-08-31
|
| Provider |
Vancouver : University of British Columbia Library
|
| Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
| DOI |
10.14288/1.0394102
|
| URI | |
| Degree (Theses) | |
| Program (Theses) | |
| Affiliation | |
| Degree Grantor |
University of British Columbia
|
| Graduation Date |
2020-11
|
| Campus | |
| Scholarly Level |
Graduate
|
| Rights URI | |
| Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International