Ir al contenido

Documat


Secuencias tipo Turyn

  • SEGURA UGALDE, ESTEBAN [1] ; PIZA VOLIO, EDUARDO [1]
    1. [1] Universidad de Costa Rica

      Universidad de Costa Rica

      Hospital, Costa Rica

  • Localización: Revista de Matemática: Teoría y Aplicaciones, ISSN 2215-3373, ISSN-e 2215-3373, Vol. 26, Nº. 2, 2019 (Ejemplar dedicado a: Revista de Matemática: Teoría y Aplicaciones), págs. 253-279
  • Idioma: español
  • DOI: 10.15517/rmta.v26i2.38317
  • Títulos paralelos:
    • Turyn type sequences
  • Enlaces
  • Resumen
    • español

      En este artículo estudiamos fundamentalmente las denominadas secuencias tipo Turyn y algunos algoritmos heurísticos para generarlas. La importancia de estas secuencias estriba, al menos, en el hecho de quepueden ser empleadas en la construcción de algunas matrices de Hadamard de órdenes 4(3m - 1), donde m es el largo de la secuencia tipo Turyn a través del uso del teorema de Goethals-Seidal. Simplificamos la demostración del teorema de Turyn (ver Teorema 3). Además, hallamos algunos resultados teóricos interesantes (ver Teorema 5). Finalmente, desarrollamos varios algoritmos heurísticos eficientes, comparables a los algoritmos ya conocidos, que generan secuencias tipo Turyn de tamañosmenores o iguales a 40.

    • English

      In this paper we study the so called Turyn type sequences and some heuristics algorithms to generate them. The importance of these sequences lies, at least, in the fact that they can be used to construct some Hadamard matrices of order 4(3m - 1), where m is the length of the Turyn type sequence through the theorem of Goethals-Seidal. We simplify the proof of Turyn’s theorem (see Theorem 3). In addition, we find some interesting theoretical results (see Theorem 5). Finally, we develop several efficient heuristic algorithms, comparable to the algorithms already known, that generate Turyn type sequences of sizes less than or equal to 40.

  • Referencias bibliográficas
    • E. Aarts, J. Korst, Simulated Annealing and Boltzmann Machines. A Stochastic Approach to Combinatorial Optimization and Computing. John Wiley...
    • S. Agaian, H. Sarukhanyan, K. Egiazarian, J. Astola, Applications of Hadamard matrices in communication systems, in: Hadamard Transforms,...
    • D. Best, D.Z. Ðokovi´c, H. Kharaghani, H. Ramp, Turyn type sequences: classification, enumeration and construction, Journal of Combinatorial...
    • R. P. Brent, J. H. Osborn, On minors of maximal determinant matrices, Journal of Integer Sequences 16 (2013), article 13.4.2.
    • W. A. Coppel, Number Theory: An Introduction to Mathematics, 2nd edition, Springer, Heidelberg, 2009.
    • H. Evangelaras, C. Koukouvinos, J. Seberry, Applications of Hadamard matrices, Journal of Telecommunications and Information Technology (2003),...
    • H. Evangelaras, C. Koukouvinos, On the use of Hadamard matrices in factorial designs, Utilitas Mathematica 64 (2003).
    • W. de Launey, On the asymptotic existence of Hadamard matrices, J. Combin. Theory Ser. A 116 (2009), no. 4, 1002–1008.
    • D. Z. Ðokovi´c, Williamson matrices of order 4n for n = 33, 35, 39, Discrete Math. 115 (1993), no. 1-3, 267–271.
    • D. Z. Ðokovi´c, Hadamard matrices of order 764 exist, Combinatorica 28 (2008), no. 4, 487–489.
    • D. Z. Ðokovi´c, Supplementary difference sets with symmetry for Hadamard matrices, Operators and Matrices 3 (2009), no. 4, 557–569.
    • D. K. Faddeev, I. S. Sominskii, Problems in higher algebra, W.H. Freeman, San Francisco, 1965, p. 331.
    • J. M. Goethals, J. J. Seidel, Orthogonal matrices with zero diagonal, Canadian Journal of Mathematics 19 (1967), 1001–1010.
    • J. Hadamard, Résolution d’une question relative aux déterminants, Bull. Sci. Math. 2 (1893), 240–246.
    • J. Horton, C. Koukouvinos, J. Seberry, A search for Hadamard matrices constructed from Williamson matrices, Bulletin Institute of Combinatorics...
    • W. M. Kantor, Automorphism groups of Hadamard matrices, Journal of Combinatorial Theory 6 (1969), no. 3, 279–281.
    • H. Kharaghani, B. Tayfeh-Rezaie, A Hadamard Matrix of Order 428, Journal of Combinatorial Designs 13 (2005), no. 6, 435–440.
    • H. Kharaghani, B. Tayfeh-Rezaie, Hadamard matrices of order 32, Journal of Combinatorial Designs 21 (2012), no. 5, 212-221.
    • E. Kikianty, Hermite-Hadamard inequality in the geometry of Banach spaces, Ph.D. Thesis, University of Pretoria, 2010.
    • C. Koukouvinos, S. Kounias, J. Seberry, C. H. Yang, J. Yang, On sequences with zero autocorrelation, Designs, Codes and Criptography 4 (1994),...
    • C. Koukouvinos, D. E. Simos, Encryption schemes based on Hadamard matrices with circulant cores, Journal of Applied Mathematics & Bioinformatics...
    • S. London, Constructing new Turyn type sequences, T-sequences and Hadamard matrices, Ph.D. Thesis, University of Illinois at Chicago, 2013.
    • M. A. Miyamoto, A construction of Hadamard matrices, J. Combin. Theory Ser. A 57 (1991), no. 1, 86–108.
    • E. Piza, Búsqueda de matrices de Hadamard a través de secuencias de Turyn, Revista de Matemática: Teoría y Aplicaciones 18 (2011), no. 2,...
    • R. Paley, On orthogonal matrices, Journal Math. Phys. 12 (1933), no. 1-4, 311–320.
    • J. Seberry, M. Yamada, Hadamard matrices, sequences, and block designs, Contemporary Design Theory: A Collection of Surveys, John Wiley &...
    • J. Wallis, On supplementary difference sets, Aequationes Mathematicae 8 (1972), no. 3, 242–257.
    • N. J. Sloane, Multiplexing methods in spectroscopy, Mathematics Magazine 52 (1979), no. 2 ,71–80.
    • R. J. Turyn, Hadamard matrices, Baumert-Hall units, four-symbols sequences, pulse compression, and surface wave enconding, J. Combin. Theory...

Fundación Dialnet

Mi Documat

Opciones de artículo

Opciones de compartir

Opciones de entorno