Iván Ruiz Campos
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Iván Ruiz Campos has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Cándido Martín González
Departamento de Álgebra, Geometría y Topología, Universidad de Málaga, Málaga, Spain
10 shared publications - Dolores Martín Barquero
Departamento de Matemática Aplicada, Escuela de Ingenierías Industriales, Universidad de Málaga, Málaga, Spain
10 shared publications - Cristóbal Gil Canto
Departamento de Matemática Aplicada, E.T.S. Ingeniería Informática, Universidad de Málaga, Málaga, Spain
6 shared publications - Alfilgen Sebandal
Research Center for Theoretical Physics in Jagna Bohol, Jagna, Philippines
3 shared publications - Daniel Gonçalves
Universidade Federal de Santa Catarina, Florianópolis, Brazil
3 shared publications - Maria Inez Cardoso Gonçalves
Departamento de Matemática, Universidade Federal de Santa Catarina, Florianópolis, Brazil
3 shared publications
Latest Publications
- Open Access
Solenoids in automorphism groups of evolution algebras
Let A be an evolution algebra (possibly infinite-dimensional) equipped with a fixed natural basis B, and let E be the associated graph defined by Elduque and Labra. We describe the group of automorphisms of A that are diagonalizable with respect to B. This group arises as the inverse limit of a functor (a diagram) from the category associated with the graph E to the category of groups. In certain cases, this group can be realized as a dyadic solenoid. Additionally, we investigate the automorphisms that permute (and possibly scale) the elements of B. In particular, for algebras satisfying the 2LI condition, we provide a complete description of their automorphism group.
Open AccessSolenoids in automorphism groups of evolution algebras
Let A be an evolution algebra (possibly infinite-dimensional) equipped with a fixed natural basis B, and let E be the associated graph defined by Elduque and Labra. We describe the group of automorphisms of A that are diagonalizable with respect to B. This group arises as the inverse limit of a functor (a diagram) from the category associated with the graph E to the category of groups. In certain cases, this group can be realized as a dyadic solenoid. Additionally, we investigate the automorphisms that permute (and possibly scale) the elements of B. In particular, for algebras satisfying the 2LI condition, we provide a complete description of their automorphism group.
- 26 December 2024
- Published by Springer Nature in Bulletin of the Brazilian Mathematical Society, New Series
- Vol. 56 (1) , 1-41
Hopf Algebras and Associative Representations of Two-Dimensional Evolution Algebras
- 26 December 2024
- Published by Springer Nature in Bulletin of the Brazilian Mathematical Society, New Series
- Vol. 56 (1) , 1-41
Hopf Algebras and Associative Representations of Two-Dimensional Evolution Algebras
- Open Access
- 24 October 2024
- Published by Springer Nature in Results in Mathematics
- Vol. 79 (8) , 1-8
The Algebraic Entropies of the Leavitt Path Algebra and the Graph Algebra Agree
In this note we prove that the algebras $$L_K(E)$$ and KE have the same entropy. Entropy is always referred to the standard filtrations in the corresponding kind of algebra. The main argument leans on (1) the holomorphic functional calculus; (2) the relation of entropy with suitable norm of the adjacency matrix; and (3) the Cohn path algebras which yield suitable bounds for the algebraic entropies.- 24 October 2024
- Published by Springer Nature in Results in Mathematics
- Vol. 79 (8) , 1-8
Open AccessThe Algebraic Entropies of the Leavitt Path Algebra and the Graph Algebra Agree
In this note we prove that the algebras $$L_K(E)$$ and KE have the same entropy. Entropy is always referred to the standard filtrations in the corresponding kind of algebra. The main argument leans on (1) the holomorphic functional calculus; (2) the relation of entropy with suitable norm of the adjacency matrix; and (3) the Cohn path algebras which yield suitable bounds for the algebraic entropies. - Open Access
- 14 June 2024
- Published by Springer Nature in Results in Mathematics
- Vol. 79 (5) , 1-30
Algebraic Entropy of Path Algebras and Leavitt Path Algebras of Finite Graphs
The Gelfand–Kirillov dimension is a well established quantity to classify the growth of infinite dimensional algebras. In this article we introduce the algebraic entropy for path algebras. For the path algebras, Leavitt path algebras and the path algebra of the extended (double) graph, we compare the Gelfand–Kirillov dimension and the entropy. We show that path algebras over finite graphs can be classified to be of finite dimension, finite Gelfand–Kirillov dimension or finite algebraic entropy. We show indeed how these three quantities are dependent on cycles inside the graph. Moreover we show that the algebraic entropy is conserved under Morita equivalence but perhaps for a different filtration. In addition we give several examples of the entropy in path algebras and Leavitt path algebras.
- 14 June 2024
- Published by Springer Nature in Results in Mathematics
- Vol. 79 (5) , 1-30
Open AccessAlgebraic Entropy of Path Algebras and Leavitt Path Algebras of Finite Graphs
The Gelfand–Kirillov dimension is a well established quantity to classify the growth of infinite dimensional algebras. In this article we introduce the algebraic entropy for path algebras. For the path algebras, Leavitt path algebras and the path algebra of the extended (double) graph, we compare the Gelfand–Kirillov dimension and the entropy. We show that path algebras over finite graphs can be classified to be of finite dimension, finite Gelfand–Kirillov dimension or finite algebraic entropy. We show indeed how these three quantities are dependent on cycles inside the graph. Moreover we show that the algebraic entropy is conserved under Morita equivalence but perhaps for a different filtration. In addition we give several examples of the entropy in path algebras and Leavitt path algebras.
- Open Access
Centroid and algebraic properties of evolution algebras through graphs
The leitmotiv of this paper is linking algebraic properties of an evolution algebra with combinatorial properties of the (possibly several) graphs that one can associate to the algebra. We link nondegeneracy, zero annihilator, absorption property, von Neumann regularity, and primeness with suitable properties in the associated graph. In the presence of semiprimeness, the property of primeness is equivalent to any associated graph being downward directed. We also provide a description of the prime ideals in an evolution algebra and prove that certain algebraic properties, such as semiprimeness and perfection, can not be characterized in combinatorial terms. We describe the centroid of evolution algebras as constant functions along the connected components of its associated graph. The dimension of the centroid of a zero annihilator algebra $A$ agrees with the cardinal of the connected components of any possible graph associated to $A$. This is the combinatorial expression of an algebraic uniqueness property in the decomposition of $A$ as indecomposable algebras with $1$-dimensional centroid.Open AccessCentroid and algebraic properties of evolution algebras through graphs
The leitmotiv of this paper is linking algebraic properties of an evolution algebra with combinatorial properties of the (possibly several) graphs that one can associate to the algebra. We link nondegeneracy, zero annihilator, absorption property, von Neumann regularity, and primeness with suitable properties in the associated graph. In the presence of semiprimeness, the property of primeness is equivalent to any associated graph being downward directed. We also provide a description of the prime ideals in an evolution algebra and prove that certain algebraic properties, such as semiprimeness and perfection, can not be characterized in combinatorial terms. We describe the centroid of evolution algebras as constant functions along the connected components of its associated graph. The dimension of the centroid of a zero annihilator algebra $A$ agrees with the cardinal of the connected components of any possible graph associated to $A$. This is the combinatorial expression of an algebraic uniqueness property in the decomposition of $A$ as indecomposable algebras with $1$-dimensional centroid. - Open Access
The algebraic entropies of the Leavitt path algebra and the graph algebras agree
In this note we prove that the algebras $L_K(E)$ and $KE$ have the same entropy. Entropy is always referred to the standard filtrations in the corresponding kind of algebra. The main argument leans on (1) the holomorphic functional calculus; (2) the relation of entropy with suitable norm of the adjacency matrix; and (3) the Cohn path algebras which yield suitable bounds for the algebraic entropies.Open AccessThe algebraic entropies of the Leavitt path algebra and the graph algebras agree
In this note we prove that the algebras $L_K(E)$ and $KE$ have the same entropy. Entropy is always referred to the standard filtrations in the corresponding kind of algebra. The main argument leans on (1) the holomorphic functional calculus; (2) the relation of entropy with suitable norm of the adjacency matrix; and (3) the Cohn path algebras which yield suitable bounds for the algebraic entropies. - Open Access
Algebraic characterisations of path algebras
The theory of path algebras is usually circunscripted to the study of representations, usually linked to finite graphs. In our work, we focus on studying the structure of path algebras over a field associated to arbitrary graphs. We characterise perfection (simplicity, primitivity, primeness and semiprimeness) and finitness conditions (artinianity, semiartinianity and noetherianity) in terms of geometric conditions in the associated graph. In order to do so, we also compute the socle and the Jacobson radical of a path algebra. In addition, we study the centroid of any path algebra and the extended centroid and central closure of the path algebra of a cycle. We obtain two structure theorems, one for semiprime path algebras, and another for noetherian ones. Semiprime path algebras are direct sum of simple, prime and primitive algebras, and noetherian path algebras modulo its radical will be isomorphic to upper triangular formal matrix algebras, they can also be seen as direct sums of path algebras of cycles and copies of the ground field itself.
Open AccessAlgebraic characterisations of path algebras
The theory of path algebras is usually circunscripted to the study of representations, usually linked to finite graphs. In our work, we focus on studying the structure of path algebras over a field associated to arbitrary graphs. We characterise perfection (simplicity, primitivity, primeness and semiprimeness) and finitness conditions (artinianity, semiartinianity and noetherianity) in terms of geometric conditions in the associated graph. In order to do so, we also compute the socle and the Jacobson radical of a path algebra. In addition, we study the centroid of any path algebra and the extended centroid and central closure of the path algebra of a cycle. We obtain two structure theorems, one for semiprime path algebras, and another for noetherian ones. Semiprime path algebras are direct sum of simple, prime and primitive algebras, and noetherian path algebras modulo its radical will be isomorphic to upper triangular formal matrix algebras, they can also be seen as direct sums of path algebras of cycles and copies of the ground field itself.
- Open Access
- 1 September 2023
- Published by Springer Nature in Mediterranean Journal of Mathematics
- Vol. 20 (6) , 1-2
Correction: On Isomorphism Conditions for Algebra Functors with Applications to Leavitt Path Algebras
- 1 September 2023
- Published by Springer Nature in Mediterranean Journal of Mathematics
- Vol. 20 (6) , 1-2
Open AccessCorrection: On Isomorphism Conditions for Algebra Functors with Applications to Leavitt Path Algebras
- 27 July 2023
- Published by Springer Nature in Mediterranean Journal of Mathematics
- Vol. 20 (5) , 1-19
On Isomorphism Conditions for Algebra Functors with Applications to Leavitt Path Algebras
- 27 July 2023
- Published by Springer Nature in Mediterranean Journal of Mathematics
- Vol. 20 (5) , 1-19
On Isomorphism Conditions for Algebra Functors with Applications to Leavitt Path Algebras
- Open Access
Algebraic entropy and a complete classification of path algebras over finite graphs by growth
The Gelfand-Kirillov dimension is a well established quantity to classify the growth of infinite dimensional algebras. In this article we introduce the algebraic entropy for path algebras. For the path algebras, Leavitt path algebras and the path algebra of the extended (double) graph, we compare the Gelfand-Kirillov dimension and the entropy. We give a complete classification of path algebras over finite graphs by dimension, Gelfand-Kirillov dimension and algebraic entropy. We show indeed how these three quantities are dependent on cycles inside the graph. Moreover we show that the algebraic entropy is conserved under Morita equivalence. In addition we give several examples of the entropy in path algebras and Leavitt path algebras.
Open AccessAlgebraic entropy and a complete classification of path algebras over finite graphs by growth
The Gelfand-Kirillov dimension is a well established quantity to classify the growth of infinite dimensional algebras. In this article we introduce the algebraic entropy for path algebras. For the path algebras, Leavitt path algebras and the path algebra of the extended (double) graph, we compare the Gelfand-Kirillov dimension and the entropy. We give a complete classification of path algebras over finite graphs by dimension, Gelfand-Kirillov dimension and algebraic entropy. We show indeed how these three quantities are dependent on cycles inside the graph. Moreover we show that the algebraic entropy is conserved under Morita equivalence. In addition we give several examples of the entropy in path algebras and Leavitt path algebras.