On the permanent of certain \((0,1)\) Toeplitz matrices
From MaRDI portal
Publication:1373310
DOI10.1016/S0024-3795(97)80043-2zbMath0891.65049MaRDI QIDQ1373310
Bruno Codenotti, Giovanni Resta, Valentino Crespi
Publication date: 18 November 1997
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Numerical computation of determinants (65F40)
Related Items
On very sparse circulant \((0,1)\) matrices, Recursive and combinational formulas for permanents of general k-tridiagonal Toeplitz matrices, Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\), An efficient tree decomposition method for permanents and mixed discriminants, On the number of different permanents of some sparse (0,1)-circulant matrices., Computing the permanent of the Laplacian matrices of nonbipartite graphs, Non-integrability of measure preserving maps via Lie symmetries, Permanental bounds of the Laplacian matrix of trees with given domination number, On the parity of permanents of circulant matrices, The combinatorics of a three-line circulant determinant, Some results on certain generalized circulant matrices, Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices, On the values of permanents of (0, 1) circulant matrices with three ones per row, Computation of sparse circulant permanents via determinants
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of computing the permanent
- Recurrence formulas for permanents of (0,1)-circulants
- Characterization of even directed graphs
- Permanental compounds and permanents of (0,1)-circulants
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
- Permanents
- Permanents of cyclic (0,1) matrices
- Qualitative Economics and the Scope of the Correspondence Principle
