Related papers: Companion unit lower Hessenberg matrices
We consider compact matrix quantum groups whose $N$-dimensional fundamental representation decomposes into an $(N-1)$-dimensional and a one-dimensional subrepresentation. Even if we know that the compact matrix quantum group associated to…
We give a short proof of a recent result by Bernik, Mastnak, and Radjavi, stating that an irreducible group of complex matrices with nonnegative diagonal entries is diagonally similar to a group of nonnegative monomial matrices. We also…
We show that almost commuting real orthogonal matrices are uniformly close to exactly commuting real orthogonal matrices. We prove the same for symplectic unitary matrices. This is in contrast to the general complex case, where not all…
At this paper, we derive some relationships between permanents of one type of lower-Hessenberg matrix and the Fibonacci and Lucas numbers and their sums.
Recently we showed that Hessenberg matrices are proper to represent conjugacy classes in SL(n,Z). In this paper we focus on the reducibility properties in the set of Hessenberg matrices of SL(3,Z). We investigate the first interesting open…
In this paper we introduce a certain class of families of Hessenberg varieties arising from Springer theory for symmetric spaces. We study the geometry of those Hessenberg varieties and investigate their monodromy representations in detail…
This paper is dedicated to the problem of verification of matrices for unitary similarity. For the case of nonderogatory matrices, we have been able to present the new solution for this problem based on geometric approach. The main…
Correlation matrices are the sub-class of positive definite real matrices with all entries on the diagonal equal to unity. Earlier work has exhibited a parametrisation of the corresponding Cholesky factorisation in terms of partial…
An irreducible norm closed semigroup of complex matrices is simultaneously similar to a semigroup of partial isometries if and only if (a) the norms of all nonzero members of it are uniformly bounded above and below, and (b) its idempotents…
An invariant theoretic characterization of subdiscriminants of matrices is given. The structure as a module over the special orthogonal group of the minimal degree non-zero homogeneous component of the vanishing ideal of the variety of real…
High-order interaction events are common in real-world applications. Learning embeddings that encode the complex relationships of the participants from these events is of great importance in knowledge mining and predictive tasks. Despite…
We study low-rank matrix regression in settings where matrix-valued predictors and scalar responses are observed across multiple individuals. Rather than assuming a fully homogeneous coefficient matrices across individuals, we accommodate…
We propose a novel approach to iterated sparse matrix dense matrix multiplication, a fundamental computational kernel in scientific computing and graph neural network training. In cases where matrix sizes exceed the memory of a single…
It is well known that a set of non-defect matrices can be simultaneously diagonalized if and only if the matrices commute. In the case of non-commuting matrices, the best that can be achieved is simultaneous block diagonalization. Here we…
An Hadamard matrix is a square matrix $H\in M_N(\pm1)$ whose rows and pairwise orthogonal. More generally, we can talk about the complex Hadamard matrices, which are the square matrices $H\in M_N(\mathbb C)$ whose entries are on the unit…
Some variants of the (block) Gauss--Seidel iteration for the solution of linear systems with $M$-matrices in (block) Hessenberg form are discussed. Comparison results for the asymptotic convergence rate of some regular splittings are…
A hermitian matrix can be parametrized by a set consisting of its determinant and the eigenvalues of its submatrices. We established a group of equations which connect these variables with the mixing parameters of diagonalization. These…
Although regular semisimple Hessenberg varieties are smooth and irreducible, semisimple Hessenberg varieties are not necessarily smooth in general. In this paper we determine the irreducible components of semisimple Hessenberg varieties…
In prior work, Gupta et al. (SPAA 2022) presented a distributed algorithm for multiplying sparse $n \times n$ matrices, using $n$ computers. They assumed that the input matrices are uniformly sparse--there are at most $d$ non-zeros in each…
We study the problem when every matrix over a division ring is representable as either the product of traceless matrices or the product of semi-traceless matrices, and also give some applications of such decompositions. Specifically, we…