相关论文: Centralizers, Clifforders, Polynomial Equivalence …

This paper addresses various questions about pairs of similarity classes of matrices which contain commuting elements. In the case of matrices over finite fields, we show that the problem of determining such pairs reduces to a question…

Based on the fact that every finite-dimensional algebra over a field is isomorphic to the centralizer of \textbf{two} matrices, we approach the representation theory of finite-dimensional algebras over fields by centralizers of matrices.…

As is known, every finite-dimensional algebra over a field is isomorphic to the centralizer algebra of \textbf{two} matrices. So it is fundamental to study first the centralizer algebra of a single matrix, called a centralizer matrix…

The centralizer of a matrix in a full matrix algebra is called a principal centralizer matrix algebra. Characterizations are presented for principal centralizer matrix algebras to be Morita equivalent, almost $\nu$-stable derived…

It is known that that the centralizer of a matrix over a finite field depends, up to conjugacy, only on the type of the matrix, in the sense defined by J. A. Green. In this paper an analogue of the type invariant is defined that in general…

We introduce a notion of matrix valued Gram decompositions for correlation matrices whose study is motivated by quantum information theory. We show that for extremal correlations, the matrices in such a factorization generate a Clifford…

This paper investigates centralizers and twisted centralizers in degenerate and non-degenerate Clifford (geometric) algebras. We provide an explicit form of the centralizers and twisted centralizers of the subspaces of fixed grades,…

The fact that each finite-dimensional algebra over a field is isomorphic to the centralizer of two matrices, has suggested to investigate representation theoretical problems of finite-dimensional algebras through centralizer algebras of…

This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…

In this paper, we characterize completely the structure of Clifford semigroups of matrices over an arbitrary field. It is shown that a semigroups of matrices of finite order is a Clifford semigroup if and only if it is isomorphic to a…

A set of valuable universal similarity factorization equalities are established over complex Clifford algebras $\Cn.$ Through them matrix representations of complex Clifford algebras $\Cn$ can directly be derived, and their properties can…

Polynomial $n\times n$ matrices $A(\lambda)$ and $B(\lambda)$ over a field $\mathbb F $ are called semi-scalar equivalent if there exist a nonsingular $n\times n$ matrix $P$ over the field $\mathbb F $ and an invertible $n\times n$ matrix…

Commutative analogues of Clifford algebras are algebras defined in the same way as Clifford algebras except that their generators commute with each other, in contrast to Clifford algebras in which the generators anticommute. In this paper,…

The space of complete collineations is a compactification of the space of matrices of fixed dimension and rank, whose boundary is a divisor with normal crossings. It was introduced in the 19th century and has been used to solve many…

In the geometry of polynomials, Schoenberg's conjecture, now a theorem, is a quadratic inequality between the zeros and critical points of a polynomial whose zeros have their centroid at the origin. We call its generalizations to other…

Let $K$ be a field, $R=K[x, y]$ the polynomial ring and $\mathcal{M}(K)$ the set of all pairs of square matrices of the same size over $K.$ Pairs $P_1=(A_1,B_1)$ and $P_2=(A_2,B_2)$ from $\mathcal{M}(K)$ are called similar if…

A set of valuable universal similarity factorization equalities is established over complex Clifford algebras $\Cn.$ Through them matrix representations of complex Clifford algebras $\Cn$ can directly be derived, and their properties can…

We explore a class of centrosymmetric matrices whose entries are polynomials in two variables, referred to as DNA matrices. Our motivation stems from an unexpected connection between these matrices and invariant polynomials under the action…

The class of quasiseparable matrices is defined by the property that any submatrix entirely below or above the main diagonal has small rank, namely below a bound called the order of quasiseparability. These matrices arise naturally in…

Copositive and completely positive matrices play an increasingly important role in Applied Mathematics, namely as a key concept for approximating NP-hard optimization problems. The cone of copositive matrices of a given order and the cone…