Palabras clave
simulated annealing
combinatorial optimization
matrices de Hadamard
recocido simulado
optimización
combinatoria
Cómo citar
Resumen
En este artículo 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.
Citas
Aarts, E.; Korst, J. (1990) Simulated Annealing and Boltzmann Machines. A Stochastic Approach to Combinatorial Optimization and Neural Computing. John Wiley & Sons, Chichester.
Baumert, L.; Golomb, S.W.; Hall, M. (1962) “Discovery of a Hadamard matrix of order 92”, Bull. Amer. Math. Soc. 68(3): 237–238.
Baumert, L.D.; Hall, M. (1965) “A new construction method for Hadamard matrices, Bull. Amer. Math. Soc. 71: 169–170.
Belevitch, V. (1950) “Theorem of 2n-terminal networks with application to conference telephony”, Electr. Commun. 26: 231–244.
Cooper, J.; Wallis, J.S. (1972) “A construction for Hadamard arrays”, Bull. Austral. Math. Soc. 7: 269–278.
Djokovic, D.Z. (1993) “Williamson matrices of order 4n for n = 33, 35, 39”, Discrete Math. 115: 267–271.
Ehlich, H. (1965) “Neue Hadamard-Matrizen”, Arch. Math. 16: 34–36.
Faddeev, D.K.; Sominskii, I.S. (1965) Higher Algebra Problems. W.H. Freeman, San Francisco.
Goethals, J.M.; Seidel, J.J. (1967) “Orthogonal matrices with zero diagonal”, Canadian Journal of Mathematics, 19: 1001–1010.
Hadamard, J. (1893) “Résolution d’une question relative aux déterminants”, Bull. Sci. Math. 17: 240–246.
Hall, M. (1992) Combinatorial Theory, second edition. Wiley Interscience, New York.
Kharaghani, H.; Tayfeh-Rezaie, B. (2005) “A Hadamard matrix of order 428”, Journal of Combinatorial Designs 13: 435–440.
van Lint, J.H.; Wilson, R.M. (2001) A Course in Combinatorics, second edition. Cambridge University Press, U.K.
Miyamoto, M.A. (1991)“ Construction of Hadamard matrices”, Journal of Combinatorial Theory, Series A, 57(1), 86–108.
Paley, R. (1933) “On orthogonal matrices”, Journal Math. Phys. 12: 311–320.
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.
Turyn, R.J. (1972) “An infinite class of Williamson matrices”, Journal of Combinatorial Theory, Series A, 12: 319–321.
Turyn, R.J. (1974) “Hadamard matrices, Baumert-Hall units, four-symbols sequences, pulse compression, and surface wave enconding”, Journal of Combinatorial Theory, Series A, 16: 313–333.
Wallis, J.; Whiteman, A.L. (1972) “Some classes of Hadamard matrices with constant diagonal”, Bull. Austral. Math. Soc. 7: 233–249.
Williamson, J. (1944) “Hadamard’s determinant theorem and the sum of four squares”, Duke Mathematical Journal, 11: 65–81.
Comentarios
Esta obra está bajo una licencia internacional Creative Commons Atribución-NoComercial-CompartirIgual 4.0.
Derechos de autor 2011 Eduardo Piza