Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices
DOI10.1016/J.LAA.2008.10.029zbMATH Open1163.65022OpenAlexW2093282530WikidataQ59903048 ScholiaQ59903048MaRDI QIDQ999813FDOQ999813
Authors: Moshe Schwartz 
Publication date: 10 February 2009
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2008.10.029
Recommendations
- The Hafnian of Toeplitz matrices of special type, perfect matchings and Bessel polynomials
- Efficient computation of the permanent of a sparse matrix
- Computing the permanent of (some) complex matrices
- Computation of sparse circulant permanents via determinants
- On the permanent of certain \((0,1)\) Toeplitz matrices
Determinants, permanents, traces, other special matrix functions (15A15) Matrices of integers (15B36) Numerical computation of determinants (65F40)
Cites Work
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- Combinatorial matrix theory
- Dimer problem in statistical mechanics-an exact result
- Title not available (Why is that?)
- The complexity of computing the permanent
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Permanents
- Constrained Codes as Networks of Relations
- Title not available (Why is that?)
- An exploration of the permanent-determinant method
- On the permanent of certain \((0,1)\) Toeplitz matrices
- Metrics on permutations, a survey
- Permanents of cyclic (0,1) matrices
- On the asymptotic eigenvalue distribution of Toeplitz matrices
- Recurrence formulas for permanents of (0,1)-circulants
- Permanental compounds and permanents of (0,1)-circulants
- Quelques résultats dans la métrique des permutations
- Title not available (Why is that?)
Cited In (11)
- Some results on certain generalized circulant matrices
- Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices
- Computing the ball size of frequency permutations under Chebyshev distance
- Coding for locality in reconstructing permutations
- The Hafnian of Toeplitz matrices of special type, perfect matchings and Bessel polynomials
- Inductive proof of Borchardt's theorem
- The Hafnian master theorem
- New permanent approximation inequalities via identities
- Enumeration of even and odd chord diagrams
- On the permanents of circulant and degenerate Schur matrices
- An efficient tree decomposition method for permanents and mixed discriminants
This page was built for publication: Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q999813)
