On the permanent of certain (0,1) Toeplitz matrices
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- scientific article; zbMATH DE number 825098 (Why is no real title available?)
- scientific article; zbMATH DE number 3311855 (Why is no real title available?)
- Characterization of even directed graphs
- Combinatorial matrix theory
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
- Permanental compounds and permanents of (0,1)-circulants
- Permanents
- Permanents of cyclic (0,1) matrices
- Qualitative Economics and the Scope of the Correspondence Principle
- Recurrence formulas for permanents of (0,1)-circulants
- The complexity of computing the permanent
Cited in
(21)- Computation of sparse circulant permanents via determinants
- scientific article; zbMATH DE number 2219104 (Why is no real title available?)
- Some results on certain generalized circulant matrices
- Connections between two classes of generalized Fibonacci numbers squared and permanents of (0,1) Toeplitz matrices
- On the permanents of certain circulant matrices and related Toeplitz matrices
- On the parity of permanents of circulant matrices
- On the number of different permanents of some sparse (0,1)-circulant matrices.
- Computing the permanent of the Laplacian matrices of nonbipartite graphs
- A peculiar permutation phenomenon arising from the singular vector entries of a special class of Toeplitz matrices
- Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices
- The combinatorics of a three-line circulant determinant
- 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\)
- scientific article; zbMATH DE number 3849911 (Why is no real title available?)
- Computing permanents via determinants for some classes of sparse matrices
- On very sparse circulant \((0,1)\) matrices
- An efficient tree decomposition method for permanents and mixed discriminants
- Permanental bounds of the Laplacian matrix of trees with given domination number
- Non-integrability of measure preserving maps via Lie symmetries
- 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
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)
