The Frobenius problem for Thabit numerical semigroups

Questions concerning the lengths of factorizations into irreducible elements in numerical monoids have gained much attention in the recent literature. In this note, we show that a numerical monoid has an element with two different irreducible factorizations of the same length if and only if its embedding dimension is greater than two. We find formulas in embedding dimension three for the smallest element with two different irreducible factorizations of the same length and the largest element whose different irreducible factorizations all have distinct lengths. We show that these formulas do not naturally extend to higher embedding dimensions.

Let S be a numerical semigroup. An element is a special gap of S if is also a numerical semigroup. If a is a positive integer, we denote by the set of all numerical semigroups for which a is a special gap. We say that an element of is -irreducible if it cannot be expressed as the intersection of two numerical semigroups of properly containing it. The main aim of this paper is to describe three algorithmic procedures: the first one calculates the elements of the second one determines whether or not a numerical semigroup is -irreducible and the third one computes all the -irreducibles numerical semigroups.

Wilf Conjecture on numerical semigroups is a question posed by Wilf in 1978 and is an inequality connecting the Frobenius number, embedding dimension and the genus of the semigroup. The conjecture is still open in general. We prove that this Wilf inequality is preserved under gluing of numerical semigroups. If the numerical semigroups minimally generated by [Formula: see text] and [Formula: see text] satisfy the Wilf inequality, then so does their gluing which is minimally generated by [Formula: see text]. We discuss the extended Wilf’s Conjecture in higher dimensions for certain affine semigroups and prove an analogous result.

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 [Formula: see text], genus [Formula: see text] and type [Formula: see text]. It is known that for any numerical semigroup [Formula: see text]. Numerical semigroups with [Formula: see text] are called almost symmetric, we introduce a new property that characterizes them. We give an explicit characterization of numerical semigroups with [Formula: see text]. We show that for a fixed [Formula: see text] the number of numerical semigroups with Frobenius number [Formula: see text] and type [Formula: see text] is eventually constant for large [Formula: see text]. The number of numerical semigroups with genus [Formula: see text] and type [Formula: see text] is also eventually constant for large [Formula: see text].

A natural operation on numerical semigroups is taking a quotient by a positive integer. If $\mathcal {S}$ is a quotient of a numerical semigroup with k generators, we call $\mathcal {S}$ a k-quotient. We give a necessary condition for a given numerical semigroup $\mathcal {S}$ to be a k-quotient and present, for each $k \ge 3$ , the first known family of numerical semigroups that cannot be written as a k-quotient. We also examine the probability that a randomly selected numerical semigroup with k generators is a k-quotient.

The so-called Frobenius number in the famous linear Diophantine problem of Frobenius is the largest integer such that the linear equation [Formula: see text] ([Formula: see text] are given positive integers with [Formula: see text]) does not have a non-negative integer solution [Formula: see text]. The generalized Frobenius number (called the [Formula: see text]-Frobenius number) is the largest integer such that this linear equation has at most [Formula: see text] solutions. That is, when [Formula: see text], the [Formula: see text]-Frobenius number is the original Frobenius number. In this paper, we introduce and discuss [Formula: see text]-numerical semigroups by developing a generalization of the theory of numerical semigroups based on this flow of the number of representations. That is, for a certain non-negative integer [Formula: see text], [Formula: see text]-gaps, [Formula: see text]-symmetric semigroups, [Formula: see text]-pseudo-symmetric semigroups, and the like are defined, and their properties are obtained. When [Formula: see text], they correspond to the original gaps, symmetric semigroups and pseudo-symmetric semigroups, respectively.

For a numerical semigroup S, a positive integer a and a nonzero element m of S, we define a new numerical semigroup R(S,a,m) and call it the (a,m)-rotation of S. In this paper we study the Frobenius number and the singularity degree of R(S,a,m). Moreover, we observe that the rotations of ℕ are precisely the modular numerical semigroups.

Let S and T be two numerical semigroups. We say that T is an I(S)-semigroup if T∖{0} is an ideal of S. Given k a positive integer, we denote by Δ(k) the symmetric numerical semigroup generated by {2,2k+1}. In this paper we present a formula which calculates the number of I(S)-semigroups with genus g(Δ(k))+h for some nonnegative integer h and which we will denote by i(Δ(k),h). As a consequence, we obtain that the sequence {i(Δ(k),h)}h∈N is never decreasing. Besides, it becomes stationary from a certain term.

In this paper we introduce a particular semigroup transform [Formula: see text] that fixes the invariants involved in Wilf's conjecture, except the embedding dimension. It also allows one to arrange the set of non-ordinary and non-irreducible numerical semigroups in a family of rooted trees. In addition, we study another transform, having similar features, that has been introduced by Bras-Amorós, and we make a comparison of them. In particular, we study the behavior of the embedding dimension under the action of such transforms, providing some consequences concerning Wilf's conjecture.

This survey presents recent results on minimal free resolutions of numerical semigroup rings. We focus on two classes of numerical semigroups where the resolution is explicitly given: Gorenstein semigroups of embedding dimension 4 that are not a complete intersection and semigroups generated by a sequence of integers in arithmetic progression. Finally, we describe how the resolution is constructed when the semigroup is obtained by gluing of two numerical semigroups of smaller embedding dimension. Along the paper, we provide several non-trivial examples to illustrate our results.

For a numerical semigroup with embedding dimension e, conductor c and left part set In 1978 Wilf asked, in equivalent terms, whether always holds, a question known since as Wilf’s conjecture. Using a closely related lower bound we show that if then thereby settling Wilf’s conjecture in this case. This is best possible, since cases are known where and Wilf’s conjecture remains open for

In this paper, we use the Apéry table of the numerical semigroup associated to an affine monomial curve in order to characterize arithmetic properties and invariants of its tangent cone. In particular, we precise the shape of the Apéry table of a numerical semigroup of embedding dimension 3, when the tangent cone of its monomial curve is Buchsbaum or 2-Buchsbaum, and give new proofs for two conjectures raised by Sapko (Commun. Algebra 29:4759–4773, 2001) and Shen (Commun. Algebra 39:1922–1940, 2001). We also provide a new simple proof in the case of monomial curves for Sally’s conjecture (Numbers of Generators of Ideals in Local Rings, 1978) that the Hilbert function of a one-dimensional Cohen-Macaulay ring with embedding dimension three is non-decreasing. Finally, we obtain that monomial curves of embedding dimension 4 whose tangent cones are Buchsbaum, and also monomial curves of any embedding dimensions whose numerical semigroups are balanced, have non-decreasing Hilbert functions. Numerous examples are provided to illustrate the results, most of them computed by using the NumericalSgps package of GAP (Delgado et al., NumericalSgps-a GAP package, 2006).

A numerical semigroup is perfect if it does not have isolated gaps. In this paper we will order the perfect numerical semigroups with a fixed multiplicity. This ordering allows us to give an algorithm procedure to obtain them. We also study the perfect monoid, which is a subset of $\N$ that can be expressed as an intersection of perfect numerical semigroups, and we present the perfect monoid generated by a subset of $\N$. We give an algorithm to calculate it. We study the perfect closure of a numerical semigroup, as well as the perfect numerical semigroup with maximal embedding dimension, in particular Arf and saturated numerical semigroups.

A numerical semigroup S is coated with odd elements (Coe-semigroup), if {x − 1, x + 1} ⊆ S for all odd elements x in S. In this note, we will study this kind of numerical semigroup. In particular, we are interested in the study of the Frobenius number, gender and embedding dimension of a numerical semigroup of this type.

A numerical semigroup is a subset Λ of the nonnegative integers that is closed under addition, contains 0, and omits only finitely many nonnegative integers (called the gaps of Λ). The collection of all numerical semigroups may be visually represented by a tree of element removals, in which the children of a semigroup Λ are formed by removing one element of Λ that exceeds all existing gaps of Λ. In general, a semigroup may have many children or none at all, making it difficult to understand the number of semigroups at a given depth on the tree. We investigate the problem of estimating the number of semigroups at depth g with h children, showing that as g becomes large, it tends to a proportion φ −h−2 of all numerical semigroups, where φ is the golden ratio.