Results 21 to 30 of about 543,835 (181)
Matrix Approaches for Gould–Hopper–Laguerre–Sheffer Matrix Polynomial Identities
Axioms, 2023 The Gould–Hopper–Laguerre–Sheffer matrix polynomials were initially studied using operational methods, but in this paper, we investigate them using matrix techniques.
Tabinda Nahid +2 more
doaj +1 more source
The Extended Invariant Factor Algorithm with Application to the Forney Analysis of Convolutional Codes [PDF]
, 1993 In his celebrated paper on the algebraic structure of convolutional codes, Forney showed that by using the invariant-factor theorem, one can transform an arbitrary polynomial generator matrix for an (n, k) convolutional code C into a basic (and ...
McEliece, Robert J., Onyszchuk, Ivan
core +1 more source
Polynomial detection of matrix subalgebras [PDF]
Proceedings of the American Mathematical Society, 2004 The double Capelli polynomial of total degree 2 t 2t is ∑ { ( s g σ τ ) x σ ( 1 ) y
openaire +6 more sources
Polynomial sequences generated by infinite Hessenberg matrices
Special Matrices, 2017 We show that an infinite lower Hessenberg matrix generates polynomial sequences that correspond to the rows of infinite lower triangular invertible matrices. Orthogonal polynomial sequences are obtained when the Hessenberg matrix is tridiagonal. We study
Verde-Star Luis
doaj +1 more source
Biorthogonal matrix polynomials related to Jacobi matrix polynomials
Computers & Mathematics with Applications, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Varma, Serhan, Taşdelen, Fatma
openaire +2 more sources
The structure of solutions of the matrix linear unilateral polynomial equation with two variables
Karpatsʹkì Matematičnì Publìkacìï, 2017 We investigate the structure of solutions of the matrix linear polynomial equation $A(\lambda)X(\lambda)+B(\lambda)Y(\lambda)=C(\lambda),$ in particular, possible degrees of the solutions.
N.S. Dzhaliuk, V.M. Petrychkovych
doaj +1 more source
CHARACTERISTIC ANTIADJACENCY MATRIX OF GRAPH JOIN
Barekeng, 2022 Let be a simple, connected, and undirected graph. The graph can be represented as a matrix such as antiadjacency matrix. An antiadjacency matrix for an undirected graph with order is a matrix that has an order and symmetric so that the ...
Wahri Irawan, Kiki Ariyanti Sugeng
doaj +1 more source
A Look at Generalized Degenerate Bernoulli and Euler Matrices
Mathematics, 2023 In this paper, we consider the generalized degenerate Bernoulli/Euler polynomial matrices and study some algebraic properties for them. In particular, we focus our attention on some matrix-inversion formulae involving these matrices.
Juan Hernández +2 more
doaj +1 more source
Depth-4 Lower Bounds, Determinantal Complexity : A Unified Approach [PDF]
, 2013 Tavenas has recently proved that any n^{O(1)}-variate and degree n polynomial in VP can be computed by a depth-4 circuit of size 2^{O(\sqrt{n}\log n)}. So to prove VP not equal to VNP, it is sufficient to show that an explicit polynomial in VNP of degree
Chillara, Suryajith +1 more
core +2 more sources
Extensions of the Eneström-Kakeya theorem for matrix polynomials
Special Matrices, 2019 The classical Eneström-Kakeya theorem establishes explicit upper and lower bounds on the zeros of a polynomial with positive coefficients and has been generalized for positive definite matrix polynomials by several authors.
Melman A.
doaj +1 more source