arXiv subjects
Publications and source records attributed to Juan Ignacio García-García.
The aim of this paper is to study the $p$-Frobenius vector of affine semigroups $S\subset \mathbb N^q$; that is, the maximum element, with respect to a graded monomial order, with at most $p$ factorizations in $S$. We produce several algorithms to compute these vectors. Finally, we study how the $p$-Frobenius vectors behave when considering gluings of $S$ with $\mathbb N^q$.
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.
We provide algorithmic methods to check the Cohen--Macaulayness, Buchsbaumness and/or Gorensteiness of some families of semigroup rings that are constructed from the dilation of bounded convex polyhedrons of $\R^3_{\geq}$. Some families of semigroup rings are given satifying these properties.
The aim of this work is to reduce the complexity of the available algorithms for computing the generator sets of a semigroup ideal by using the Hermite normal form. In order to achieve it we introduce the concept of decomposable semigroup. If a semigroup is decomposable, the computation of its ideal is equivalent to compute the ideals of each semigroup in the decomposition, thus obtaining a reduction of the complexity of the algorithms. Furthermore, since these computations are mutually independent, they can be carried out in parallel. The concept of decomposable variety is introduced and a combinatorial characterization of decomposable semigroup is obtained. Some applications are also provided.