Results 31 to 40 of about 10,069,733 (332)
Spectral Invariants and Their Application on Spectral Characterization of Graphs
Axioms, 2022 In this paper, we give a method to characterize graphs determined by their adjacency spectrum. At first, we give two parameters Π1(G) and Π2(G), which are related to coefficients of the characteristic polynomial of graph G. All connected graphs with Π1(G)
Jun Yin, Haixing Zhao, Sun Xie
doaj +1 more source
Characteristic Min-Polynomial and Eigen Problem of a Matrix over Min-Plus Algebra
JTAM (Jurnal Teori dan Aplikasi Matematika), 2023 Let R_ε=R∪{-∞}, with R being a set of all real numbers. The algebraic structure (R_ε,⊕,⊗) is called max-plus algebra. The task of finding the eigenvalue and eigenvector is called the eigenproblem.
Sahmura Maula Al Maghribi +2 more
doaj +1 more source
Characteristic and Ehrhart Polynomials [PDF]
Journal of Algebraic Combinatorics, 1998 Let A be a subspace arrangement and let chi(A,t) be the characteristic polynomial of its intersection lattice L(A). We show that if the subspaces in A are taken from L(B_n), where B_n is the type B Weyl arrangement, then chi(A,t) counts a certain set of lattice points.
Blass, Andreas, Sagan, Bruce E.
openaire +3 more sources
, 2022 In this chapter, we provide a short overview of the stability properties of polynomials and quasi-polynomials. They appear typically in stability investigations of equilibria of ordinary and retarded differential equations. In the case of ordinary differential equations we discuss the Hurwitz criterion, and its simplified version, the Lineard-Chippart ...
Kovács, Sándor +2 more
openaire +3 more sources
Characteristic polynomial, determinant and inverse of a Fibonacci-Sylvester-Kac matrix
Special Matrices, 2021 In this paper, we consider a new Sylvester-Kac matrix, i.e., Fibonacci-Sylvester-Kac matrix. We discuss the eigenvalues, eigenvectors and characteristic polynomial of this matrix in two categories based on whether the Fibonacci-Sylvester-Kac matrix order
Jiang Zhaolin, Zheng Yanpeng, Li Tianzi
doaj +1 more source
Computing Characteristic Polynomials of Matrices of Structured Polynomials [PDF]
ACM Communications in Computer Algebra, 2016 We are interested in specific structured matrices obtained from [5] which arise from combinatorial problems.
Marshall Law, Michael B. Monagan
openaire +1 more source
Characteristic Polynomials of Random Matrices [PDF]
Communications in Mathematical Physics, 2000 Number theorists have studied extensively the connections between the distribution of zeros of the Riemann $ζ$-function, and of some generalizations, with the statistics of the eigenvalues of large random matrices. It is interesting to compare the average moments of these functions in an interval to their counterpart in random matrices, which are the ...
Brezin, E., Hikami, S.
openaire +3 more sources
Matching number and characteristic polynomial of a graph
Journal of Taibah University for Science, 2020 Matching number and the spectral properties depending on the characteristic polynomial of a graph obtained by means of the adjacency polynomial has many interesting applications in different areas of science.
Aysun Yurttas Gunes +3 more
doaj +1 more source
More connections between the matching polynomial and the chromatic polynomial
AKCE International Journal of Graphs and Combinatorics, 2019 The connection between the matching polynomial and the chromatic polynomial for triangle-free graphs was revealed in the work of Farrell and Whitehead. We extend this result to all graph by mirroring the corresponding result of Godsil and Gutman for the ...
Beatriz Carely Luna-Olivera +2 more
doaj +2 more sources
Characteristic Polynomials [PDF]
Canadian Journal of Mathematics, 1957 Let F be a field and let V be a finite dimensional vector space over F which is also a module over the ring F[a]. Here a may lie in any extension ring of F. We do not assume, as yet, that V is a faithful module, so that a need not be a linear ...
openaire +2 more sources