Related papers: On the Characteristic and Permanent Polynomials of…
In this paper, we give some determinantal and permanental representations of Generalized Lucas Polynomials by using various Hessenberg matrices, which are general form of determinantal and permanental representations of ordinary Lucas and…
We present a simple technique to compute moments of derivatives of unitary characteristic polynomials. The first part of the technique relies on an idea of Bump and Gamburd: it uses orthonormality of Schur functions over unitary groups to…
We consider the problem of writing real polynomials as determinants of symmetric linear matrix polynomials. This problem of algebraic geometry, whose roots go back to the nineteenth century, has recently received new attention from the…
We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct…
By using the Poisson formula for resultants and the variants of chip-firing game on graphs, we provide a combinatorial method for computing a class of of resultants, i.e. the characteristic polynomials of the adjacency tensors of starlike…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
In the paper, we introduce a matrix method to constructively determine spaces of polynomial solutions (in general, multiplied by exponentials) to a system of constant coefficient linear PDE's with polynomial (multiplied by exponentials)…
The principal permanent rank characteristic sequence is a binary sequence $r_0 r_1 \ldots r_n$ where $r_k = 1$ if there exists a principal square submatrix of size $k$ with nonzero permanent and $r_k = 0$ otherwise, and $r_0 = 1$ if there…
Starting from the expression for the superdeterminant of $ (xI-M)$, where $M$ is an arbitrary supermatrix , we propose a definition for the corresponding characteristic polynomial and we prove that each supermatrix satisfies its…
We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure…
Counting the number of perfect matchings in bipartite graphs, or equivalently computing the permanent of 0-1 matrices, is an important combinatorial problem that has been extensively studied by theoreticians and practitioners alike. The…
A number of theoretical and computational problems for matrix polynomials are solved by passing to linearizations. Therefore a perturbation theory results for linearizations need to be related back to matrix polynomials. In this paper we…
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…
We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…
A new family of asymmetric matrices of Walsh-Hadamard type is introduced. We study their properties and, in particular, compute their determinants and discuss their eigenvalues. The invertibility of these matrices implies that certain…
In this note we introduce a family of polynomials on a matroid derived from chain Tutte polynomials which generalize the classic and ubiquitous characteristic polynomial. We show that the coefficients of these polynomials alternate and…
Let $G$ be a graph and $A$ the adjacency matrix of $G$. The permanental polynomial of $G$ is defined as $\mathrm{per}(xI-A)$. In this paper some of the results from a numerical study of the permanental polynomials of graphs are presented.…
We introduce the notion of matrices graph, defining continued fraction algorithms where the past and the future are almost independent. We provide an algorithm to convert more general algorithms into matrices graphs. We present an algorithm…
In this article we describe a new inductive approach to compute the chromatic polynomial of simple graphs and the characteristic polynomial of central hyperplane arrangements.
We derive formulas for characterizing bounded orthogonally additive polynomials in two ways. Firstly, we prove that certain formulas for orthogonally additive polynomials derived in \cite{Kusa} actually characterize them. Secondly, by…