𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The characteristic polynomial of ladder digraph and an annihilating uniqueness theorem

✍ Scribed by Chong-Keang Lim; Kah Seng Lam

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
207 KB
Volume
151
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Let G be a digraph with n vertices and A(G) be its adjacency matrix. A monic polynomialf(x) of degree at most n is called an annihilating polynomial of G iff(A(G)) = O. G is said to be annihilatingly unique if it possesses a unique annihilating polynomial. In this paper, we give the explicit expression for the characteristic polynomial of the ladder digraph and show that the ladder digraph is annihilatingly unique.

πŸ“œ SIMILAR VOLUMES

Bass Numbers in the Graded Case, a-Invar
Bass Numbers in the Graded Case, a-Invariant Formulas, and an Analogue of Faltings' Annihilator Theorem
✍ Rodney Y Sharp πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 180 KB

Let R = nβ‰₯0 R n be a positively graded commutative Noetherian ring. A graded R-module is called \*indecomposable (respectively \*injective) if it is indecomposable (respectively injective) in the category of graded R-modules. Let M = n∈ M n be a finitely generated graded R-module. The first main re

An Accurate and Efficient Algorithm for
An Accurate and Efficient Algorithm for the Computation of the Characteristic Polynomial of a General Square Matrix
✍ S. Rombouts; K. Heyde πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 99 KB

An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant quantum Monte-Carlo methods.