A recursion formula for the characteristic polynomial of Hessenberg matrices

2009 ◽  
Vol 208 (1) ◽  
pp. 177-179 ◽  
Author(s):  
Mohamed Elouafi ◽  
Ahmed Driss Aiat Hadj
Keyword(s):  
Characteristic Polynomial ◽  
Recursion Formula ◽  
Hessenberg Matrices

scholarly journals Corrigendum to "Determinants of Normalized Bohemian Upper Hessenberg Matrices"

2021 ◽  
Vol 37 ◽  
pp. 160-162
Author(s):  
Massimiliano Fasi ◽  
Jishe Feng ◽  
Gian Maria Negri Porzio
Keyword(s):  
Linear Algebra ◽  
Characteristic Polynomial ◽  
Triangular Part ◽  
Hessenberg Matrices

An amended version of Proposition 3.6 of [Fasi and Negri Porzio, Electron. J. Linear Algebra 36:352--366, 2020] is presented. The result shows that the set of possible determinants of upper Hessenberg matrices with ones on the subdiagonal and elements in the upper triangular part drawn from the set $\{-1,1\}$ is $\{ 2k \mid k \in \langle -2^{n-2} , 2^{n-2} \rangle \}$, instead of $\{ 2k \mid k \in \langle -n+1, n-1 \rangle \}$ as previously stated. This does not affect the main results of the article being corrected and shows that Conjecture 20 in the Characteristic Polynomial Database is true.

scholarly journals The normalized distance Laplacian

2021 ◽  
Vol 9 (1) ◽  
pp. 1-18
Author(s):  
Carolyn Reinhart
Keyword(s):  
Spectral Radius ◽  
Characteristic Polynomial ◽  
Adjacency Matrix ◽  
Connected Graph ◽  
Distance Matrix ◽  
Laplacian Matrix ◽  
Diagonal Matrix ◽  
The Matrix

Abstract The distance matrix 𝒟(G) of a connected graph G is the matrix containing the pairwise distances between vertices. The transmission of a vertex vi in G is the sum of the distances from vi to all other vertices and T(G) is the diagonal matrix of transmissions of the vertices of the graph. The normalized distance Laplacian, 𝒟𝒧(G) = I−T(G)−1/2 𝒟(G)T(G)−1/2, is introduced. This is analogous to the normalized Laplacian matrix, 𝒧(G) = I − D(G)−1/2 A(G)D(G)−1/2, where D(G) is the diagonal matrix of degrees of the vertices of the graph and A(G) is the adjacency matrix. Bounds on the spectral radius of 𝒟 𝒧 and connections with the normalized Laplacian matrix are presented. Twin vertices are used to determine eigenvalues of the normalized distance Laplacian. The distance generalized characteristic polynomial is defined and its properties established. Finally, 𝒟𝒧-cospectrality and lack thereof are determined for all graphs on 10 and fewer vertices, providing evidence that the normalized distance Laplacian has fewer cospectral pairs than other matrices.

scholarly journals Multiple phases in a generalized Gross-Witten-Wadia matrix model

2020 ◽  
Vol 2020 (9) ◽  
Author(s):  
Jorge G. Russo ◽  
Miguel Tierz
Keyword(s):  
Partition Function ◽  
Matrix Models ◽  
Characteristic Polynomial ◽  
Matrix Model ◽  
Phase Structure ◽  
Unitary Matrix ◽  
Two Dimensional ◽  
Toeplitz Determinants ◽  
Dimensional Parameter ◽  
Planar Limit

Abstract We study a unitary matrix model of the Gross-Witten-Wadia type, extended with the addition of characteristic polynomial insertions. The model interpolates between solvable unitary matrix models and is the unitary counterpart of a deformed Cauchy ensemble. Exact formulas for the partition function and Wilson loops are given in terms of Toeplitz determinants and minors and large N results are obtained by using Szegö theorem with a Fisher-Hartwig singularity. In the large N (planar) limit with two scaled couplings, the theory exhibits a surprisingly intricate phase structure in the two-dimensional parameter space.

A Recursion Formula for the Coefficients of Entire Functions Satisfying an ODE with Polynomial Coefficients

2004 ◽  
Vol 11 (3) ◽  
pp. 409-414
Author(s):  
C. Belingeri
Keyword(s):  
Differential Equations ◽  
Sum Rules ◽  
Entire Functions ◽  
Recursion Formula ◽  
Linear Differential Equations ◽  
Bell Polynomials ◽  
Polynomial Coefficients ◽  
Linear Differential

Abstract A recursion formula for the coefficients of entire functions which are solutions of linear differential equations with polynomial coefficients is derived. Some explicit examples are developed. The Newton sum rules for the powers of zeros of a class of entire functions are constructed in terms of Bell polynomials.

Sign in / Sign up

Export Citation Format

Share Document