On the number of different permanents of some sparse (0,1)-circulant matrices.

DOI10.1016/S0024-3795(03)00649-9zbMath1037.15007MaRDI QIDQ1414708

Giovanni Resta, Giovanni Sburlati

Publication date: 4 December 2003

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

permanent\((0,1)\)-matrixpermanent inequalitysparse circulant matrices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Determinants, permanents, traces, other special matrix functions (15A15) Miscellaneous inequalities involving matrices (15A45) Matrices of integers (15B36)

Related Items

On very sparse circulant \((0,1)\) matrices ⋮ On the parity of permanents of circulant matrices ⋮ An update on Minc's survey of open problems involving permanents ⋮ On prime factors of determinants of circulant matrices ⋮ On the values of permanents of (0, 1) circulant matrices with three ones per row

Cites Work

• Unnamed Item
• The complexity of computing the permanent
• How fast can one compute the permanent of circulant matrices?
• On the permanent of certain \((0,1)\) Toeplitz matrices
• Computation of sparse circulant permanents via determinants
• The Lattice Point Covering Theorem for Rectangles

This page was built for publication: On the number of different permanents of some sparse (0,1)-circulant matrices.