dc.creator | Álvarez Solano, Víctor | es |
dc.creator | Armario Sampalo, José Andrés | es |
dc.creator | Falcón Ganfornina, Raúl Manuel | es |
dc.creator | Frau García, María Dolores | es |
dc.creator | Gudiel Rodríguez, Félix | es |
dc.creator | Güemes Alzaga, María Belén | es |
dc.creator | Osuna Lucena, Amparo | es |
dc.date.accessioned | 2019-10-14T10:23:40Z | |
dc.date.available | 2019-10-14T10:23:40Z | |
dc.date.issued | 2019 | |
dc.identifier.citation | Á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. (2019). Generating binary partial Hadamard matrices. Discrete Applied Mathematics, 263 (june 2019), 2-7. | |
dc.identifier.issn | 0166-218X | es |
dc.identifier.uri | https://hdl.handle.net/11441/89658 | |
dc.description.abstract | This paper deals with partial binary Hadamard matrices. Although there is a fast simple
way to generate about a half (which is the best asymptotic bound known so far, see de
Launey (2000) and de Launey and Gordon (2001)) of a full Hadamard matrix, it cannot
provide larger partial Hadamard matrices beyond this bound. In order to overcome such
a limitation, we introduce a particular subgraph Gt of Ito’s Hadamard Graph Δ(4t) (Ito,
1985), and study some of its properties,which facilitates that a procedure may be designed
for constructing large partial Hadamard matrices. The key idea is translating the problem
of extending a given clique in Gt into a Constraint Satisfaction Problem, to be solved
by Minion (Gent et al., 2006). Actually, iteration of this process ends with large partial
Hadamard matrices, usually beyond the bound of half a full Hadamard matrix, at least as
our computation capabilities have led us thus far. | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Elsevier | es |
dc.relation.ispartof | Discrete Applied Mathematics, 263 (june 2019), 2-7. | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Partial Hadamard matrix | es |
dc.subject | Hadamard Graph | es |
dc.subject | Clique | es |
dc.subject | Constraint satisfaction problem | es |
dc.title | Generating binary partial Hadamard matrices | es |
dc.type | info:eu-repo/semantics/article | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/submittedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) | es |
dc.relation.publisherversion | https://www.sciencedirect.com/science/article/pii/S0166218X18306516 | es |
dc.identifier.doi | 10.1016/j.dam.2018.12.008 | es |
idus.format.extent | 6 | es |
dc.journaltitle | Discrete Applied Mathematics | es |
dc.publication.volumen | 263 | es |
dc.publication.issue | june 2019 | es |
dc.publication.initialPage | 2 | es |
dc.publication.endPage | 7 | es |