Services on Demand
Journal
Article
Spanish (pdf)
Article in xml format
Article references
Automatic translation
Send this article by e-mailIndicators
-
Cited by SciELO -
Access statistics
Related links
-
Similars in
SciELO
Share
Permalink
Revista de Matemática Teoría y Aplicaciones
Print version ISSN 1409-2433
Rev. Mat vol.18 n.2 San José Dec. 2011
Search of Hadamard matrices by Turyn sequences*
*Investigación realizada con el apoyo económico del Deutscher Akademischer Austausch Dienst (DAAD) y la Universidad de Costa Rica.
†Centro de Investigación en Matemática Pura y Aplicada (CIMPA), Universidad de Costa Rica. San José, Costa Rica. E-Mail: eduardojpiza@hotmail.com
Dirección para correspondencia
Resumen
En este artírculo estudiamos las matrices de Hadamard y algunos algoritmos para generarlas. Revisamos varios aspectos teóricos en torno a la conjetura de Hadamard, que afirma que todo entero positivo múltiplo de 4 es un número de Hadamard. Posteriormente se describen los métodos de Kronecker, Sylvester, Paley, Williamson, Goethals-Seidel, Cooper-Wallis, Baumert-Hall, Ehlich y conjuntos diferencia suplementarios. Se establece la criba de Hadamard: 668 es el menor orden para el cual se desconoce si existe una matriz de Hadamard. Finalmente proponemos algoritmos de recocido simulado para hallar matrices de Hadamard a partir de secuencias Turyn. Hallamos excelentes soluciones con este método de búsqueda.
Palabras clave: matrices de Hadamard, recocido simulado, optimización combinatoria.
Abstract
In this paper we study the Hadamard matrices and some algorithms to generate them. We review some theoretical aspects about Hadamard's conjecture, which asserts that every positive integer multiple of 4 is a Hadamard number. Then we describe the methods of Kronecker, Sylvester, Paley, Williamson, Goethals-Seidel, Cooper-Wallis, Baumert-Hall, Ehlich and supplementary difference sets. Subsequently we settle the Hadamard sieve: 668 is lowest order for which is unknown if there exist an Hadamard matrix. Finally we propose a simulated annealing algorithms as alternative to find Hadamard matrices from Turyn sequences. We found excellent solutions with this search method.
Keywords: Hadamard matrices, simulated annealing, combinatorial optimization.
Mathematics Subject Classification: 15B34, 05B20, 90C27.
Ver contenido disponible en pdf
Referencias
[1] Aarts, E.; Korst, J. (1990) Simulated Annealing and Boltzmann Machines. A Stochastic Approach to Combinatorial Optimization and Neural Computing. John Wiley & Sons, Chichester. [ Links ]
[2] Baumert, L.; Golomb, S.W.; Hall, M. (1962) “Discovery of a Hadamard matrix of order 92", Bull. Amer. Math. Soc. 68(3): 237-238. [ Links ]
[3] Baumert, L.D.; Hall, M. (1965) “A new construction method for Hadamard matrices, Bull, Amer. Math. Soc. 71: 169-170. [ Links ]
[4] Belevitch, V. (1950) “Theorem of 2n-terminal networks with application to conference telephony”, Electr. Commun. 26: 231-244. [ Links ]
[5] Cooper, J.; Wallis, J.S. (1972) “A construction for Hadamard arrays”, Bull. Austral. Math. Soc. 7: 269-278. [ Links ]
[6] Djokovic, D.Z. (1993) “Williamson matrices of order 4n for n = 33, 35, 39”, Discrete Math. 115: 267-271. [ Links ]
[7] Ehlich, H. (1965) “Neue Hadamard-Matrizen”, Arch. Math. 16: 34-36. [ Links ]
[8] Faddeev, D.K.; Sominskii, I.S. (1965) Higher Algebra Problems. W.H.Freeman, San Francisco. [ Links ]
[9] Goethals, J.M.; Seidel, J.J. (1967) “Orthogonal matrices with zero diagonal”, Canadian Journal of Mathematics, 19: 1001-1010. [ Links ]
[10] Hadamard, J. (1893) “Résolution d'une question relative aux déterminants", Bull. Sci. Math. 17: 240-246. [ Links ]
[11] Hall, M. (1992) Combinatorial Theory, second edition. Wiley Interscience, New York. [ Links ]
[12] Kharaghani, H.; Tayfeh-Rezaie, B. (2005) “A Hadamard matrix of order 428”, Journal of Combinatorial Designs 13: 435-440. [ Links ]
[13] van Lint, J.H.; Wilson, R.M. (2001) A Course in Combinatorics, second edition. Cambridge University Press, U.K. [ Links ]
[14] Miyamoto, M.A. (1991) “Construction of Hadamard matrices”, Journal of Combinatorial Theory, Series A, 57(1), 86-108. [ Links ]
[15] Paley, R. (1933) “On orthogonal matrices”, Journal Math. Phys. 12:311-320. [ Links ]
[16] Seberry, J.; Yamada, M. (1992) “Hadamard matrices, sequences, and block designs”, en: J.H. Dinitz & D.R. Stinson (Eds.) Contemporary Design Theory: A Collection of Surveys, Wiley, New York: 431-560. [ Links ]
[17] Turyn, R.J. (1972) “An infinite class of Williamson matrices", Journal of Combinatorial Theory, Series A, 12: 319-321. [ Links ]
[18] Turyn, R.J. (1974) “Hadamard matrices, Baumert-Hall units, foursymbols sequences, pulse compression, and surface wave enconding”, Journal of Combinatorial Theory, Series A, 16: 313-333. [ Links ]
[19] Wallis, J.; Whiteman, A.L. (1972) “Some classes of Hadamard matrices with constant diagonal”, Bull. Austral. Math. Soc. 7: 233-249. [ Links ]
[20] Williamson, J. (1944) “Hadamard's determinant theorem and the sum of four squares”, Duke Mathematical Journal, 11: 65-81. [ Links ]
Correspondencia a: Eduardo Piza. Centro de Investigación en Matemática Pura y Aplicada (CIMPA), Universidad de Costa Rica. San José, Costa Rica. E-Mail: eduardojpiza@hotmail.com
Received: 26 Aug 2010; Revised: 9 May 2011; Accepted: 10 May 2011
