Denote by $\mathrm m(S)$ the multiplicity of a numerical semigroup $S$. A covariety is a nonempty family $\mathscr{C}$ of numerical semigroups that fulfills the following conditions: there is the minimum of $\mathscr{C},$ the intersection of two elements of $\mathscr{C}$ is again an element of $\mathscr{C}$ and $S\backslash \{\mathrm m(S)\}\in \mathscr{C}$ for all $S\in \mathscr{C}$ such that $S\neq \min(\mathscr{C}).$ In this work we describe an algorithmic procedure to compute all the elements of $\mathscr{C}.$ We prove that there exists the smallest element of $\mathscr{C}$ containing a set of positive integers. We show that $\mathscr{A}(F)=\{S\mid S \mbox{ is a numerical semigroup with Frobenius number }F\}$ is a covariety, and we particularize the previous results in this covariety. Finally, we will see that there is the smallest covariety containing a finite set of numerical semigroups.
The structure of the defining ideal of the semigroup ring $k[H]$ of a numerical semigroup $H$ over a field $k$ is described, when the pseudo-Frobenius numbers of $H$ are multiples of a fixed integer.
In this note we observe that the Frobenius number and therefore the conductor of a numerical semigroup can be obtained from the maximal socle degree of the quotient of the corresponding semigroup algebra by the ideal generated by the biggest generator of the semigroup.
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.
We give two algorithmic procedures to compute the whole set of almost symmetric numerical semigroups with fixed Frobenius number and type, and the whole set of almost symmetric numerical semigroups with fixed Frobenius number. Our algorithms allow to compute the whole set of almost symmetric numerical semigroups with fixed Frobenius number with similar or even higher efficiency that the known ones. They have been implemented in the GAP (http://www.gap-system.org) package NumericalSgps (http://www.gap-system.org/Packages/numericalsgps.html).
In this paper, we introduce and study the numerical semigroups generated by $\{a_1, a_2, \ldots \} \subset \mathbb{N}$ such that $a_1$ is the repunit number in base $b > 1$ of length $n > 1$ and $a_i - a_{i-1} = a\, b^{i-2},$ for every $i \geq 2$, where $a$ is a positive integer relatively prime with $a_1$. These numerical semigroups generalize the repunit numerical semigroups among many others. We show that they have interesting properties such as being homogeneous and Wilf. Moreover, we solve the Frobenius problem for this family, by giving a closed formula for the Frobenius number in terms …
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.
In this work we will show that if $F$ is a positive integer, then the set ${\mathrm{Arf}}(F)=\{S\mid S \mbox{ is an Arf numerical semigroup with Frobenius number } F\}$ verifies the following conditions: 1) $Δ(F)=\{0,F+1,\rightarrow\}$ is the minimum of ${\mathrm{Arf}}(F),$ 2) if $\{S, T\} \subseteq {\mathrm{Arf}}(F)$, then $S \cap T \in {\mathrm{Arf}}(F),$ 3) if $S \in {\mathrm{Arf}}(F),$ $S\neq Δ(F)$ and ${\mathrm m}(S)=\min (S \backslash \{0\})$, then $S\backslash \{{\mathrm m}(S)\} \in {\mathrm{Arf}}(F)$. The previous results will be used to give an algorithm which calculates the set ${\ma…
We consider symmetric (not complete intersection) numerical semigroups S_5, generated by five elements, and derive inequalities for degrees of syzygies of S_5 and find the lower bound F_5 for their Frobenius numbers. We study a special case W_5 of such semigroups, which satisfy the Watanabe Lemma, and show that the lower bound F_{5w} for the Frobenius number of the semigroup W_5 is stronger than F_5.
A numerical semigroup is irreducible if it cannot be obtained as intersection of two numerical semigroups containing it properly. If we only consider numerical semigroups with the same Frobenius number, that concept is generalized to atomic numerical semigroup. Based on a previous one developed to obtain all irreducible numerical semigroups with a fixed Frobenius number, we present an algorithm to compute all atomic numerical semigroups with a fixed Frobenius number.
The pseudo-Frobenius numbers of a numerical semigroup are those gaps of the numerical semigroup that are maximal for the partial order induced by the semigroup. We present a procedure to detect if a given set of integers is the set of pseudo-Frobenius numbers of a numerical semigroup and, if so, to compute the set of all numerical semigroups having this set as set of pseudo-Frobenius numbers.
Let $S_1$ and $S_2$ be two affine semigroups and let $S$ be the gluing of $S_1$ and $S_2$. Several invariants of $S$ are then related to those of $S_1$ and $S_2$; we review some of the most important properties preserved under gluings. The aim of this paper is to prove that this is the case for the Frobenius vector and the Hilbert series. Applications to complete intersection affine semigroups are also given.
Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and telescopic numerical semigroups, and numerical semigroups associated to an irreducible plane curve singularity. The recursive nature of this procedure allows us to give bounds for the embedding dimension and for the minimal generators of a semigroup in any of these families.
Let $\mathbb{N}^{d}$ be the $d$-dimensional monoid of non-negative integers. A generalized numerical semigroup is a submonoid $ S\subseteq \mathbb{N}^d$ such that $H(S)=\mathbb{N}^d \setminus S$ is a finite set. We introduce irreducible generalized numerical semigroups and characterize them in terms of the cardinality of a special subset of $H(S)$. In particular, we describe relaxed monomial orders on $\mathbb N^d$, define the Frobenius element of $S$ with respect to a given relaxed monomial order, and show that the Frobenius element of $S$ is independent of the order if the generalized numeri…
In this paper we present a procedure to build the set of irreducible numerical semigroups with a fixed Frobenius number. The construction gives us a rooted tree structure for this set. Furthermore, by using the notion of Kunz-coordinates vector we translate the problem of finding such a tree into the problem of manipulating 0-1 vectors with as many component as the Frobenius number.
This paper presents a new methodology to count the number of numerical semigroups of given genus or Frobenius number. We apply generating function tools to the bounded polyhedron that classifies the semigroups with given genus (or Frobenius number) and multiplicity. First, we give theoretical results about the polynomial-time complexity of counting the number of these semigroups. We also illustrate the methodology analyzing the cases of multiplicity 3 and 4 where some formulas for the number of numerical semigroups for any genus and Frobenius number are obtained.
We derive the polynomial representations for minimal relations of generating set of numerical semigroups R_n^k=<(n-1)^k,n^k,(n+1)^k>, k=2,3,4, n>2. We find also the polynomial representations for degrees of syzygies in the Hilbert series H(z,R_n^k) of these semigroups, their Frobenius numbers F(R_n^k) and genera G(R_n^k).
We study almost symmetric semigroups generated by odd integers. If the embedding dimension is four, we characterize when a symmetric semigroup that is not complete intersection or a pseudo-symmetric semigroup is generated by odd integers. Moreover, we give a way to construct all the almost symmetric semigroups with embedding dimension four and type three generated by odd elements. In this case we also prove that all the pseudo-Frobenius numbers are multiple of one of them and this gives many consequences on the semigroup and its defining ideal.
Let $H$ be a numerical semigroup minimally generated by an almost arithmetic sequence. We give a description of a possible row-factorization $(\RF)$ matrix for each pseudo-Frobenius element of $H.$ Further, when $H$ is symmetric and has embedding dimension 4 or 5, we prove that the defining ideal is minimally generated by $\RF$-relations.
We define the concentration of a numerical semigroup $S$ as $\mathsf{C}(S)=\max \left\{\text{next}_S(s)-s ~|~ s\in S \backslash \{0\}\right\}$ wherein $\text{next}_S(s)=\min\left\{x \in S ~|~ s<x\right\}$. In this paper, we study the class of numerical semigroups with concentration $2$. We give algorithms to calculate the whole set of this class of semigroups with given multiplicity, genus or Frobenius number. Separately, we prove that this class of semigroups verifies the Wilf's conjecture.
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.
We examine properties of random numerical semigroups under a probabilistic model inspired by the Erdos-Renyi model for random graphs. We provide a threshold function for cofiniteness, and bound the expected embedding dimension, genus, and Frobenius number of random semigroups. Our results follow, surprisingly, from the construction of a very natural shellable simplicial complex whose facets are in bijection with irreducible numerical semigroups of a fixed Frobenius number and whose $h$-vector determines the probability that a particular element lies in the semigroup.
We present a procedure to enumerate the whole set of numerical semigroups with a given Frobenius number F, S(F). The methodology is based on the construction of a partition of S(F) by a congruence relation. We identify exactly one irreducible and one homogeneous numerical semigroup at each class in the relation, and from those two elements we reconstruct the whole class. An alternative more efficient method is proposed based on the use of the Kunz-coordinates vectors of the elements in S(F).
Given two numerical semigroups $S$ and $T$ and a positive integer $d$, $S$ is said to be one over $d$ of $T$ if $S=\{s \in \mathbb{N} \ | \ ds \in T \}$ and in this case $T$ is called a $d$-fold of $S$. We prove that the minimal genus of the $d$-folds of $S$ is $g + \lceil \frac{(d-1)f}{2} \rceil$, where $g$ and $f$ denote the genus and the Frobenius number of $S$. The case $d=2$ is a problem proposed by Robles-Pérez, Rosales, and Vasco. Furthermore, we find the minimal genus of the symmetric doubles of $S$ and study the particular case when $S$ is almost symmetric. Finally, we study the Frobe…
In this work we introduce the notion of almost-symmetry for generalized numerical semigroups. In addition to the main properties occurring in this new class, we present several characterizations for its elements. In particular we show that this class yields a new family of Frobenius generalized numerical semigroups and extends the class of irreducible generalized numerical semigroups. This investigation allows us to provide a method of computing all almost symmetric generalized numerical semigroup having a fixed Frobenius element and organizing them in a rooted tree depending on a chosen monom…
A numerical semigroup is a sub-semigroup of the natural numbers that has a finite complement. Some of the key properties of a numerical semigroup are its Frobenius number F, genus g and type t. It is known that for any numerical semigroup $\frac{g}{F+1-g}\leq t\leq 2g-F$. Numerical semigroups with $t=2g-F$ are called almost symmetric, we introduce a new property that characterises them. We give an explicit characterisation of numerical semigroups with $t=\frac{g}{F+1-g}$. We show that for a fixed $α$ the number of numerical semigroups with Frobenius number $F$ and type $F-α$ is eventually cons…
We generalize the geometric sequence $\{a^p, a^{p-1}b, a^{p-2}b^2,...,b^p\}$ to allow the $p$ copies of $a$ (resp. $b$) to all be different. We call the sequence $\{a_1a_2a_3\cdots a_p, b_1a_2a_3\cdots a_p, b_1b_2a_3\cdots a_p,\ldots, b_1b_2b_3\cdots b_p\}$ a \emph{compound sequence}. We consider numerical semigroups whose minimal set of generators form a compound sequence, and compute various semigroup and arithmetical invariants, including the Frobenius number, Apéry sets, Betti elements, and catenary degree. We compute bounds on the delta set and the tame degree.
In this paper we study numerical semigroups generated by three elements. We give a characterization of pseudo-symmetric numerical semigroups. Also, we will give a simple algorithm to get all the pseudo-symmetric numerical semigroups with give Frobenius number.
We consider the Diophantine problem of Frobenius for semigroup ${\sf S}({\bf d}^3)$ where ${\bf d}^3$ denotes the tuple $(d_1,d_2,d_3)$, $\gcd(d_1,d_2,d_3)=1$. Based on the Hadamard product of analytic functions we have found the analytic representation for the diagonal elements $a_{kk}({\bf d}^3)$ of the Johnson's matrix of minimal relations in terms of $d_1,d_2,d_3$. Bearing in mind the results of the recent paper this gives the analytic representation for the Frobenius number $F({\bf d}^3)$, genus $G({\bf d}^3)$ and the Hilbert series $H({\bf d}^3;z)$ for the semigroups ${\sf S}({\bf d}^3)$…
A numerical semigroup is an additive subsemigroup of the non-negative integers. In this paper, we consider parametrized families of numerical semigroups of the form $P_n = \langle f_1(n), \ldots, f_k(n) \rangle$ for polynomial functions $f_i$. We conjecture that for large $n$, the Betti numbers, Frobenius number, genus, and type of $P_n$ each coincide with a quasipolynomial. This conjecture has already been proven in general for Frobenius numbers, and for the remaining quantities in the special case when $P_n = \langle n, n + r_2, \ldots, n + r_k \rangle$. Our main result is to prove our conje…
In this paper, we introduce the concept of Arf special gaps of an Arf numerical semigroup, and an algorithm for computing all Arf special gaps of a given Arf numerical semigroup. We introduce the concept of Arf-irreducible numerical semigroups, and draw conclusions about all these concepts. We give a system of generators for the Frobenius variety and variety of families of Arf numerical semigroups. Moreover, we obtain the minimal Arf system of generators of a given Arf numerical semigroup.
We consider symmetric (not complete intersection) numerical semigroups S_6, generated by a set of six positive integers {d_1,...,d_6}, gcd(d_1,...,d_6)=1, and derive inequalities for degrees of syzygies of such semigroups and find the lower bound for their Frobenius numbers. We show that this bound may be strengthened if S_6 satisfies the Watanabe lemma.
