Results 51 to 60 of about 10,135,412 (297)
图的Aα-特征多项式系数的一个注记(A note on the coefficients of the Aα-characteristic polynomial of a graph)
Zhejiang Daxue xuebao. Lixue ban, 2019 Let G be a graph on n vertices, and let A( G ) and D ( G ) denote the adjacency matrix and the degree matrix of G, respectively. Define Aα ( G )= αD ( G )+( 1 - α ) A( G ) for any real α ∈ [ 0,1 ].
LIUShunyi,(柳顺义) +1 more
doaj +1 more source
Maximum of the Characteristic Polynomial of Random Unitary Matrices [PDF]
Communications in Mathematical Physics, 2015 It was recently conjectured by Fyodorov, Hiary and Keating that the maximum of the characteristic polynomial on the unit circle of a N×N\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb ...
L. Arguin, David Belius, P. Bourgade
semanticscholar +1 more source
Characteristic Polynomial and Eigenproblem of Triangular Matrix over Interval Min-Plus Algebra
JTAM (Jurnal Teori dan Aplikasi Matematika)A min-plus algebra is a linear algebra over the semiring R_ε', equipped with the operations “"⊕'=min" ” and “⊗=+”. In min-plus algebra, there is the concept of characteristic polynomial obtained from permanent of matrix.
Anita Dwi Rahmawati +2 more
doaj +1 more source
Generalised characteristic polynomials
Journal of Symbolic Computation, 1989 This paper is devoted to the extension of the classical elimination by resultant between two polynomials in one variable to the case of n polynomials in m variables with the coefficients in a field K. The key tool of the author's construction is the introduction of the generalized characteristic polynomial of the polynomials \(f_ 1,...,f_ n\).
openaire +1 more source
New polynomial-based molecular descriptors with low degeneracy. [PDF]
PLoS ONE, 2010 In this paper, we introduce a novel graph polynomial called the 'information polynomial' of a graph. This graph polynomial can be derived by using a probability distribution of the vertex set.
Matthias Dehmer +2 more
doaj +1 more source
Efficient computation of the characteristic polynomial of a threshold graph [PDF]
Theoretical Computer Science, 2015 An efficient algorithm is presented to compute the characteristic polynomial of a threshold graph. Threshold graphs were introduced by Chvatal and Hammer, as well as by Henderson and Zalcstein in 1977.
Martin Fürer
semanticscholar +1 more source
On the characteristic polynomial of sl(2,F)
Linear Algebra and its Applications, 2019 We prove Hu-Zhang's conjecture stated in [5] that the characteristic polynomial of a finite dimensional irreducible representation of sl ( 2 , F ) can be explicitly expressed as a product of some irreducible polynomials.
Zhiqi Chen, Xueqing Chen, Mingda Ding
semanticscholar +1 more source
On the characteristic polynomial of ( k , p ) $(k,p)$ -Fibonacci sequence
Advances in Difference Equations, 2021 Recently, Bednarz introduced a new two-parameter generalization of the Fibonacci sequence, which is called the ( k , p ) $(k,p)$ -Fibonacci sequence and denoted by ( F k , p ( n ) ) n ≥ 0 $(F_{k,p}(n))_{n\geq0}$ .
Pavel Trojovský
doaj +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Japan has one of the highest dialysis prevalence rates worldwide and a shrinking, aging population. Whether dialysis burden has entered a sustained post‐peak phase or whether recent declines partly reflect pandemic‐related disruptions remains uncertain.
Hatice Şahin +2 more
wiley +1 more source
Extremal skew energy of digraphs with no even cycles [PDF]
Transactions on Combinatorics, 2014 Let $D$ be a digraph with skew-adjacency matrix $S(D)$. Then the skew energy of $D$ is defined to be the sum of the norms of all eigenvalues of $S(D)$. Denote by $mathcal{O}_n$ the class of digraphs on order $n$ with no even cycles, and by $mathcal{O ...
Jing Li, Xueliang Li, Huishu Lian
doaj