Results 11 to 20 of about 10,135,412 (297)
Characteristic Polynomial [PDF]
L. Jäntschi, Sorana D. Bolboacă
semanticscholar +2 more sources
Asymptotic analysis of the characteristic polynomial for the Elliptic Ginibre Ensemble [PDF]
We consider the complex Elliptic Ginibre Ensemble, a family of random matrix models introduced by Girko that interpolates between the Ginibre Ensemble and the Gaussian Unitary Ensemble and such that its empirical spectral measure converges to the uniform
Quentin Franccois +2 more
semanticscholar +1 more source
On the Characteristic Polynomial of the Eigenvalue Moduli of Random Normal Matrices [PDF]
We study the characteristic polynomial pn(x)=∏j=1n(|zj|-x)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength ...
Sunggyu Byun, C. Charlier
semanticscholar +1 more source
Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial [PDF]
Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$ -matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main innovation
Asaf Ferber +3 more
semanticscholar +1 more source
Skew characteristic polynomial of graphs and embedded graphs [PDF]
We introduce a new one-variable polynomial invariant of graphs, which we call the skew characteristic polynomial. For an oriented simple graph, this is just the characteristic polynomial of its anti-symmetric adjacency matrix.
Riya Dogra +3 more
semanticscholar +1 more source
Sparse matrices: convergence of the characteristic polynomial seen from infinity [PDF]
We prove that the reverse characteristic polynomial det(In − zAn) of a random n×nmatrixAn with iidBernoulli(d/n) entries converges in distribution towards the random infinite product ∞ ∏ `=1 (1− z)` where Y` are independent Poisson(d/`) random variables.
S. Coste
semanticscholar +1 more source
On the Sombor characteristic polynomial and Sombor energy of a graph [PDF]
Let G be a simple graph with vertex set V(G)={v1,v2,…,vn}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength ...
Nima Ghanbari
semanticscholar +1 more source
How Good Can the Characteristic Polynomial Be for Correlations? [PDF]
Lorentz Jäntschi +2 more
exaly +1 more source
Factorization of the Characteristic Polynomial [PDF]
We introduce a new method for showing that the roots of the characteristic polynomial of a finite lattice are all nonnegative integers. Our method gives two simple conditions under which the characteristic polynomial factors.
Joshua Hallam, Bruce Sagan
doaj +1 more source
On characteristic polynomial and energy of Sombor matrix
Let \(G\) be a simple graph with vertex set \(V=\{v_1,v_2,\ldots,v_n \}\), and let \(d_i\) be the degree of the vertex \(v_i\). The Sombor matrix of \(G\) is the square matrix \(\mathbf A_{SO}\) of order \(n\), whose \((i,j)\)-element is \(\sqrt{d_i^2 ...
Gowtham Kalkere Jayanna, I. Gutman
semanticscholar +1 more source

