Artículo
On permanents of Sylvester Hadamard matrices
Autor/es | Armario Sampalo, José Andrés |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Fecha de publicación | 2013 |
Fecha de depósito | 2021-06-29 |
Publicado en |
|
Resumen | 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. |
Agencias financiadoras | Junta de Andalucía Ministerio de Ciencia, Innovación y Universidades (MICINN). España |
Identificador del proyecto | FQM-016
P07-FQM-02980 MTM2008-06578 |
Cita | Armario Sampalo, J.A. (2013). On permanents of Sylvester Hadamard matrices. ArXiv.org, arXiv:1311.2427 |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
On permanents of Sylvester ... | 183.9Kb | [PDF] | Ver/ | |