Related papers: On the Characteristic and Permanent Polynomials of…

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

We apply a symbolic approach of the general quadratic decomposition of polynomial sequences - presented in a previous article referenced herein - to polynomial sequences fulfilling specific orthogonal conditions towards two given…

We calculate joint moments of the characteristic polynomial of a random unitary matrix from the circular unitary ensemble and its derivative in the case that the power in the moments is an odd positive integer. The calculations are carried…

Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a…

Answering a question of Frank Calegari, we extend some of our earlier results on dimension of fixed point spaces of elements in irreducible linear groups. We consider characteristic polynomials rather than just fixed spaces.

Formulas to calculate multivector exponentials in a base-free representation and in a orthonormal basis are presented for an arbitrary Clifford geometric algebra Cl(p,q). The formulas are based on the analysis of roots of characteristic…

In this paper, by using the theory of circulant matrices we study some matrices over finite fields which involve the quadratic character and trinomial coefficients.

The idiosyncratic polynomial of a graph $G$ with adjacency matrix $A$ is the characteristic polynomial of the matrix $ A + y(J-A-I)$, where $I$ is the identity matrix and $J$ is the all-ones matrix. It follows from a theorem of Hagos (2000)…

In this paper, we investigate characteristic polynomials of matrices in min-plus algebra. Eigenvalues of min-plus matrices are known to be the minimum roots of the characteristic polynomials based on tropical determinants which are designed…

For a sequence of polynomials $\{p_k(t)\}$ in one real or complex variable, where $p_k$ has degree $k$, for $k\ge 0$, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients $d(n,m,k)$,…

We establish an analogue of the fundamental theorem of algebra for polynomial matrix equations, in which the matrices-coefficients and unknown matrix are assumed to be circulant matrices.

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…

Let $\mathcal A$ be an $\mathbb F$-algebra and $\omega \in \mathcal A\langle x_1, \ldots, x_m \rangle$ which defines a map $\mathcal A^m \rightarrow \mathcal A$ by evaluation, called a polynomial map with constant. We consider $\mathcal {A}…

We show that the permanent of a matrix can be written as the expectation value of a function of random variables each with zero mean and unit variance. This result is used to show that Glynn's theorem and a simplified MacMahon theorem…

Let $G$ be a graph with $n$ vertices, and let $L(G)$ and $Q(G)$ be the Laplacian matrix and signless Laplacian matrix of $G$, respectively. The polynomial $\pi(L(G);x)={\rm per}(xI-L(G))$ (resp. $\pi(Q(G);x)={\rm per}(xI-Q(G))$) is called…

In this paper, we discuss duality about components of invariant variety of periodic points(IVPP) and fundamental domain of recurrence equation, and present an algorithm for the derivation of all components of IVPPs of any rational maps. It…

Graph polynomials are deemed useful if they give rise to algebraic characterizations of various graph properties, and their evaluations encode many other graph invariants. Algebraic: The complete graphs $K_n$ and the complete bipartite…

In this paper, we describe properties of the characteristic polynomial of a weighted lattice and show that it has a recursive description, which we use to obtain results on the critical exponent of $q$-polymatroids. We give a Critical…

A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…

In this paper we introduce a method of characteristic sets with respect to several term orderings for difference-differential polynomials. Using this technique, we obtain a method of computation of multivariate dimension polynomials of…