Results 31 to 40 of about 10,135,412 (297)
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 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
Efficient computation of the characteristic polynomial [PDF]
Proceedings of the 2005 international symposium on Symbolic and algebraic computation, 2005 This article deals with the computation of the characteristic polynomial of dense matrices over small finite fields and over the integers. We first present two algorithms for the finite fields: one is based on Krylov iterates and Gaussian elimination. We compare it to an improvement of the second algorithm of Keller-Gehrig.
Jean-Guillaume Dumas +2 more
openaire +2 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
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 the Characteristic Polynomial of Threshold Graphs
Journal of Graph Algorithms and Applications, 2014 We present an algorithm for constructing the characteristic polynomial of a threshold graph's adjacency matrix. The algorithm is based on a diagonalization procedure that is easy to describe.
David Jacobs +2 more
doaj +1 more source
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
Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages [PDF]
Logical Methods in Computer ScienceA characteristic sample for a language $L$ and a learning algorithm $\textbf{L}$ is a finite sample of words $T_L$ labeled by their membership in $L$ such that for any sample $T \supseteq T_L$ consistent with $L$, on input $T$ the learning algorithm ...
Dana Angluin, Dana Fisman
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
The Characteristic Polynomials of Symmetric Graphs [PDF]
Symmetry, 2018 In this paper, we study the way the symmetries of a given graph are reflected in its characteristic polynomials. Our aim is not only to find obstructions for graph symmetries in terms of its polynomials but also to measure how faithful these algebraic invariants are with respect to symmetry.
Chbili, Nafaa +3 more
openaire +1 more source