On the lengths of pairs of complex matrices of size six

M.S. Lambrou; William Longstaff

doi:10.1017/S0004972709000112

On the lengths of pairs of complex matrices of size six

M.S. Lambrou
, William Longstaff

Research output: Contribution to journal › Article › peer-review

14 Citations (Scopus)

Abstract

The length of every pair {A,B} of 6×6 complex matrices is shown to be at most 10, that is, the words in A,B of length at most 10, including the empty word, span the unital algebra generated by A,B. This supports the conjecture that the length of every pair of n×n complex matrices is at most 2n−2, known to be true for n

Original language	English
Pages (from-to)	177-201
Journal	Bulletin of the Australian Mathematical Society
Volume	80
Issue number	2
DOIs	https://doi.org/10.1017/S0004972709000112
Publication status	Published - 2009

Access to Document

10.1017/S0004972709000112

Cite this

@article{c410ef4ca51342fcbbd1dfbe63b72381,

title = "On the lengths of pairs of complex matrices of size six",

abstract = "The length of every pair \{A,B\} of 6×6 complex matrices is shown to be at most 10, that is, the words in A,B of length at most 10, including the empty word, span the unital algebra generated by A,B. This supports the conjecture that the length of every pair of n×n complex matrices is at most 2n−2, known to be true for n",

author = "M.S. Lambrou and William Longstaff",

year = "2009",

doi = "10.1017/S0004972709000112",

language = "English",

volume = "80",

pages = "177--201",

journal = "Bulletin of the Australian Mathematical Society",

issn = "0004-9727",

publisher = "Cambridge University Press",

number = "2",

}

TY - JOUR

T1 - On the lengths of pairs of complex matrices of size six

AU - Lambrou, M.S.

AU - Longstaff, William

PY - 2009

Y1 - 2009

N2 - The length of every pair {A,B} of 6×6 complex matrices is shown to be at most 10, that is, the words in A,B of length at most 10, including the empty word, span the unital algebra generated by A,B. This supports the conjecture that the length of every pair of n×n complex matrices is at most 2n−2, known to be true for n

AB - The length of every pair {A,B} of 6×6 complex matrices is shown to be at most 10, that is, the words in A,B of length at most 10, including the empty word, span the unital algebra generated by A,B. This supports the conjecture that the length of every pair of n×n complex matrices is at most 2n−2, known to be true for n

U2 - 10.1017/S0004972709000112

DO - 10.1017/S0004972709000112

M3 - Article

SN - 0004-9727

VL - 80

SP - 177

EP - 201

JO - Bulletin of the Australian Mathematical Society

JF - Bulletin of the Australian Mathematical Society

IS - 2

ER -

On the lengths of pairs of complex matrices of size six

Abstract

Access to Document

Fingerprint

Cite this