Type sequences of numerical semigroups
A numerical semigroup (briefly n.s.) \(S\subseteq\mathbb{N}\cup\{0\}\) is a subsemigroup of \((\mathbb{N},+)\) with \(0\in S\). Note that every n.s. is finitely generated. If \(g(S)=\max\{x\in\mathbb{Z}\setminus S\}\) is the so called Frobenius number of \(S\) and \(n(S)=\text{Card}(\{0,1,\dots,g(S)\}\cap S)\) then \(S=\{0=s_0,s_1,\dots,s_{n-1},s_n=g(S)+1,g(S)+2,\dots\}\). Consider, for \(i\geq 0\), the sets \(S_i=\{x\in S\mid x\geq s_i\}\), and \(S(i)=\{x\in\mathbb{N}\mid x+S_i\subseteq S\}\). If we put, for \(i\geq 1\), \(t_i(S)=\text{Card}(S(i)\setminus S(i-1))\), then the numeric sequence \(\{t_1,t_2,\dots,t_{n(S)}\}\) is called the type sequence of \(S\). After proving some general results on type sequences, the author gives a complete characterization of n.s. \(S\) with \(n(S)=3\) or \(4\) (the case \(n(S)=2\) is considered by \textit{V. Barucci, D. E. Dobbs} and \textit{M. Fontana} [Mem. Am. Math. Soc. 598 (1997; Zbl 0868.13003)]). These results provide a contribution towards the problem to characterize the \(n\)-tuples of integers which are the type sequence of a n.s. From the other results let us mention upper and lower bounds for \(t_i(S)\)'s. The paper finishes with an algorithm for computing the type sequence of a given n.s. The algorithm is based on a result giving the so called standard basis of a n.s.
- Numerical semigroups.
- On the type sequences of some one dimensional rings
- On the Frobenius problem for \(\{a^{k}, a^{k} + 1, a^{k} + a, \dots , a^{k} + a^{k-1}\}\)
- Numerical semigroups with a given set of pseudo-Frobenius numbers
- Numerical semigroups with embedding dimension three.
- scientific article; zbMATH DE number 7648833
- The Frobenius problem for numerical semigroups with multiplicity four.
- A combinatorial problem and numerical semigroups
- Numerical semigroups with multiplicity three and four.
- Fundamental gaps in numerical semigroups.
- A note on the computation of the Frobenius number of a numerical semigroup.
- On partitions and Arf semigroups
- Numerical semigroups on compound sequences
- On the generalized Feng-Rao numbers of numerical semigroups generated by intervals
- What is a sequence of Nilsson type?
- On the Type and the Minimal Presentation of Certain Numerical Semigroups
- On the type sequences of some one dimensional rings
- scientific article; zbMATH DE number 510613 (Why is no real title available?)
- On a family of saturated numerical semigroups with multiplicity four
- Numerical semigroups of small and large type
- On numerical semigroups generated by compound sequences
- scientific article; zbMATH DE number 2217243 (Why is no real title available?)
- Young tableaux and Arf partitions
- scientific article; zbMATH DE number 7648833 (Why is no real title available?)
- Enumerating numerical sets associated to a numerical semigroup
- A note on half of some MED semigroups of maximal or almost maximal length
- Unboundedness of the first Betti number and the last Betti number of numerical semigroups generated by concatenation
- On type sequences of some Arf numerical semigroups with determination number five
This page was built for publication: Type sequences of numerical semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1375904)
