Article
On permanents of Sylvester Hadamard matrices
Author/s | Armario Sampalo, José Andrés
![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Department | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Publication Date | 2013 |
Deposit Date | 2021-06-29 |
Published in |
|
Abstract | It is well-known that the evaluation of the permanent of an arbitrary (−1, 1)-
matrix is a formidable problem. Ryser’s formula is one of the fastest known general
algorithms for computing permanents. In this paper, Ryser’s ... It is well-known that the evaluation of the permanent of an arbitrary (−1, 1)- matrix is a formidable problem. Ryser’s formula is one of the fastest known general algorithms for computing permanents. In this paper, Ryser’s formula has been rewritten for the special case of Sylvester Hadamard matrices by using their cocyclic construction. The rewritten formula presents an important reduction in the number of sets of r distinct rows of the matrix to be considered. However, the algorithm needs a preprocessing part which remains time-consuming in general. |
Funding agencies | Junta de Andalucía Ministerio de Ciencia, Innovación y Universidades (MICINN). España |
Project ID. | FQM-016
![]() P07-FQM-02980 ![]() MTM2008-06578 ![]() |
Citation | Armario Sampalo, J.A. (2013). On permanents of Sylvester Hadamard matrices. ArXiv.org, arXiv:1311.2427 |
Files | Size | Format | View | Description |
---|---|---|---|---|
On permanents of Sylvester ... | 183.9Kb | ![]() | View/ | |