Consuelo Martínez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Consuelo Martínez has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
Efim Zelmanov
SICM, Southern University of Science and Technology
4 shared publications- Efim Zelmanov
Department of Mathematics, University of California San Diego, La Jolla, California 92093-0112 – and – Korean Institute of Advaced Study, Seoul, South Korea – and – King Abdulaziz, Jeddah, Saudi Arabia
3 shared publications Santos González
Oviedo University
3 shared publications- Alejandro Piñera Nicolás
Departamento de Matemáticas, Universidad de Oviedo, Oviedo, Spain
2 shared publications - Beatriz García García
University of Oviedo
2 shared publications - Cristina García Pillado
University of Oviedo
2 shared publications
Latest Publications
- 30 October 2026
- Published by World Scientific Pub Co Pte Ltd in Communications in Contemporary Mathematics
Superconformal algebras over arbitrary rings of coefficients
We define analogs of superconformal algebras over an arbitrary commutative associative superalgebra. In the case that the commutative associative superalgebras are finitely generated, the universal central extensions of these analogs are finitely presented. In particular, we show that all known superconformal algebras are finitely presented.
- 30 October 2026
- Published by World Scientific Pub Co Pte Ltd in Communications in Contemporary Mathematics
Superconformal algebras over arbitrary rings of coefficients
We define analogs of superconformal algebras over an arbitrary commutative associative superalgebra. In the case that the commutative associative superalgebras are finitely generated, the universal central extensions of these analogs are finitely presented. In particular, we show that all known superconformal algebras are finitely presented.
- 31 May 2026
- Published by Springer Nature
- p. 72-88
The Non-asymptotic Landscape of Abelian Codes: A Framework for (F, G)-Goodness
- 31 May 2026
- Published by Springer Nature
- p. 72-88
The Non-asymptotic Landscape of Abelian Codes: A Framework for (F, G)-Goodness
- Open Access
Cyclicity of Binary Group Codes
In this paper, we study the cyclicity of binary group codes, identifying them as ideals in a group algebra. We focus on the construction of codes, proving that they are self-dual group codes over the abelian group . We demonstrate that for even integers , if the polynomial splits into self-reciprocal irreducible factors, these codes are not permutationally equivalent to any cyclic code. Additionally, we present computational results for binary group codes of length using the MAGMA software (V2.29-4). These results confirm that while all cyclic codes in this range are equivalent to abelian group codes, there exist non-cyclic group codes that cannot be realized as ideals in a cyclic group algebra, highlighting the strictly larger scope of the class of group codes.Open AccessCyclicity of Binary Group Codes
In this paper, we study the cyclicity of binary group codes, identifying them as ideals in a group algebra. We focus on the construction of codes, proving that they are self-dual group codes over the abelian group . We demonstrate that for even integers , if the polynomial splits into self-reciprocal irreducible factors, these codes are not permutationally equivalent to any cyclic code. Additionally, we present computational results for binary group codes of length using the MAGMA software (V2.29-4). These results confirm that while all cyclic codes in this range are equivalent to abelian group codes, there exist non-cyclic group codes that cannot be realized as ideals in a cyclic group algebra, highlighting the strictly larger scope of the class of group codes. - 21 January 2026
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
Permutation decoding in group codes
The aim of this work is to study a permutation decoding algorithm for group codes. We focus exclusively on the case where [ ] is semisimple. In this setting, [ ] decomposes as the direct sum of a two-sided ideal associated with a group code and another two-sided ideal, and both of them are generated by central idempotent elements of [ ]. Furthermore, we define the notion of a GPD-set, which is essential for the construction of a generalized permutation decoding algorithm. This algorithm can be applied in certain cases where the classical permutation decoding algorithm is not applicable.
- 21 January 2026
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
Permutation decoding in group codes
The aim of this work is to study a permutation decoding algorithm for group codes. We focus exclusively on the case where [ ] is semisimple. In this setting, [ ] decomposes as the direct sum of a two-sided ideal associated with a group code and another two-sided ideal, and both of them are generated by central idempotent elements of [ ]. Furthermore, we define the notion of a GPD-set, which is essential for the construction of a generalized permutation decoding algorithm. This algorithm can be applied in certain cases where the classical permutation decoding algorithm is not applicable.
- Open Access
- 7 July 2025
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 108
Decoding algorithms in group codes
- 7 July 2025
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 108
Open AccessDecoding algorithms in group codes
- Open Access
- 7 July 2025
- Published by Springer Nature in Complex Analysis and Operator Theory
- Vol. 19 (6) , 1-18
On a Ternary Octonion Algebra
Following a research direction proposed in an earlier work, the ternary octonion algebra $$\mathfrak {O}$$ , which is a ternary composition algebra, is considered. By hand and applying computational linear algebra on matrices, 1-identities and 2-identities of $$\mathfrak {O}$$ are established. From some of these identities, the non-conservativeness of $$\mathfrak {O}$$ and of some of its binary reduced algebras, which are binary standard composition algebras of types II and III, is proved. Also from identities of $$\mathfrak {O}$$ , using computational linear algebra based on the representation theory of the symmetric group, ternary enveloping algebras for ternary Maltsev algebras are constructed.- 7 July 2025
- Published by Springer Nature in Complex Analysis and Operator Theory
- Vol. 19 (6) , 1-18
Open AccessOn a Ternary Octonion Algebra
Following a research direction proposed in an earlier work, the ternary octonion algebra $$\mathfrak {O}$$ , which is a ternary composition algebra, is considered. By hand and applying computational linear algebra on matrices, 1-identities and 2-identities of $$\mathfrak {O}$$ are established. From some of these identities, the non-conservativeness of $$\mathfrak {O}$$ and of some of its binary reduced algebras, which are binary standard composition algebras of types II and III, is proved. Also from identities of $$\mathfrak {O}$$ , using computational linear algebra based on the representation theory of the symmetric group, ternary enveloping algebras for ternary Maltsev algebras are constructed. - 29 July 2023
- Published by Springer Nature
- p. 171-183
Growth Functions of Jordan Algebras
- Open Access
Algebras of length one
If $\A$ is an algebra over a field $\F$ and $\s$ is a generating set of $\A$, the length of $\s$ indicates the maximal length needed to express an arbitrary element of $\A$ as a linear combination of words in the elements of $\s$. The length of an algebra $\A$ is defined as the maximum of lengths of its generating sets. In this paper (not necessarily associative) algebras, over fields of arbitrary characteristic, having length equal to 1 are determined.Open AccessAlgebras of length one
If $\A$ is an algebra over a field $\F$ and $\s$ is a generating set of $\A$, the length of $\s$ indicates the maximal length needed to express an arbitrary element of $\A$ as a linear combination of words in the elements of $\s$. The length of an algebra $\A$ is defined as the maximum of lengths of its generating sets. In this paper (not necessarily associative) algebras, over fields of arbitrary characteristic, having length equal to 1 are determined. - 28 November 2019
- Published by Springer Nature in Communications in Computer and Information Science
- p. 83-96
Group Codes
- 28 November 2019
- Published by Springer Nature in Communications in Computer and Information Science
- p. 83-96
Group Codes
- 14 June 2019
- Published by Cambridge University Press (CUP) in Glasgow Mathematical Journal
- Vol. 62 (S1) , S6-S13
JORDAN BIMODULES OVER THE SUPERALGEBRA M1|1
Let F be a field of characteristic different of 2 and let M1|1(F)(+) denote the Jordan superalgebra of 2 × 2 matrices over the field F. The aim of this paper is to classify irreducible (unital and one-sided) Jordan bimodules over the Jordan superalgebra M1|1(F)(+).
- 14 June 2019
- Published by Cambridge University Press (CUP) in Glasgow Mathematical Journal
- Vol. 62 (S1) , S6-S13
JORDAN BIMODULES OVER THE SUPERALGEBRA M1|1
Let F be a field of characteristic different of 2 and let M1|1(F)(+) denote the Jordan superalgebra of 2 × 2 matrices over the field F. The aim of this paper is to classify irreducible (unital and one-sided) Jordan bimodules over the Jordan superalgebra M1|1(F)(+).