On the permanent of certain (0,1) Toeplitz matrices
From MaRDI portal
Publication:1373310
DOI10.1016/S0024-3795(97)80043-2zbMATH Open0891.65049MaRDI QIDQ1373310FDOQ1373310
Authors: Bruno Codenotti, Valentino Crespi, Giovanni Resta 
Publication date: 18 November 1997
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Determinants, permanents, traces, other special matrix functions (15A15) Numerical computation of determinants (65F40)
Cites Work
- Combinatorial matrix theory
- The complexity of computing the permanent
- Title not available (Why is that?)
- Title not available (Why is that?)
- Permanents
- Qualitative Economics and the Scope of the Correspondence Principle
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
- Characterization of even directed graphs
- Permanents of cyclic (0,1) matrices
- Recurrence formulas for permanents of (0,1)-circulants
- Permanental compounds and permanents of (0,1)-circulants
- Title not available (Why is that?)
Cited In (21)
- Some results on certain generalized circulant matrices
- A peculiar permutation phenomenon arising from the singular vector entries of a special class of Toeplitz matrices
- Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)
- On the permanents of certain circulant matrices and related Toeplitz matrices
- Computing the permanent of the Laplacian matrices of nonbipartite graphs
- Non-integrability of measure preserving maps via Lie symmetries
- On the parity of permanents of circulant matrices
- Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices
- The combinatorics of a three-line circulant determinant
- Computing permanents via determinants for some classes of sparse matrices
- On very sparse circulant \((0,1)\) matrices
- On the number of different permanents of some sparse (0,1)-circulant matrices.
- Connections between two classes of generalized Fibonacci numbers squared and permanents of (0,1) Toeplitz matrices
- Computation of sparse circulant permanents via determinants
- Title not available (Why is that?)
- On the values of permanents of (0, 1) circulant matrices with three ones per row
- Recent developments and open problems in the theory of permanents
- Title not available (Why is that?)
- Permanental bounds of the Laplacian matrix of trees with given domination number
- Recursive and combinational formulas for permanents of general k-tridiagonal Toeplitz matrices
- An efficient tree decomposition method for permanents and mixed discriminants
This page was built for publication: On the permanent of certain \((0,1)\) Toeplitz matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373310)
