Daniel Marín-Aragón
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Daniel Marín-Aragón has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Juan Ignacio Garcia Garcia
Departamento de Matemáticas/INDESS (Instituto Universitario para el Desarrollo Social Sostenible), Universidad de Cádiz, E-11510 Puerto Real, Cádiz, Spain
24 shared publications - Alberto Vigneron-Tenorio
Departamento de Matemáticas/INDESS (Instituto Universitario para el Desarrollo Social Sostenible), Universidad de Cádiz, E-11406 Jerez de la Frontera, Cádiz, Spain
20 shared publications - Maria Angeles Moreno Frias
Department of Mathematics, Faculty of Sciences, University of Cádiz, E-11510 Cádiz, Spain
6 shared publications - Jose Carlos Rosales
Department of Algebra, Faculty of Sciences, University of Granada, E-18071 Granada, Spain
3 shared publications - Shalom Eliahou
Univ. Littoral Côte d’Opale, UR 2597 - LMPA - Laboratoire de Mathématiques Pures et Appliquées Joseph Liouville, Calais, France
3 shared publications - Adrián Sánchez-Loureiro2 shared publications
Latest Publications
- Open Access
- 10 February 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (4) , 584
On Ideals of Submonoids of Power Monoids
Let be a numerical monoid, while a -monoid S is a monoid generated by a finite number of finite non-empty subsets of . That is, S is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets. This work provides an algorithm for computing the ideals associated with some -monoids. These are the key to studying some factorization properties of -monoids and some additive properties of sumsets. This approach links computational commutative algebra with additive number theory.- 10 February 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (4) , 584
Open AccessOn Ideals of Submonoids of Power Monoids
Let be a numerical monoid, while a -monoid S is a monoid generated by a finite number of finite non-empty subsets of . That is, S is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets. This work provides an algorithm for computing the ideals associated with some -monoids. These are the key to studying some factorization properties of -monoids and some additive properties of sumsets. This approach links computational commutative algebra with additive number theory. - Open Access
- 16 September 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (18) , 2889
-Semigroups and Their Induced OrderLet be an integer polyhedral cone. An affine semigroup is a -semigroup if . This structure has always been studied using a monomial order. The main issue is that the choice of these orders is arbitrary. In the present work, we choose the order given by the semigroup itself, which is a more natural order. This allows us to generalise some of the definitions and results known from numerical semigroup theory to -semigroups.- 16 September 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (18) , 2889
Open Access-Semigroups and Their Induced OrderLet be an integer polyhedral cone. An affine semigroup is a -semigroup if . This structure has always been studied using a monomial order. The main issue is that the choice of these orders is arbitrary. In the present work, we choose the order given by the semigroup itself, which is a more natural order. This allows us to generalise some of the definitions and results known from numerical semigroup theory to -semigroups. - Open Access
- 10 January 2024
- Published by Springer Nature in Results in Mathematics
- Vol. 79 (2) , 1-19
Some Properties of Affine ${\mathcal {C}}$-semigroupsNumerical semigroups have been extensively studied throughout the literature, and many of their invariants have been characterized. In this work, we generalize some of the most important results about symmetry, pseudo-symmetry, or fundamental gaps, to affine $${\mathcal {C}}$$ -semigroups. In addition, we give algorithms to compute the tree of irreducible $${\mathcal {C}}$$ -semigroups and $${\mathcal {C}}$$ -semigroups with a given Frobenius vector.- 10 January 2024
- Published by Springer Nature in Results in Mathematics
- Vol. 79 (2) , 1-19
Open AccessSome Properties of Affine ${\mathcal {C}}$-semigroupsNumerical semigroups have been extensively studied throughout the literature, and many of their invariants have been characterized. In this work, we generalize some of the most important results about symmetry, pseudo-symmetry, or fundamental gaps, to affine $${\mathcal {C}}$$ -semigroups. In addition, we give algorithms to compute the tree of irreducible $${\mathcal {C}}$$ -semigroups and $${\mathcal {C}}$$ -semigroups with a given Frobenius vector. - Open Access
Some properties of affine $\mathcal C$-semigroups
Numerical semigroups have been extensively studied throughout the literature, and many of their invariants have been characterized. In this work, we generalize some of the most important results about symmetry, pseudo-symmetry, or fundamental gaps, to affine $\mathcal C$-semigroups. In addition, we give algorithms to compute the tree of irreducible $\mathcal C$-semigroups and $\mathcal C$-semigroups with a given Frobenius vector.
Open AccessSome properties of affine $\mathcal C$-semigroups
Numerical semigroups have been extensively studied throughout the literature, and many of their invariants have been characterized. In this work, we generalize some of the most important results about symmetry, pseudo-symmetry, or fundamental gaps, to affine $\mathcal C$-semigroups. In addition, we give algorithms to compute the tree of irreducible $\mathcal C$-semigroups and $\mathcal C$-semigroups with a given Frobenius vector.
- Open Access
- 4 February 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (4) , 790
Asymptotic ω-Primality of Finitely Generated Cancelative Commutative Monoids
The computation of -primality has been object of study, mainly, for numerical semigroups due to its multiple applications to the Factorization Theory. However, its asymptotic version is less well known. In this work, we study the asymptotic -primality for finitely generated cancelative commutative monoids. By using discrete geometry tools and the Python programming language we present an algorithm to compute this parameter. Moreover, we improve the proof of a known result for numerical semigroups.- 4 February 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (4) , 790
Open AccessAsymptotic ω-Primality of Finitely Generated Cancelative Commutative Monoids
The computation of -primality has been object of study, mainly, for numerical semigroups due to its multiple applications to the Factorization Theory. However, its asymptotic version is less well known. In this work, we study the asymptotic -primality for finitely generated cancelative commutative monoids. By using discrete geometry tools and the Python programming language we present an algorithm to compute this parameter. Moreover, we improve the proof of a known result for numerical semigroups. - Open Access
- 6 December 2022
- Published by Springer Nature in Bulletin of the Brazilian Mathematical Society, New Series
- Vol. 54 (1) , 1-11
The Buchweitz Set of a Numerical Semigroup
Let $$A \subset \mathbb Z$$ be a finite subset. We denote by $${{\,\mathrm{\mathcal {B}}\,}}(A)$$ the set of all integers $$n \ge 2$$ such that $$|nA| > (2n-1)(|A|-1),$$ where $$nA=A+\cdots +A$$ denotes the n-fold sumset of A. The motivation to consider $${{\,\mathrm{\mathcal {B}}\,}}(A)$$ stems from Buchweitz’s discovery in 1980 that if a numerical semigroup $$S \subseteq \mathbb N$$ is a Weierstrass semigroup, then $${{\,\mathrm{\mathcal {B}}\,}}(\mathbb N{\setminus } S) = \emptyset .$$ By constructing instances where this condition fails, Buchweitz disproved a longstanding conjecture by Hurwitz (Math Ann 41:403–442, 1893). In this paper, we prove that for any numerical semigroup $$S \subset \mathbb N$$ of genus $$g \ge 2,$$ the set $${{\,\mathrm{\mathcal {B}}\,}}(\mathbb N{\setminus } S) $$ is finite, of unbounded cardinality as S varies.- 6 December 2022
- Published by Springer Nature in Bulletin of the Brazilian Mathematical Society, New Series
- Vol. 54 (1) , 1-11
Open AccessThe Buchweitz Set of a Numerical Semigroup
Let $$A \subset \mathbb Z$$ be a finite subset. We denote by $${{\,\mathrm{\mathcal {B}}\,}}(A)$$ the set of all integers $$n \ge 2$$ such that $$|nA| > (2n-1)(|A|-1),$$ where $$nA=A+\cdots +A$$ denotes the n-fold sumset of A. The motivation to consider $${{\,\mathrm{\mathcal {B}}\,}}(A)$$ stems from Buchweitz’s discovery in 1980 that if a numerical semigroup $$S \subseteq \mathbb N$$ is a Weierstrass semigroup, then $${{\,\mathrm{\mathcal {B}}\,}}(\mathbb N{\setminus } S) = \emptyset .$$ By constructing instances where this condition fails, Buchweitz disproved a longstanding conjecture by Hurwitz (Math Ann 41:403–442, 1893). In this paper, we prove that for any numerical semigroup $$S \subset \mathbb N$$ of genus $$g \ge 2,$$ the set $${{\,\mathrm{\mathcal {B}}\,}}(\mathbb N{\setminus } S) $$ is finite, of unbounded cardinality as S varies. - Open Access
- 11 April 2022
- Published by Springer Nature in Ricerche di Matematica
- Vol. 71 (1) , 283-296
Characterizing affine ${\mathcal {C}}$-semigroupsLet $${\mathcal {C}} \subset {\mathbb {N}}^p$$ be a finitely generated integer cone and $$S\subset {\mathcal {C}}$$ be an affine semigroup such that the real cones generated by $${\mathcal {C}}$$ and by S are equal. The semigroup S is called $${\mathcal {C}}$$ -semigroup if $${\mathcal {C}}\setminus S$$ is a finite set. In this paper, we characterize the $${\mathcal {C}}$$ -semigroups from their minimal generating sets, and we give an algorithm to check if S is a $${\mathcal {C}}$$ -semigroup and to compute its set of gaps. We also study the embedding dimension of $${\mathcal {C}}$$ -semigroups obtaining a lower bound for it, and introduce some families of $${\mathcal {C}}$$ -semigroups whose embedding dimension reaches our bound. In the last section, we present a method to obtain a decomposition of a $${\mathcal {C}}$$ -semigroup into irreducible $${\mathcal {C}}$$ -semigroups.- 11 April 2022
- Published by Springer Nature in Ricerche di Matematica
- Vol. 71 (1) , 283-296
Open AccessCharacterizing affine ${\mathcal {C}}$-semigroupsLet $${\mathcal {C}} \subset {\mathbb {N}}^p$$ be a finitely generated integer cone and $$S\subset {\mathcal {C}}$$ be an affine semigroup such that the real cones generated by $${\mathcal {C}}$$ and by S are equal. The semigroup S is called $${\mathcal {C}}$$ -semigroup if $${\mathcal {C}}\setminus S$$ is a finite set. In this paper, we characterize the $${\mathcal {C}}$$ -semigroups from their minimal generating sets, and we give an algorithm to check if S is a $${\mathcal {C}}$$ -semigroup and to compute its set of gaps. We also study the embedding dimension of $${\mathcal {C}}$$ -semigroups obtaining a lower bound for it, and introduce some families of $${\mathcal {C}}$$ -semigroups whose embedding dimension reaches our bound. In the last section, we present a method to obtain a decomposition of a $${\mathcal {C}}$$ -semigroup into irreducible $${\mathcal {C}}$$ -semigroups. - Open Access
On the ideal of some sumset semigroups
A sumset semigroup is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets. In this work, an algorithm for computing the ideals associated with some sumset semigroups is provided. Using these ideals, we study some factorization properties of sumset semigroups and some additive properties of sumsets. This approach links computational commutative algebra with additive number theory.
Open AccessOn the ideal of some sumset semigroups
A sumset semigroup is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets. In this work, an algorithm for computing the ideals associated with some sumset semigroups is provided. Using these ideals, we study some factorization properties of sumset semigroups and some additive properties of sumsets. This approach links computational commutative algebra with additive number theory.
- Open Access
- 1 September 2021
- Published by Association for Computing Machinery (ACM) in ACM Communications in Computer Algebra
- Vol. 55 (3) , 73-76
Computing the ideals of sumset semigroups
We introduce an algorithm for computing the ideals associated with some sumset semigroups. Our results allow us to study some additive properties of sumsets.
- 1 September 2021
- Published by Association for Computing Machinery (ACM) in ACM Communications in Computer Algebra
- Vol. 55 (3) , 73-76
Open AccessComputing the ideals of sumset semigroups
We introduce an algorithm for computing the ideals associated with some sumset semigroups. Our results allow us to study some additive properties of sumsets.
- Open Access
- 20 May 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (10) , 4704
Viñamecum: A Computer-Aided Method for Diagnoses of Pests and Diseases in the Vineyard
Information and telecommunication technologies (ICTs) offer new opportunities to provide more timely information services to farmers. This work aims to present a progressive web app (PWA) for mobile devices, which incorporates updated technical information on the pests and diseases of grapevines. In its development, it generated a database with content related to and photographs of grapevine pests and diseases for access by users using mobile devices. In addition, using an Expert System, the application allows the diagnosis of pathologies and the identification of pests by answering questions that are asked. This PWA is mainly addressed to technicians, students, and winegrowers who want to implement more environmentally friendly crop management strategies. Viñamecum is currently freely.
- 20 May 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (10) , 4704
Open AccessViñamecum: A Computer-Aided Method for Diagnoses of Pests and Diseases in the Vineyard
Information and telecommunication technologies (ICTs) offer new opportunities to provide more timely information services to farmers. This work aims to present a progressive web app (PWA) for mobile devices, which incorporates updated technical information on the pests and diseases of grapevines. In its development, it generated a database with content related to and photographs of grapevine pests and diseases for access by users using mobile devices. In addition, using an Expert System, the application allows the diagnosis of pathologies and the identification of pests by answering questions that are asked. This PWA is mainly addressed to technicians, students, and winegrowers who want to implement more environmentally friendly crop management strategies. Viñamecum is currently freely.