Results 301 to 310 of about 10,069,733 (332)

The complexity of the characteristic and the minimal polynomial

Theoretical Computer Science, 2003
We investigate the complexity of (1) computing the characteristic polynomial, the minimal polynomial, and all the invariant factors of an integer matrix, and of (2) verifying them, when the coefficients are given as input.It is known that each ...
Thanh Minh Hoang, Thomas Thierauf
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

A reduction formula for the characteristic polynomial of hypergraph with pendant edges

, 2020
In this paper, we give a reduction formula for the characteristic polynomial of k-uniform hypergraphs with pendant edges, and use the reduction formula to derive the explicit expression for the characteristic polynomial and all distinct eigenvalues of k ...
Lixiang Chen, Changjiang Bu
semanticscholar   +1 more source

The Characteristic Polynomial as a Structure Discriminator

Journal of Chemical Information and Computer Sciences, 1997
We investigate use of the characteristic polynomial for discrimination of graphs. Here we consider acyclic graphs (trees) only, and in particular we consider trees without bridging vertices because no isospectral trees in which both graphs are without bridging vertices have been hitherto reported.
Milan Randic, Wolfgang R. Mueller, Jan V. Knop, Nenad Trinajstic   +3 more
openaire   +2 more sources

On the Characteristic Equations of the Characteristic Polynomial

SIAM Journal on Algebraic Discrete Methods, 1985
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Maximum of the Characteristic Polynomial of Random Unitary Matrices

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 zero polynomial with the Cochrun-Grabel method

International Journal of Circuit Theory and Applications, 1998
Summary: The Cochrun-Grabel (C-G) method [\textit{B. L. Cochrun} and \textit{A. Grabel}, A method for the determination of the transfer function of electronic circuits, IEEE Trans. Circuit Theory CT-20, 16-20 (1973)] for finding the characteristic polynomial of a circuit (i.e.
Pietro Andreani, Sven Mattisson
openaire   +2 more sources

A CLT for the characteristic polynomial of random Jacobi matrices, and the G $$\beta $$ β E

Probability theory and related fields, 2023
F. Augeri, Raphael Butez, O. Zeitouni
semanticscholar   +1 more source

Characteristic polynomials

2015
This article considers characteristic polynomials and reviews a few useful results obtained in simple Gaussian models of random Hermitian matrices in the presence of an external matrix source. It first considers the products and ratio of characteristic polynomials before discussing the duality theorems for two different characteristic polynomials of ...
Edouard Brezin, Sinobu Hikami
openaire   +1 more source

Characteristic polynomials of oriented graphs

2023
Summary: Graph energy is defined as the sum of the absolute values of all eigenvalues and it has important applications related to molecular graphs. Directed graphs play important role in some applications in social sciences and network studies. There are some studies on several aspects related to directed graphs.
CANGÜL, İSMAİL NACİ, Ana, Ugur, Desai, A.R., Mahalank, Pushpalatha   +3 more
openaire   +2 more sources

The Frobenius Characteristic of Character Polynomials

Journal of the Indian Institute of Science, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources