AbstractThe pn×pn matrix over Z/pZ whose entries are i+jj for 0⩽i, j <pn expresses the operation f⊸f(1(1−x)) on functions Fpn→Fpn. This interpretation makes the behavior of the matrix transparent
AbstractLet P denote the n-by-n matrices all of whose principal minors are positive. For S = P and c...
AbstractFor a polynomial ƒ and a matrix A we obtain formulas for ƒ(A) and bounds for ∥ƒ(A)∥ which ar...
AbstractA sequence of binomial type is a basis for R[x] satisfying a binomial-like identity, e.g. po...
AbstractThe pn×pn matrix over Z/pZ whose entries are i+jj for 0⩽i, j <pn expresses the operation f⊸f...
AbstractThe pn × pn matrix over Zp with (i, j) entry i × ji 0 ⩽ i, j ⩽ pn - 1, is diagonalizable, wi...
AbstractAn explicit representation is obtained for P(z)−1 when P(z) is a complex n×n matrix polynomi...
AbstractThe Lucas theorem for binomial coefficients implies some interesting tensor product properti...
AbstractWe answer two questions of Razpet (Discrete Math. 135 (1994) 377) regarding finite submatric...
AbstractLet Z be a matrix of order n, and suppose that the elements of Z consist of only two element...
AbstractThe coefficients of the characteristic polynomial of a matrix are expressed solely as functi...
AbstractWe present a matrix formalism to study univariate polynomials. The structure of this formali...
In 1947 Nathan Fine gave a beautiful product for the number of binomial coefficients $\binom{n}{m}$,...
AbstractRecently Magnus and Neudecker (1979) derived several properties of the so-called commutation...
AbstractWe construct the inverse and give a formula for the determinant of a block Toeplitz matrix g...
AbstractUsing combinatorial methods, we obtain the explicit polynomials for all elements in an arbit...
AbstractLet P denote the n-by-n matrices all of whose principal minors are positive. For S = P and c...
AbstractFor a polynomial ƒ and a matrix A we obtain formulas for ƒ(A) and bounds for ∥ƒ(A)∥ which ar...
AbstractA sequence of binomial type is a basis for R[x] satisfying a binomial-like identity, e.g. po...
AbstractThe pn×pn matrix over Z/pZ whose entries are i+jj for 0⩽i, j <pn expresses the operation f⊸f...
AbstractThe pn × pn matrix over Zp with (i, j) entry i × ji 0 ⩽ i, j ⩽ pn - 1, is diagonalizable, wi...
AbstractAn explicit representation is obtained for P(z)−1 when P(z) is a complex n×n matrix polynomi...
AbstractThe Lucas theorem for binomial coefficients implies some interesting tensor product properti...
AbstractWe answer two questions of Razpet (Discrete Math. 135 (1994) 377) regarding finite submatric...
AbstractLet Z be a matrix of order n, and suppose that the elements of Z consist of only two element...
AbstractThe coefficients of the characteristic polynomial of a matrix are expressed solely as functi...
AbstractWe present a matrix formalism to study univariate polynomials. The structure of this formali...
In 1947 Nathan Fine gave a beautiful product for the number of binomial coefficients $\binom{n}{m}$,...
AbstractRecently Magnus and Neudecker (1979) derived several properties of the so-called commutation...
AbstractWe construct the inverse and give a formula for the determinant of a block Toeplitz matrix g...
AbstractUsing combinatorial methods, we obtain the explicit polynomials for all elements in an arbit...
AbstractLet P denote the n-by-n matrices all of whose principal minors are positive. For S = P and c...
AbstractFor a polynomial ƒ and a matrix A we obtain formulas for ƒ(A) and bounds for ∥ƒ(A)∥ which ar...
AbstractA sequence of binomial type is a basis for R[x] satisfying a binomial-like identity, e.g. po...
DOI
Add to ORKG