William Ellison Longstaff
Research Subjects
Research Interests
William Ellison Longstaff has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
Oreste Panaia
4 shared publicationsM. S. Lambrou
3 shared publicationsM.S. Lambrou
2 shared publications- Oreste Panaia
School of Mathematics and Statistics, The University of Western Australia, 35 Stirling Highway, Crawley WA 6009, Australia
2 shared publications P.A. Fillmore
2 shared publicationsPeter Rosenthal
University of Western Australia
2 shared publications
Latest Publications
- 6 February 2026
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 113 (3) , 455-466
MINIMALLY IRREDUCIBLE FAMILIES OF COMPLEX MATRICES
A family of n times n $n\times n$ matrices over a field double struck upper F $\mathbb {F}$ is irreducible if it has no common nontrivial invariant subspace, and minimally irreducible if it is irreducible but has no proper irreducible subfamily. If double struck upper F $\mathbb {F}$ is algebraically closed and n greater than or equals 2 $n\ge 2$ , a minimally irreducible family has at most 2 n minus 1 $2n-1$ elements. We show that for complex n times n $n\times n$ matrices, n greater than or equals 3 $n\ge 3$ , a family of minimally irreducible (i) matrix units, (ii) rank one projections, (iii) unicellular matrices and (iv) orthoatomic matrices has k elements where respectively (i) n less than or equals k less than or equals 2 n minus 2 $n\le k\le 2n-2$ , (ii) k equals n $k=n$ , (iii) 2 less than or equals k less than or equals n minus 1 $2\le k\le n-1$ and (iv) 2 less than or equals k less than or equals n minus 1 $2\le k\le n-1$ . All of the values of k in these ranges are attained. If n equals 2 $n=2$ , each such minimally irreducible family has 2 $2$ elements.- 6 February 2026
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 113 (3) , 455-466
MINIMALLY IRREDUCIBLE FAMILIES OF COMPLEX MATRICES
A family of n times n $n\times n$ matrices over a field double struck upper F $\mathbb {F}$ is irreducible if it has no common nontrivial invariant subspace, and minimally irreducible if it is irreducible but has no proper irreducible subfamily. If double struck upper F $\mathbb {F}$ is algebraically closed and n greater than or equals 2 $n\ge 2$ , a minimally irreducible family has at most 2 n minus 1 $2n-1$ elements. We show that for complex n times n $n\times n$ matrices, n greater than or equals 3 $n\ge 3$ , a family of minimally irreducible (i) matrix units, (ii) rank one projections, (iii) unicellular matrices and (iv) orthoatomic matrices has k elements where respectively (i) n less than or equals k less than or equals 2 n minus 2 $n\le k\le 2n-2$ , (ii) k equals n $k=n$ , (iii) 2 less than or equals k less than or equals n minus 1 $2\le k\le n-1$ and (iv) 2 less than or equals k less than or equals n minus 1 $2\le k\le n-1$ . All of the values of k in these ranges are attained. If n equals 2 $n=2$ , each such minimally irreducible family has 2 $2$ elements.- 16 May 2025
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 112 (3) , 418-429
MONOTONIC COLLATZ SUBSEQUENCES WITH TERMS CONGRUENT MODULO A FIXED POWER OF TWO
A class of sequences called L-sequences is introduced, each one being a subsequence of a Collatz sequence. Every ordered pair $(v,w)$ of positive integers determines an odd positive integer P such that there exists an L-sequence of length n for every positive integer n , each term of which is congruent to P modulo $2^{v+w+1}$ . The smallest possible initial term of such a sequence is described. If $3^v>2^{v+w}$ the L-sequence is increasing. Otherwise, it is decreasing, except if it is the constant sequence P . A central role is played by Bezout’s identity.- 16 May 2025
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 112 (3) , 418-429
MONOTONIC COLLATZ SUBSEQUENCES WITH TERMS CONGRUENT MODULO A FIXED POWER OF TWO
A class of sequences called L-sequences is introduced, each one being a subsequence of a Collatz sequence. Every ordered pair $(v,w)$ of positive integers determines an odd positive integer P such that there exists an L-sequence of length n for every positive integer n , each term of which is congruent to P modulo $2^{v+w+1}$ . The smallest possible initial term of such a sequence is described. If $3^v>2^{v+w}$ the L-sequence is increasing. Otherwise, it is decreasing, except if it is the constant sequence P . A central role is played by Bezout’s identity.- 20 January 2022
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 106 (1) , 70-82
MINIMALLY TRANSITIVE FAMILIES OF SUBSPACES OF
Every transitive family of subspaces of a vector space of finite dimension $n\ge 2$ over a field $\mathbb {F}$ contains a subfamily which is transitive but has no proper transitive subfamily. Such a subfamily is called minimally transitive. Each has at most $n^2-n+1$ elements. On ${{\mathbb {C}}}^n, n\ge 3$ , a minimally transitive family of subspaces has at least four elements and a minimally transitive family of one-dimensional subspaces has $\tau $ elements where $n+1\le \tau \le 2n-2$ . We show how a minimally transitive family of one-dimensional subspaces arises when it consists of the subspaces spanned by the standard basis vectors together with those spanned by $0$ – $1$ vectors. On a space of dimension four, the set of nontrivial elements of a medial subspace lattice has five elements if it is minimally transitive. On spaces of dimension $12$ or more, the set of nontrivial elements of a medial subspace lattice can have six or more elements and be minimally transitive.- 20 January 2022
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 106 (1) , 70-82
MINIMALLY TRANSITIVE FAMILIES OF SUBSPACES OF
Every transitive family of subspaces of a vector space of finite dimension $n\ge 2$ over a field $\mathbb {F}$ contains a subfamily which is transitive but has no proper transitive subfamily. Such a subfamily is called minimally transitive. Each has at most $n^2-n+1$ elements. On ${{\mathbb {C}}}^n, n\ge 3$ , a minimally transitive family of subspaces has at least four elements and a minimally transitive family of one-dimensional subspaces has $\tau $ elements where $n+1\le \tau \le 2n-2$ . We show how a minimally transitive family of one-dimensional subspaces arises when it consists of the subspaces spanned by the standard basis vectors together with those spanned by $0$ – $1$ vectors. On a space of dimension four, the set of nontrivial elements of a medial subspace lattice has five elements if it is minimally transitive. On spaces of dimension $12$ or more, the set of nontrivial elements of a medial subspace lattice can have six or more elements and be minimally transitive.- 2 December 2020
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 104 (1) , 78-93
-MINIMUM SPANNING LENGTHS AND AN EXTENSION TO BURNSIDE’S THEOREM ON IRREDUCIBILITY
We introduce the $\textbf{h}$ -minimum spanning length of a family ${\mathcal A}$ of $n\times n$ matrices over a field $\mathbb F$ , where $\textbf{h}$ is a p-tuple of positive integers, each no more than n. For an algebraically closed field $\mathbb F$ , Burnside’s theorem on irreducibility is essentially that the $(n,n,\ldots ,n)$ -minimum spanning length of ${\mathcal A}$ exists if ${\mathcal A}$ is irreducible. We show that the $\textbf{h}$ -minimum spanning length of ${\mathcal A}$ exists for every $\textbf{h}=(h_1,h_2,\ldots , h_p)$ if ${\mathcal A}$ is an irreducible family of invertible matrices with at least three elements. The $(1,1, \ldots ,1)$ -minimum spanning length is at most $4n\log _{2} 2n+8n-3$ . Several examples are given, including one giving a complete calculation of the $(p,q)$ -minimum spanning length of the ordered pair $(J^*,J)$ , where J is the Jordan matrix.- 2 December 2020
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 104 (1) , 78-93
-MINIMUM SPANNING LENGTHS AND AN EXTENSION TO BURNSIDE’S THEOREM ON IRREDUCIBILITY
We introduce the $\textbf{h}$ -minimum spanning length of a family ${\mathcal A}$ of $n\times n$ matrices over a field $\mathbb F$ , where $\textbf{h}$ is a p-tuple of positive integers, each no more than n. For an algebraically closed field $\mathbb F$ , Burnside’s theorem on irreducibility is essentially that the $(n,n,\ldots ,n)$ -minimum spanning length of ${\mathcal A}$ exists if ${\mathcal A}$ is irreducible. We show that the $\textbf{h}$ -minimum spanning length of ${\mathcal A}$ exists for every $\textbf{h}=(h_1,h_2,\ldots , h_p)$ if ${\mathcal A}$ is an irreducible family of invertible matrices with at least three elements. The $(1,1, \ldots ,1)$ -minimum spanning length is at most $4n\log _{2} 2n+8n-3$ . Several examples are given, including one giving a complete calculation of the $(p,q)$ -minimum spanning length of the ordered pair $(J^*,J)$ , where J is the Jordan matrix.- 5 October 2020
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 103 (2) , 260-270
THE SLOT LENGTH OF A FAMILY OF MATRICES
We introduce the notion of the slot length of a family of matrices over an arbitrary field . Using this definition it is shown that, if and A and B are complex matrices with A unicellular and the pair irreducible, the slot length s of satisfies , where both inequalities are sharp, for every n. It is conjectured that the slot length of any irreducible pair of matrices, where , is at most . The slot length of a family of rank-one complex matrices can be equal to n.
- 5 October 2020
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 103 (2) , 260-270
THE SLOT LENGTH OF A FAMILY OF MATRICES
We introduce the notion of the slot length of a family of matrices over an arbitrary field . Using this definition it is shown that, if and A and B are complex matrices with A unicellular and the pair irreducible, the slot length s of satisfies , where both inequalities are sharp, for every n. It is conjectured that the slot length of any irreducible pair of matrices, where , is at most . The slot length of a family of rank-one complex matrices can be equal to n.
- 16 January 2020
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 102 (2) , 226-236
IRREDUCIBLE FAMILIES OF COMPLEX MATRICES CONTAINING A RANK-ONE MATRIX
We show that an irreducible family ${\mathcal{S}}$ of complex $n\times n$ matrices satisfies Paz’s conjecture if it contains a rank-one matrix. We next investigate properties of families of rank-one matrices. If ${\mathcal{R}}$ is a linearly independent, irreducible family of rank-one matrices then (i) ${\mathcal{R}}$ has length at most $n$ , (ii) if all pairwise products are nonzero, ${\mathcal{R}}$ has length 1 or 2, (iii) if ${\mathcal{R}}$ consists of elementary matrices, its minimum spanning length $M$ is the smallest integer $M$ such that every elementary matrix belongs to the set of words in ${\mathcal{R}}$ of length at most $M$ . Finally, for any integer $k$ dividing $n-1$ , there is an irreducible family of elementary matrices with length $k+1$ .- 16 January 2020
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 102 (2) , 226-236
IRREDUCIBLE FAMILIES OF COMPLEX MATRICES CONTAINING A RANK-ONE MATRIX
We show that an irreducible family ${\mathcal{S}}$ of complex $n\times n$ matrices satisfies Paz’s conjecture if it contains a rank-one matrix. We next investigate properties of families of rank-one matrices. If ${\mathcal{R}}$ is a linearly independent, irreducible family of rank-one matrices then (i) ${\mathcal{R}}$ has length at most $n$ , (ii) if all pairwise products are nonzero, ${\mathcal{R}}$ has length 1 or 2, (iii) if ${\mathcal{R}}$ consists of elementary matrices, its minimum spanning length $M$ is the smallest integer $M$ such that every elementary matrix belongs to the set of words in ${\mathcal{R}}$ of length at most $M$ . Finally, for any integer $k$ dividing $n-1$ , there is an irreducible family of elementary matrices with length $k+1$ .- 28 August 2018
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 98 (3) , 402-413
ON MINIMAL SETS OF -MATRICES WHOSE PAIRWISE PRODUCTS FORM A BASIS FOR
Three families of examples are given of sets of $(0,1)$ -matrices whose pairwise products form a basis for the underlying full matrix algebra. In the first two families, the elements have rank at most two and some of the products can have multiple entries. In the third example, the matrices have equal rank $\!\sqrt{n}$ and all of the pairwise products are single-entried $(0,1)$ -matrices.- 28 August 2018
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 98 (3) , 402-413
ON MINIMAL SETS OF -MATRICES WHOSE PAIRWISE PRODUCTS FORM A BASIS FOR
Three families of examples are given of sets of $(0,1)$ -matrices whose pairwise products form a basis for the underlying full matrix algebra. In the first two families, the elements have rank at most two and some of the products can have multiple entries. In the third example, the matrices have equal rank $\!\sqrt{n}$ and all of the pairwise products are single-entried $(0,1)$ -matrices.- 2 April 2014
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 90 (1) , 134-140
REFLEXIVE INDEX OF A FAMILY OF SUBSPACES
A definition of the reflexive index of a family of (closed) subspaces of a complex, separable Hilbert space $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}H$ is given, analogous to one given by D. Zhao for a family of subsets of a set. Following some observations, some examples are given, including: (a) a subspace lattice on $H$ with precisely five nontrivial elements with infinite reflexive index; (b) a reflexive subspace lattice on $H$ with infinite reflexive index; (c) for each positive integer $n$ satisfying dim $H\ge n+1$ , a reflexive subspace lattice on $H$ with reflexive index $n$ . If $H$ is infinite-dimensional and ${\mathcal{B}}$ is an atomic Boolean algebra subspace lattice on $H$ with $n$ equidimensional atoms and with the property that the vector sum $K+L$ is closed, for every $K,L\in {\mathcal{B}}$ , then ${\mathcal{B}}$ has reflexive index at most $n$ .- 2 April 2014
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 90 (1) , 134-140
REFLEXIVE INDEX OF A FAMILY OF SUBSPACES
A definition of the reflexive index of a family of (closed) subspaces of a complex, separable Hilbert space $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}H$ is given, analogous to one given by D. Zhao for a family of subsets of a set. Following some observations, some examples are given, including: (a) a subspace lattice on $H$ with precisely five nontrivial elements with infinite reflexive index; (b) a reflexive subspace lattice on $H$ with infinite reflexive index; (c) for each positive integer $n$ satisfying dim $H\ge n+1$ , a reflexive subspace lattice on $H$ with reflexive index $n$ . If $H$ is infinite-dimensional and ${\mathcal{B}}$ is an atomic Boolean algebra subspace lattice on $H$ with $n$ equidimensional atoms and with the property that the vector sum $K+L$ is closed, for every $K,L\in {\mathcal{B}}$ , then ${\mathcal{B}}$ has reflexive index at most $n$ .- Open Access
- 13 June 2011
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 139 (11) , 3769-3777
On the lengths of irreducible pairs of complex matrices
The length of a pair of matrices is the smallest integer l l such that words in the matrices with at most l l factors span the unital algebra generated by the pair. Upper bounds for lengths have been much studied. If B B is a rank one n × n n\times n (complex) matrix, the length of the irreducible pair { A , B } \{A,B\} is 2 n − 2 2n-2 and the subwords of A n − 1 B A n − 2 A^{n-1}BA^{n-2} form a basis for M n ( C ) M_n(\mathbb {C}) . New examples are given of irreducible pairs of n × n n\times n matrices of length n n . There exists an irreducible pair of 5 × 5 5\times 5 matrices of length 4 4 . We begin the study of determining lower bounds for lengths.
- 13 June 2011
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 139 (11) , 3769-3777
Open AccessOn the lengths of irreducible pairs of complex matrices
The length of a pair of matrices is the smallest integer l l such that words in the matrices with at most l l factors span the unital algebra generated by the pair. Upper bounds for lengths have been much studied. If B B is a rank one n × n n\times n (complex) matrix, the length of the irreducible pair { A , B } \{A,B\} is 2 n − 2 2n-2 and the subwords of A n − 1 B A n − 2 A^{n-1}BA^{n-2} form a basis for M n ( C ) M_n(\mathbb {C}) . New examples are given of irreducible pairs of n × n n\times n matrices of length n n . There exists an irreducible pair of 5 × 5 5\times 5 matrices of length 4 4 . We begin the study of determining lower bounds for lengths.
- 8 June 2009
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 80 (2) , 177-201
ON THE LENGTHS OF PAIRS OF COMPLEX MATRICES OF SIZE SIX
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<6.
- 8 June 2009
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 80 (2) , 177-201
ON THE LENGTHS OF PAIRS OF COMPLEX MATRICES OF SIZE SIX
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<6.