相关论文: On A Diagrammatic Proof of the Cayley-Hamilton The…

The deep interconnection between linear algebra and graph theory allows one to interpret classical matrix invariants through combinatorial structures. To each square matrix A over a commutative ring K, one can associate a weighted directed…

In this expository paper, various properties of matrix traces, determinants and adjugate matrices are proved, including the *trace Cayley-Hamilton theorem*, which says that \[ kc_k + \sum_{i=1}^k \operatorname{Tr} (A^i) c_{k-i} = 0 \qquad…

By using combinatorics, we give a new proof for the recurrence relations of the characteristic polynomial coefficients, and then we obtain an explicit expression for the generic term of the coefficient sequence, which yields the trace…

In this note, the first-order Dickson polynomials are introduced through a particular case of the expression of the trace of the $n^{th}$ power of a matrix in terms of powers of the trace and determinant of the matrix itself. The technique…

In this note, we use the concept of a polynomial ring to give an elementary proof to Cayley-Hamilton Theorem. We also give an elementary proof to Birkhoff theorem on Bi-stochastic matrices.

Can the cross product be generalized? Why are the trace and determinant so important in matrix theory? What do all the coefficients of the characteristic polynomial represent? This paper describes a technique for `doodling' equations from…

We develop a theory of covering digraphs, similar to the theory of covering spaces. By applying this theory to Cayley digraphs, we build a "bridge" between GLMY-theory and group homology theory, which helps to reduce path homology…

We prove the bivariate Cayley-Hamilton theorem, a powerful generalization of the classical Cayley-Hamilton theorem. The bivariate Cayley-Hamilton theorem has three direct corollaries that are usually proved independently: The classical…

This paper discusses the formalization of proofs "by diagram chasing", a standard technique for proving properties in abelian categories. We discuss how the essence of diagram chases can be captured by a simple many-sorted first-order…

We introduce the notion of characteristic function of a quaternionic matrix, whose roots are the left eigenvalues. We prove that for all $2\times 2$ matrices and for $3\times 3$ matrices having some zero entry outside the diagonal there is…

Here we consider the image of the principal minor map of symmetric matrices over an arbitrary unique factorization domain $R$. By exploiting a connection with symmetric determinantal representations, we characterize the image of the…

We consider certain functional identities on the matrix algebra $M_n$ that are defined similarly as the trace identities, except that the "coefficients" are arbitrary polynomials, not necessarily those expressible by the traces. The main…

If $R$ is a commutative unital ring and $M$ is a unital $R$-module, then each element of $\operatorname{End}_R(M)$ determines a left $\operatorname{End}_{R}(M)[X]$-module structure on $\operatorname{End}_{R}(M)$, where…

We present simple graph-theoretic characterizations of Cayley graphs for monoids, semigroups and groups. We extend these characterizations to commutative monoids, semilattices, and abelian groups.

A very simple and short proof of the polynomial matrix spectral factorization theorem (on the unit circle as well as on the real line) is presented, which relies on elementary complex analysis and linear algebra.

We develop a method to construct algebraic invariants for hypermatrices. We then construct hyperdeterminants and exhibit a generalization of the Cayley-Hamilton theorem for hypermatrices.

Let $A$ be a semisimple Banach algebra with non-trivial, and possibly infinite-dimensional socle. Addressing a problem raised by Harte and Hernandez, we first define a characteristic polynomial for elements belonging to the socle, and we…

We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…

We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…

In this article, we focus on the characteristic polynomial of a graph containingloops, but without multiple edges. We present a relationship between thecharacteristic polynomial of a graph with loops and the graph obtained byremoving all…