Ponencia
Generating partial Hadamard matrices as solutions to a Constraint Satisfaction Problem characterizing cliques
Autor/es | Álvarez Solano, Víctor
Armario Sampalo, José Andrés Falcón Ganfornina, Raúl Manuel Frau García, María Dolores Gudiel Rodríguez, Félix Güemes Alzaga, María Belén Osuna Lucena, Amparo |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) Universidad de Sevilla. Departamento de álgebra |
Fecha de publicación | 2017-07 |
Fecha de depósito | 2018-01-19 |
Publicado en |
|
ISBN/ISSN | 978-84-697-4743-8 |
Resumen | A procedure is described looking for partial Hadamard matrices, as cliques of a particular subgraph Gt of Ito’s Hadamard Graph Δ(4t) [9]. The key idea is translating the problem of extending a given clique Cm to a larger ... A procedure is described looking for partial Hadamard matrices, as cliques of a particular subgraph Gt of Ito’s Hadamard Graph Δ(4t) [9]. The key idea is translating the problem of extending a given clique Cm to a larger clique of size m+ 1 in Gt, into a constraint satisfaction problem, and look for a solution to this problem by means of Minion [6]. Iteration of this process usually ends with a large partial Hadamard matrix. |
Agencias financiadoras | Junta de Andalucía |
Identificador del proyecto | FMQ-016 |
Cita | Álvarez Solano, V., Armario Sampalo, J.A., Falcón Ganfornina, R.M., Frau García, M.D., Gudiel Rodríguez, F., Güemes Alzaga, M.B. y Osuna Lucena, A. (2017). Generating partial Hadamard matrices as solutions to a Constraint Satisfaction Problem characterizing cliques. En X Encuentro Andaluz de Matemática Discreta, La Línea (Cádiz). |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Generating partial Hadamard ... | 562.3Kb | [PDF] | Ver/ | |