In this paper, we revisit the greatest common right divisor (GCRD) extraction from a set of polynomial matrices , with coefficients in generic field and column dimension . We give necessary sufficient conditions for matrix to be GCRD using Smith normal form compound obtained by concatenating vertically, where also describe complete degrees freedom solution link it Hermite then an algorithm cons...

The Extended Euclidean algorithm for matrix Pade approximants is applied to compute matrix Pade approximants in rectangular full packed format (RFP) if the coefficient matrices of the input matrix polynomial are triangular. The procedure given by Gustavson et al for packing a triangular matrix in rectangular full packed format is applied to pack sequence of lower triangular matrices of a matrix...

The concept of average degree-eccentricity matrix ADE(G) of a connected graph $G$ is introduced. Some coefficients of the characteristic polynomial of ADE(G) are obtained, as well as a bound for the eigenvalues of ADE(G). We also introduce the average degree-eccentricity graph energy and establish bounds for it.

We give an explicit algorithm for calculating the Kauffman bracket of a link diagram from Goeritz matrix that link. Further, we show how Jones polynomial can be recovered when corresponding checkerboard surface is orientable, or more information known about its Gordon–Litherland form. In process develop theory matrices cographic matroids, which extends to any symmetric integer matrix. place thi...