Repositorio de producción científica de la Universidad de Sevilla

Generating partial Hadamard matrices as solutions to a Constraint Satisfaction Problem characterizing cliques

 

Advanced Search
 
Opened Access Generating partial Hadamard matrices as solutions to a Constraint Satisfaction Problem characterizing cliques
Cites
Show item statistics
Icon
Export to
Author: Á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
Department: Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. Departamento de álgebra
Date: 2017-07
Published in: X Encuentro Andaluz de Matemática Discreta (2017), p 103-106
ISBN/ISSN: 978-84-697-4743-8
Document type: Presentation
Abstract: 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.
Cite: Á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).
Size: 562.3Kb
Format: PDF

URI: https://hdl.handle.net/11441/69238

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)