On the permanental polynomials of matrices
From MaRDI portal
Publication:745925
DOI10.1007/S40840-014-0093-XzbMATH Open1322.05074OpenAlexW2055828796MaRDI QIDQ745925FDOQ745925
Authors: Wei Li, Heping Zhang 
Publication date: 15 October 2015
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-014-0093-x
Recommendations
- On characteristic and permanent polynomials of a matrix
- On permanental polynomials of certain random matrices
- Permanental polynomial identities on matrix rings
- Polynomial algorithms for computing the permanents of some matrices
- Multidimensional permanents of polystochastic matrices
- Permanents of matrices over roots of unity
- scientific article; zbMATH DE number 1156600
- Publication:4943290
- scientific article; zbMATH DE number 6256206
- scientific article; zbMATH DE number 1577997
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph polynomials (05C31) Structural characterization of families of graphs (05C75)
Cites Work
- Matching theory
- Pólya's permanent problem
- A characterization of convertible (0,1)-matrices
- Permanents, Pfaffian orientations, and even directed circuits
- The complexity of computing the permanent
- Permanental polynomials of graphs
- On the permanental polynomials of some graphs
- Title not available (Why is that?)
- Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
- Title not available (Why is that?)
- Even circuits of prescribed clockwise parity
- Title not available (Why is that?)
- Matchings in graphs on non-orientable surfaces
- Temperature dependence of the Raman frequencies in the \(\gamma \) and \(\beta \) phases of solid nitrogen
- Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
- An accurate and efficient algorithm for the computation of the characteristic polynomial of a general square matrix
- Title not available (Why is that?)
- Efficient computation of the characteristic polynomial
Cited In (9)
- Title not available (Why is that?)
- A primer of Perron--Frobenius theory for matrix polynomials
- Enumeration of permanental sums of lattice graphs
- On rigid matrices and \(U\)-polynomials
- On polynomial \(EP_ r\) matrices
- On the Pólya conversion problem for permanents and determinants
- On characteristic and permanent polynomials of a matrix
- The graphs whose permanental polynomials are symmetric
- Permanents, Determinants, Weighted Isobaric Polynomials and Integer Sequences
This page was built for publication: On the permanental polynomials of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q745925)
