Searcharxiv⌕ Search

arXiv subjects

Kevin C. O'Meara

Publications and source records attributed to Kevin C. O'Meara.

4 recordsLinked to original sources

Positive definite matrices and involutions: the manners of their infinite cousins

Matrices and involutions in/on the algebras $B(\mathbb{R})$ and $B(\mathbb{C})$ of real (resp., complex) row- and column-finite $ω\timesω$ matrices are studied. It is proved that any positive definite $\mathbb{R}$-algebra involution on $B(\mathbb{R})$ (resp., any positive definite conjugate-linear involution on $B(\mathbb{C})$) is given by conjugating the transpose involution (resp., the conjugate-transpose involution) with a positive definite matrix from the algebra in question. All positive definite matrices in these algebras have Cholesky factorizations within the algebra. Examples are constructed to show that such positive definite matrices need not have any eigenvalues for their canonical action on column-finite column vectors, and they need not have any square roots in $B(\mathbb{C})$.

math.RA↗

Regular Ring Properties Degraded Through Inverse Limits

We give a number of constructions where inverse limits seriously degrade properties of regular rings, such as unit-regularity, diagonalisation of matrices, and finite stable rank. This raises the possibility of using inverse limits to answer the long standing Separativity Problem (in the negative).

math.RA↗

Levels of cancellation for monoids and modules

Levels of cancellativity in commutative monoids $M$, determined by stable rank values in $\mathbb{Z}_{> 0} \cup \{\infty\}$ for elements of $M$, are investigated. The behavior of the stable ranks of multiples $ka$, for $k \in \mathbb{Z}_{> 0}$ and $a \in M$, is determined. In the case of a refinement monoid $M$, the possible stable rank values in archimedean components of $M$ are pinned down. Finally, stable rank in monoids built from isomorphism or other equivalence classes of modules over a ring is discussed.

math.GR↗

A computing strategy and programs to resolve the Gerstenhaber Problem for commuting triples of matrices

We describe a MATLAB program that could produce a negative answer to the Gerstenhaber Problem by the construction of three commuting $n \times n$ matrices $A,B,C$ over a field $F$ such that the subalgebra $F[A,B,C]$ they generate has dimension greater than $n$. This problem has remained open for nearly 60 years, following Gerstenhaber's surprising result (Annals Math.) that $\dim F[A,B] \le n$ for any two commuting matrices $A,B$. The property fails for four or more commuting matrices. We also make the MATLAB files freely available.

math.AC↗