María Dolores Frau
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
María Dolores Frau has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Victor Alvarez
Department of Applied Mathematics I, University of Seville, 41004 Sevilla, Spain
15 shared publications - José Andrés Armario
Departamento de Matemática Aplicada I, Universidad de Sevilla, Sevilla, Spain
13 shared publications - Félix Gudiel
Department of Applied Mathematics I, University of Seville, 41004 Sevilla, Spain
11 shared publications - Maria Belen Guemes
Department of Algebra University of Seville Seville Spain
9 shared publications - Amparo Osuna
Universidad de Sevilla
8 shared publications - Raúl Manuel Falcón
Department of Applied Mathematics I , Universidad de Sevilla , Avenida Reina Mercedes 4 A Sevilla , Spain
6 shared publications
Latest Publications
- 10 November 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (11) , 227
Critical sets of Latin squares based on autoparatopisms
- 10 November 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (11) , 227
Critical sets of Latin squares based on autoparatopisms
- Open Access
- 14 April 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (8) , 857
Hadamard Matrices with Cocyclic Core
Since Horadam and de Launey introduced the cocyclic framework on combinatorial designs in the 1990s, it has revealed itself as a powerful technique for looking for (cocyclic) Hadamard matrices. Ten years later, the series of papers by Kotsireas, Koukouvinos and Seberry about Hadamard matrices with one or two circulant cores introduced a different structured approach to the Hadamard conjecture. This paper is built on both strengths, so that Hadamard matrices with cocyclic cores are introduced and studied. They are proved to strictly include usual Hadamard matrices with one and two circulant cores, and therefore provide a wiser uniform approach to a structured Hadamard conjecture.
- 14 April 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (8) , 857
Open AccessHadamard Matrices with Cocyclic Core
Since Horadam and de Launey introduced the cocyclic framework on combinatorial designs in the 1990s, it has revealed itself as a powerful technique for looking for (cocyclic) Hadamard matrices. Ten years later, the series of papers by Kotsireas, Koukouvinos and Seberry about Hadamard matrices with one or two circulant cores introduced a different structured approach to the Hadamard conjecture. This paper is built on both strengths, so that Hadamard matrices with cocyclic cores are introduced and studied. They are proved to strictly include usual Hadamard matrices with one and two circulant cores, and therefore provide a wiser uniform approach to a structured Hadamard conjecture.
- Open Access
- 6 January 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (2) , 113
Pseudococyclic Partial Hadamard Matrices over Latin Rectangles
The classical design of cocyclic Hadamard matrices has recently been generalized by means of both the notions of the cocycle of Hadamard matrices over Latin rectangles and the pseudococycle of Hadamard matrices over quasigroups. This paper delves into this topic by introducing the concept of the pseudococycle of a partial Hadamard matrix over a Latin rectangle, whose fundamentals are comprehensively studied and illustrated.
- 6 January 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (2) , 113
Open AccessPseudococyclic Partial Hadamard Matrices over Latin Rectangles
The classical design of cocyclic Hadamard matrices has recently been generalized by means of both the notions of the cocycle of Hadamard matrices over Latin rectangles and the pseudococycle of Hadamard matrices over quasigroups. This paper delves into this topic by introducing the concept of the pseudococycle of a partial Hadamard matrix over a Latin rectangle, whose fundamentals are comprehensively studied and illustrated.
- Open Access
- 20 December 2019
- Published by MDPI AG in Mathematics
- Vol. 8 (1) , 24
On Cocyclic Hadamard Matrices over Goethals-Seidel Loops
About twenty-five years ago, Horadam and de Launey introduced the cocyclic development of designs, from which the notion of cocyclic Hadamard matrices developed over a group was readily derived. Much more recently, it has been proved that this notion may naturally be extended to define cocyclic Hadamard matrices developed over a loop. This paper delves into this last topic by introducing the concepts of coboundary, pseudocoboundary and pseudococycle over a quasigroup, and also the notion of the pseudococyclic Hadamard matrix. Furthermore, Goethals-Seidel loops are introduced as a family of Moufang loops so that every Hadamard matrix of Goethals-Seidel type (which is known not to be cocyclically developed over any group) is actually pseudococyclically developed over them. Finally, we also prove that, no matter if they are pseudococyclic matrices, the usual cocyclic Hadamard test is unexpectedly applicable.
- 20 December 2019
- Published by MDPI AG in Mathematics
- Vol. 8 (1) , 24
Open AccessOn Cocyclic Hadamard Matrices over Goethals-Seidel Loops
About twenty-five years ago, Horadam and de Launey introduced the cocyclic development of designs, from which the notion of cocyclic Hadamard matrices developed over a group was readily derived. Much more recently, it has been proved that this notion may naturally be extended to define cocyclic Hadamard matrices developed over a loop. This paper delves into this last topic by introducing the concepts of coboundary, pseudocoboundary and pseudococycle over a quasigroup, and also the notion of the pseudococyclic Hadamard matrix. Furthermore, Goethals-Seidel loops are introduced as a family of Moufang loops so that every Hadamard matrix of Goethals-Seidel type (which is known not to be cocyclically developed over any group) is actually pseudococyclically developed over them. Finally, we also prove that, no matter if they are pseudococyclic matrices, the usual cocyclic Hadamard test is unexpectedly applicable.
- 1 June 2019
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 263, 2-7
Generating binary partial Hadamard matrices
- 1 June 2019
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 263, 2-7
Generating binary partial Hadamard matrices
- 19 September 2018
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 12 (4) , 407-417
A Mixed Heuristic for Generating Cocyclic Hadamard Matrices
- 19 September 2018
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 12 (4) , 407-417
A Mixed Heuristic for Generating Cocyclic Hadamard Matrices
- Open Access
- 17 July 2018
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 68, 149-154
GA Based Robust Blind Digital Watermarking
- 17 July 2018
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 68, 149-154
Open AccessGA Based Robust Blind Digital Watermarking
- Open Access
Gröbner bases and cocyclic Hadamard matrices
Hadamard ideals were introduced in 2006 as a set of nonlinear polynomial equations whose zeros are uniquely related to Hadamard matrices with one or two circulant cores of a given order. Based on this idea, the cocyclic Hadamard test enable us to describe a polynomial ideal that characterizes the set of cocyclic Hadamard matrices over a fixed finite group $G$ of order $4t$. Nevertheless, the complexity of the computation of the reduced Gr\"obner basis of this ideal is $2^{O(t^2)}$, which is excessive even for very small orders. In order to improve the efficiency of this polynomial method, we take advantage of some recent results on the inner structure of a cocyclic matrix to describe an alternative polynomial ideal that also characterizes the mentioned set of cocyclic Hadamard matrices over $G$. The complexity of the computation decreases in this way to $2^{O(n)}$, where $n$ is the number of $G$-coboundaries. Particularly, we design two specific procedures for looking for $\mathbb{Z}_t \times \mathbb{Z}_2^2$-cocyclic Hadamard matrices and $D_{4t}$-cocyclic Hadamard matrices, so that larger cocyclic Hadamard matrices (up to $t \leq 31$) are explicitly obtained.Open AccessGröbner bases and cocyclic Hadamard matrices
Hadamard ideals were introduced in 2006 as a set of nonlinear polynomial equations whose zeros are uniquely related to Hadamard matrices with one or two circulant cores of a given order. Based on this idea, the cocyclic Hadamard test enable us to describe a polynomial ideal that characterizes the set of cocyclic Hadamard matrices over a fixed finite group $G$ of order $4t$. Nevertheless, the complexity of the computation of the reduced Gr\"obner basis of this ideal is $2^{O(t^2)}$, which is excessive even for very small orders. In order to improve the efficiency of this polynomial method, we take advantage of some recent results on the inner structure of a cocyclic matrix to describe an alternative polynomial ideal that also characterizes the mentioned set of cocyclic Hadamard matrices over $G$. The complexity of the computation decreases in this way to $2^{O(n)}$, where $n$ is the number of $G$-coboundaries. Particularly, we design two specific procedures for looking for $\mathbb{Z}_t \times \mathbb{Z}_2^2$-cocyclic Hadamard matrices and $D_{4t}$-cocyclic Hadamard matrices, so that larger cocyclic Hadamard matrices (up to $t \leq 31$) are explicitly obtained. - 29 February 2016
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 24 (10) , 461-472
On Skew E–W Matrices
An E–W matrix M is a ( − 1, 1)‐matrix of order , where t is a positive integer, satisfying that the absolute value of its determinant attains Ehlich–Wojtas' bound. M is said to be of skew type (or simply skew) if is skew‐symmetric where I is the identity matrix. In this paper, we draw a parallel between skew E–W matrices and skew Hadamard matrices concerning a question about the maximal determinant. As a consequence, a problem posted on Cameron's website [7] has been partially solved. Finally, codes constructed from skew E–W matrices are presented. A necessary and sufficient condition for these codes to be self‐dual is given, and examples are provided for lengths up to 52.
- 29 February 2016
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 24 (10) , 461-472
On Skew E–W Matrices
An E–W matrix M is a ( − 1, 1)‐matrix of order , where t is a positive integer, satisfying that the absolute value of its determinant attains Ehlich–Wojtas' bound. M is said to be of skew type (or simply skew) if is skew‐symmetric where I is the identity matrix. In this paper, we draw a parallel between skew E–W matrices and skew Hadamard matrices concerning a question about the maximal determinant. As a consequence, a problem posted on Cameron's website [7] has been partially solved. Finally, codes constructed from skew E–W matrices are presented. A necessary and sufficient condition for these codes to be self‐dual is given, and examples are provided for lengths up to 52.
- 6 January 2016
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 24 (8) , 352-368
On D4t-Cocyclic Hadamard Matrices
- 6 January 2016
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 24 (8) , 352-368
On D4t-Cocyclic Hadamard Matrices