Turyn type sequences
Αποθηκεύτηκε σε:
| Συγγραφείς: | , |
|---|---|
| Μορφή: | artículo original |
| Κατάσταση: | Versión publicada |
| Ημερομηνία έκδοσης: | 2019 |
| Περιγραφή: | 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. |
| Χώρα: | Portal de Revistas UCR |
| Ίδρυμα: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Γλώσσα: | Español |
| OAI Identifier: | oai:archivo.portal.ucr.ac.cr:article/38317 |
| Διαθέσιμο Online: | https://archivo.revistas.ucr.ac.cr/index.php/matematica/article/view/38317 |
| Λέξη-Κλειδί : | Turyn type sequences Goethals-Seidel theorem Hadamard matrices simulated annealing combinatorial optimization secuencias tipo Turyn teorema de Goethals-Seidal matrices de Hadamard recocido simulado optimización combinatoria |