Results 21 to 30 of about 10,135,412 (297)
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
Deterministic computation of the characteristic polynomial in the time of matrix multiplication [PDF]
Journal of Complexity, 2020 This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices.
Vincent Neiger, Clément Pernet
semanticscholar +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
On computing the determinant, other characteristic polynomial coefficients, and inverse in Clifford algebras of arbitrary dimension [PDF]
Computational and Applied Mathematics, 2020 In this paper, we solve the problem of computing the inverse in Clifford algebras of arbitrary dimension. We present basis-free formulas of different types (explicit and recursive) for the determinant, other characteristic polynomial coefficients ...
D. Shirokov
semanticscholar +1 more source
Journal of Physics: Conference Series, 2021 This research discussed the characteristic polynomial and eigenvalues of antiadjacency matrix of directed unicyclic flower vase graph. The entries of the antiadjacency matrix of a directed graph represent the presence or the absence of a directed arc ...
Bayu H. Aji, K. Sugeng, S. Aminah
semanticscholar +1 more source
, 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
Joint moments of a characteristic polynomial and its derivative for the circular β-ensemble [PDF]
Probability and Mathematical Physics, 2020 The problem of calculating the scaled limit of the joint moments of the characteristic polynomial, and the derivative of the characteristic polynomial, for matrices from the unitary group with Haar measure first arose in studies relating to the Riemann ...
P. Forrester
semanticscholar +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
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
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