Search

Let $S\subseteq \mathbb N^p$ be a semigroup, any $P\subseteq S$ is an ideal of $S$ if $P+S\subseteq P$, and an $I(S)$-semigroup is the affine semigroup $P\cup \{0\}$, with $P$ an ideal of $S$. We characterise the $I(S)$-semigroups and the ones that also are $\mathcal C$-semigroups. Moreover, some algorithms are provided to compute all the $I(S)$-semigroups satisfying some properties. From a family of ideals of $S$, we introduce the affine semigroups with maximal embedding dimension, characterising them and describing some families.

This work delves into the {\it quotient of an affine semigroup by a positive integer}, exploring its intricate properties and broader implications. We unveil an {\it associated tree} that serves as a valuable tool for further analysis. Moreover, we successfully generalize several key irreducibility results, extending their applicability to the more general class of $\mathcal C$-semigroup quotients. To shed light on these concepts, we introduce the novel notion of an {\it arithmetic variety of affine semigroups}, accompanied by illuminating examples that showcase its power.

Let $S$ and $\Delta$ be numerical semigroups. A numerical semigroup $S$ is an $\mathbf{I}(\Delta)$-{\it semigroup} if $S\backslash \{0\}$ is an ideal of $\Delta$. We will denote by $\mathcal{J}(\Delta)=\{S \mid S \text{ is an $\mathbf{I}(\Delta)$-semigroup} \}.$ We will say that $\Delta$ is {\it an ideal extension of } $S$ if $S\in \mathcal{J}(\Delta).$ In this work, we present an algorithm that allows to build all the ideal extensions of a numerical semigroup. We can recursively denote by $\mathcal{J}^0(\mathbb{N})=\mathbb{N},$ $\mathcal{J}^1(\mathbb{N})=\mathcal{J}(\mathbb{N})$ and $\mathcal{J}^{k+1}(\mathbb{N})=\mathcal{J}(\mathcal{J}^{k}(\mathbb{N}))$ for all $k\in \mathbb{N}.$ The complexity of a numerical semigroup $S$ is the minimun of the set $\{k\in \mathbb{N}\mid S \in \mathcal{J}^k(\mathbb{N})\}.$ In addition, we will give an algorithm that allows us to compute all the numerical semigroups with fixed multiplicity and complexity.

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.

Let $A \subset {\mathbb Z}$ be a finite subset. We denote by $\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 $\mathcal{B}(A)$ stems from Buchweitz's discovery in 1980 that if a numerical semigroup $S \subseteq {\mathbb N}$ is a Weierstrass semigroup, then $\mathcal{B}({\mathbb N} \setminus S) = \emptyset$. By constructing instances where this condition fails, Buchweitz disproved a longstanding conjecture by Hurwitz (1893). In this paper, we prove that for any numerical semigroup $S \subset {\mathbb N}$ of genus $g \ge 2$, the set $\mathcal{B}({\mathbb N} \setminus S) $ is finite, of unbounded cardinality as $S$ varies.

Weierstrass semigroups are well-known along the literature. We present a new family of non-Weierstrass semigroups which can be written as an intersection of Weierstrass semigroups. In addition, we provide methods for calculating non-Weierstrass semigroups with genus as large as desired.

In this work we present a new class of numerical semigroups called GSI-semigroups. We see the relations between them and others families of semigroups and we give explicitly their set of gaps. Moreover, an algorithm to obtain all the GSI-semigroups up to a given Frobenius number is provided and the realization of positive integers as Frobenius numbers of GSI-semigroups is studied.

Let $\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.

A proportionally modular affine semigroup is the set of nonnegative integer solutions of a modular Diophantine inequality $f_1x_1+\cdots +f_nx_n \mod b \le g_1x_1+\cdots +g_nx_n$ where $g_1,\dots,g_n,$ $f_1,\ldots ,f_n\in \mathbb{Z}$ and $b\in\mathbb{N}$. In this work, a geometrical characterization of these semigroups is given. Moreover, some algorithms to check if a semigroup $S$ in $\mathbb{N}^n$, with $\mathbb{N}^n\setminus S$ a finite set, is a proportionally modular affine semigroup are provided by means of that geometrical approach., Comment: 3 figures

Let $S=\langle a_1,\ldots,a_p\rangle$ be a numerical semigroup, $s\in S$ and ${\sf z}(s)$ its set of factorizations. The set of length is denoted by ${\mathcal L}(s)=\{{\tt L}(x_1,\dots,x_p)\mid (x_1,\dots,x_p)\in{\sf Z}(s)\}$ where ${\tt L}(x_1,\dots,x_p)=x_1+\ldots+x_p$. From these definitions, the following sets can be defined ${\textsf W}(n)=\{s\in S\mid \exists x\in{\sf z}(s) \textrm{ such that } {\tt{L}}(x)=n\}$, $\nu(n)=\cup_{s\in {\textsf W}(n)} {\mathcal L}(s)=\{l_1

In this paper we study those submonoids of $\mathbb{N}^d$ which a non-trivial pseudo-Frobenius set. In the affine case, we prove that they are the affine semigroups whose associated algebra over a field has maximal projective dimension possible. We prove that these semigroups are a natural generalization of numerical semigroups and, consequently, most of their invariants can be generalized. In the last section we introduce a new family of submonoids of $\mathbb{N}^d$ and using its pseudo-Frobenius elements we prove that the elements in the family are direct limits of affine semigroups.

Fixed two positive integers m and e, some algorithms for computing the minimal Frobenius number and minimal genus of the set of numerical semigroups with multiplicity m and embedding dimension e are provided. Besides, the semigroups where these minimal values are achieved are computed too.

Given $m\in \mathbb{N},$ a numerical semigroup with multiplicity $m$ is called packed numerical semigroup if its minimal generating set is included in $\{m,m+1,\ldots, 2m-1\}.$ In this work, packed numerical semigroups are used to built the set of numerical semigroups with fixed multiplicity and embedding dimension, and to create a partition in this set. Moreover, Wilf's conjecture is checked in the tree associated to some packed numerical semigroups.

Let $\CaC\subset \Q^p$ be a rational cone. An affine semigroup $S\subset \CaC$ is a $\CaC$-semigroup whenever $(\CaC\setminus S)\cap \N^p$ has only a finite number of elements. In this work, we study the tree of $\CaC$-semigroups, give a method to generate it and study their subsemigroups with minimal embedding dimension. We extend Wilf's conjecture for numerical semigroups to $\CaC$-semigroups and give some families of $\CaC$-semigroups fulfilling the extended conjecture. We also check that other conjectures on numerical semigroups seem to be also satisfied by $\CaC$-semigroups.

This work introduces a new kind of semigroup of $\N^p$ called proportionally modular affine semigroup. These semigroups are defined by modular Diophantine inequalities and they are a generalization of proportionally modular numerical semigroups. We prove they are finitely generated and we give an algorithm to compute their minimal generating sets. We also specialise on the case $p=2$. For this case, we provide a faster algorithm to compute their minimal system of generators and we prove they are Cohen-Macaulay and Buchsbaum. Besides, the Gorenstein property is charactized, and their (minimal) Fr\"obenius vectors are determinated.

We study the lattice of divisor-closed submonoids of finitely generated cancellative commutative monoids. In case the monoid is an affine semigroup, we give a geometrical characterization of such submonoids in terms of its cone. Finally, we use our results to give an algorithm for computing $\Delta^*(H)$ the set of minimal distance of $H$.

Let $\{a_1,\dots,a_p\}$ be the minimal generating set of a numerical monoid $S$. For any $s\in S$, its Delta set is defined by $\Delta(s)=\{l_{i}-l_{i-1}|i=2,\dots,k\}$ where $\{l_1<\dots

In this work, new families of Buchsbaum rings, developed by mean of convex body semigroups, are presented. We characterize Buchsbaum circle and convex polygonal semigroups and describe algorithmic methods to check these characterizations.

We give an algorithm to compute the $\omega$-primality of finitely generated atomic monoids. Asymptotic $\w$-primality is also studied and a formula to obtain it in finitely generated quasi-Archimedean monoids is proven. The formulation is applied to numerical semigroups, obtaining an expression of this invariant in terms of its system of generators.

We characterize Cohen-Macaulay and Gorenstein rings obtained from certain types of convex body semigroups. Algorithmic methods to check if a polygonal or circle semigroup is Cohen-Macaulay/Gorenstein are given. We also provide some families of Cohen-Macaulay and Gorenstein rings., Comment: 11 pages, 5 figures

In this paper we present a new kind of semigroups called convex body semigroups which are generated by convex bodies of R^k. They generalize to arbitrary dimension the concept of proportionally modular numerical semigroup of [7]. Several properties of these semigroups are proven. Affine convex body semigroups obtained from circles and polygons of R^2 are characterized. The algorithms for computing minimal system of generators of these semigroups are given. We provide the implementation of some of them.

Ferromagnet/Superconductor/Ferromagnet (F/S/F) trilayers, in which the establishing of a Fulde-Ferrell Larkin-Ovchinnikov (FFLO) like state leads to interference effects of the superconducting pairing wave function, form the core of the superconducting spin valve. The realization of strong critical temperature oscillations in such trilayers, as a function of the ferromagnetic layer thicknesses or, even more efficient, reentrant superconductivity, are the key condition to obtain a large spin valve effect, i.e. a large shift in the critical temperature. Both phenomena have been realized experimentally in the Cu 41 Ni 59 /Nb/Cu 41 Ni 59 trilayers investigated in the present work., Comment: 22 pages, 6 figures

This work focuses on the combinatorial properties of glued semigroups and provides its combinatorial characterization. Some classical results for affine glued semigroups are generalized and some methods to obtain glued semigroups are developed., Comment: 13 pages, 6 figures, This paper was initially presented at the "Centennial Congress RSME2011" http://campus.usal.es/~rsme2011/