Triangular numerical semigroups
Let \(\mathbb{N}\) denote the set of non-negative integers. A numerical semigroup is an additive submonoid of \(\mathbb{N}\) with finite complement in \(\mathbb{N}\). Every numerical semigroup \(S\) is minimally generated by \(S^*\setminus(S^*+S^*)\). The cardinality of this set is called the embedding dimension of \(S\). For \(n\in\mathbb{N}\), let \(t_n=\binom{n+1}2\) and let \(S_n\) be the submonoid of \(\mathbb{N}\) generated by \(\{t_{n+k}: k\in\mathbb{N} \}\). Then, \(S_n\) is a numerical semigroup. By analizying recurrence relations for the sequence \(\{t_n\}_{n\in\mathbb{N}}\), the authors give an explicit description of \(S_n^*\setminus(S_n^*+S_n^*)\), which is a subset of \(\{t_k: k\in\{n,n+1,\dots,2n\}\}\). This enables them to provide upper and lower bounds for the embedding dimension of \(S_n\).
- Numerical semigroups.
- On the numerical semigroup generated by \(\{b^{n+1+i}+\frac{b^{n+i}-1}{b-1}\mid i\in\mathbb{N}\}\)
- The Frobenius number for sequences of triangular and tetrahedral numbers
- The Frobenius problem for a class of numerical semigroups
- The Frobenius problem for Mersenne numerical semigroups
This page was built for publication: Triangular numerical semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6067751)
