Constructing numerical semigroups of a given genus

Let n _g denote the number of numerical semigroups of genus g. Bras-Amorós conjectured that n _g possesses certain Fibonacci-like properties. Almost all previous attempts at proving this conjecture were based on analyzing the semigroup tree. We offer a new, simpler approach to counting numerical semigroups of a given genus. Our method gives direct constructions of families of numerical semigroups, without referring to the generators or the semigroup tree. In particular, we give an improved asymptotic lower bound for n _g .     

On the enumeration of the set of saturated numerical semigroups of a given genus

In this paper we present an algorithm for computing the set of saturated numerical semigroups of a given genus. We see how the set of saturated numerical semigroups can be arranged in a tree rooted in \(\mathbb{N}\) and we describe the sons of any vertex of this tree.     

Fibonacci-like growth of numerical semigroups of a given genus

We give an asymptotic estimate of the number of numerical semigroups of a given genus. In particular, if n _g is the number of numerical semigroups of genus g, we prove that $$\lim_{g \rightarrow \infty} n_g \varphi^{-g} = S $$ where $\varphi = \frac{1 + \sqrt{5}}{2}$ is the golden ratio and S is a constant, resolving several related conjectures concerning the growth of n _g . In addition, we show that the proportion of numerical semigroups of genus g satisfying f<3m approaches 1 as g→∞, where m is the multiplicity and f is the Frobenius number.     

Bounds on the number of numerical semigroups of a given genus

Lower and upper bounds are given for the number n_g of numerical semigroups of genus g. The lower bound is the first known lower bound while the upper bound significantly improves the only known bound given by the Catalan numbers. In a previous work the sequence n_g is conjectured to behave asymptotically as the Fibonacci numbers. The lower bound proved in this work is related to the Fibonacci numbers and so the result seems to be in the direction to prove the conjecture. The method used is based on an accurate analysis of the tree of numerical semigroups and of the number of descendants of the descendants of each node depending on the number of descendants of the node itself.     

Fibonacci-like behavior of the number of numerical semigroups of a given genus

We conjecture a Fibonacci-like property on the number of numerical semigroups of a given genus. Moreover we conjecture that the associated quotient sequence approaches the golden ratio. The conjecture is motivated by the results on the number of semigroups of genus at most 50. The Wilf conjecture has also been checked for all numerical semigroups with genus in the same range.     

Counting numerical semigroups by genus and even gaps

Let $n_g$ be the number of numerical semigroups of genus $g$. We present an approach to compute $n_g$ by using even gaps, and the question: Is it true that $n_{g+1}>n_g$? is investigated. Let $N_{\gamma }\left(g\right)$ be the number of numerical semigroups of genus $g$ whose number of even gaps equals $\gamma$. We show that $N_{\gamma }\left(g\right)=N_{\gamma }\left(3\gamma \right)$ for $\gamma \le ?g∕3?$ and $N_{\gamma }\left(g\right)=0$ for $\gamma >?2g∕3?$; thus the question above is true provided that $N_{\gamma }(g+1)>N_{\gamma }\left(g\right)$ for $\gamma =?g∕3?+1,\dots ,?2g∕3?$. We also show that $N_{\gamma }\left(3\gamma \right)$ coincides with $f_{\gamma }$, the number introduced by Bras-Amorós (2012) in connection with semigroup-closed sets. Finally, the stronger possibility $f_{\gamma }～{\phi }^{2\gamma }$ arises being $\phi =(1+\sqrt{5})∕2$ the golden number.     

Lattice paths with given number of turns and semimodules over numerical semigroups

Let Γ=〈α,β〉 be a numerical semigroup. In this article we consider several relations between the so-called Γ-semimodules and lattice paths from (0,α) to (β,0): we investigate isomorphism classes of Γ-semimodules as well as certain subsets of the set of gaps of Γ, and finally syzygies of Γ-semimodules. In particular we compute the number of Γ-semimodules which are isomorphic with their k-th syzygy for some k.     

Atoms of the set of numerical semigroups with fixed Frobenius number

Given a positive integer g, we denote by F(g) the set of all numerical semigroups with Frobenius number g. The set (F(g),∩) is a semigroup. In this paper we study the generators of this semigroup.     

Balanced numerical semigroups

We investigate the Frobenius number, genus, type, and minimal presentation of a class of numerical semigroups of embedding dimension 4 of the form \(S = \langle a_1, a_2, a_3, a_4 \rangle \) such that \(a_1 + a_4 = a_2 + a_3\). The investigation focuses on determining the Apery set of S with respect to the multiplicity.     

The Frobenius problem for numerical semigroups

In this paper, we characterize those numerical semigroups containing 〈n₁,n₂〉. From this characterization, we give formulas for the genus and the Frobenius number of a numerical semigroup. These results can be used to give a method for computing the genus and the Frobenius number of a numerical semigroup with embedding dimension three in terms of its minimal system of generators.     

Dense numerical semigroups

Semigroup Forum - A numerical semigroup S is dense if for all $$sin Sbackslash {0}$$ we have $$left{ s-1,s+1right} cap Sne emptyset $$ . We give algorithms to compute the whole set of...     

Homogeneous numerical semigroups

We introduce the concept of homogeneous numerical semigroups and show that all homogeneous numerical semigroups with Cohen–Macaulay tangent cones are of homogeneous type. In embedding dimension three, we classify all numerical semigroups of homogeneous type into numerical semigroups with complete intersection tangent cones and the homogeneous ones which are not symmetric with Cohen–Macaulay tangent cones. We also study the behavior of the homogeneous property by gluing and shiftings to construct large families of homogeneous numerical semigroups with Cohen–Macaulay tangent cones. In particular we show that these properties fulfill asymptotically in the shifting classes. Several explicit examples are provided along the paper to illustrate the property.     

The Frobenius problem for repunit numerical semigroups

A repunit is a number consisting of copies of the single digit 1. The set of repunits in base b is \(\big \{\frac{b^n-1}{b-1} ~|~ n\in {\mathbb N}\backslash \{0\}\big \}\). A numerical semigroup S is a repunit numerical semigroup if there exist integers \(b\in {\mathbb N}\backslash \left\{ 0,1\right\} \) and \(n\in {\mathbb N}\backslash \left\{ 0\right\} \) such that \(S=\big \langle \big \{\frac{b^{n+i}-1}{b-1} ~|~ i\in {\mathbb N}\big \}\big \rangle \). In this work, we give formulas for the embedding dimension, the Frobenius number, the type and the genus for a repunit numerical semigroup.     

Circuits including a given set of vertices

Let G = (V, E) be a digraph of order n, satisfying Woodall's condition ? x, y ∈ V, if (x, y) ? E, then d⁺(x) + d^?(y) ≥ n. Let S be a subset of V of cardinality s. Then there exists a circuit including S and of length at most Min(n, 2s). In the case of oriented graphs we obtain the same result under the weaker condition d⁺(x) + d^?(y) ≥ n – 2 (which implies hamiltonism).