Several questions of Longstaff on generation in matrix algebras

Authors

  • Yaroslav Shitov Higher School of Economics (Moscow)

Abstract

W esolve three problems raised in recent articles of W. E. Longstaff in Bulletin of the Australian Math. Society. We show that (1) the length of an irreducible family of n × n rank-one matrices can take any value in 1, 2, . . . , n, (2) the slot length of an irreducible pair of n×n matrices can equal 2n−3, and we give (3) bounds on the 1-minimum spanning lengths of irreducible pairs.

Published

2026-10-14

Issue

Section

Articles