Results 11 to 20 of about 1,555,765 (257)
Machine Learning Seams of Conical Intersection: A Characteristic Polynomial Approach. [PDF]
J Phys Chem Lett, 2023 The machine learning of potential energy surfaces (PESs) has undergone rapid progress in recent years. The vast majority of this work, however, has been focused on the learning of ground state PESs.
Wang TY, Neville SP, Schuurman MS.
europepmc +4 more sources
Characteristic numbers and chromatic polynomial of a tensor
Forum of Mathematics, SigmaWe introduce the characteristic numbers and the chromatic polynomial of a linear subspace of matrices, or equivalently of a tensor. Our approach generalizes and unifies the chromatic polynomial of a graph and of a matroid, characteristic numbers of ...
Austin Conner, Mateusz Michalek
doaj +2 more sources
Factorization of the Characteristic Polynomial [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 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 of Antiadjacency Matrix of A Line Digraph
Jurnal Matematika UNAND, 2022 In this paper, we find the characteristic polynomial of the antiadjacency matrix of a line digraph. There are recent studies on the relation between the characteristic polynomial of the adjacency matrix and its line digraph, we are also interested in ...
Muhammad Irfan Arsyad Prayitno +1 more
doaj +1 more source
SIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL [PDF]
Journal of Algebraic Systems, 2018 Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients ...
E. Ghasemian, Gh. H. Fath-Tabar
doaj +1 more source
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
How Good Can the Characteristic Polynomial Be for Correlations? [PDF]
Int J Mol Sci, 2007 Bolboaca S, Jantschi L.
europepmc +1 more source
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