The expected characteristic and permanental polynomials of the random Gram matrix

zbMath1300.05163arXiv1309.2599MaRDI QIDQ405292

Jacob G. Martin, E. Rodney Canfield

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.2599

zbMATH Keywords

characteristic and permanental polynomials

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Matrix multiplication via arithmetic progressions
• Permanental polynomials of graphs
• A fast computer algorithm for finding the permanent of adjacency matrices
• Eigenvalue computation in the 20th century
• Edge reconstruction of the Ihara zeta function
• The mutual affinity of random measures
• Log-concavity and related properties of the cycle index polynomials
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
• Approximating the Permanent
• On permanental polynomials of certain random matrices
• Two Algorithmic Results for the Traveling Salesman Problem

This page was built for publication: The expected characteristic and permanental polynomials of the random Gram matrix