On the type of an almost Gorenstein monomial curve (Q286554)

From MaRDI portal





scientific article; zbMATH DE number 6583408
Language Label Description Also known as
default for all languages
No label defined
    English
    On the type of an almost Gorenstein monomial curve
    scientific article; zbMATH DE number 6583408

      Statements

      On the type of an almost Gorenstein monomial curve (English)
      0 references
      20 May 2016
      0 references
      Let \(S\) be a numerical semigroup (a submonoid of \((\mathbb N,+)\) with finite complement in \(\mathbb N\), the set of nonnegative integers). The largest integer not belonging to \(S\) is known as the Frobenius number of \(S\), \(\mathrm F(S)\). The cardinality of \(\mathbb N\setminus S\) is the genus of \(S\), \(\mathrm g(S)\), and the type of \(S\), \(\mathrm t(S)\) is the cardinality of the set \(\mathrm{PF}(S)=\{ x\in\mathbb Z\setminus S\mid x+S\setminus\{0\}\subseteq S\}\). The type of \(S\) coincides with the Cohen-Macaulay type of the monomial curve associated to \(S\), or in other words, with the Cohen-Macaulay type of the ring \(K[\![S]\!]=K[\![t^s\mid s\in S]\!]\subseteq K[\![t]\!]\), with \(K\) a field. It is well known that \(\mathrm g(S)\geq (\mathrm F(S)+\mathrm t(S))/2)\). When the equality holds, then we say that \(S\) is \textit{almost symmetric}. Examples of almost symmetric numerical semigroups are symmetric numerical semigroups (\(\mathrm{PF}(S)=\{\mathrm F(S)\}\)) and pseudo-symmetric numerical semigroups (\(\mathrm{PF}(S)=\{\mathrm F(S), \mathrm F(S)/2\}\)). Every numerical semigroup has a minimal system of generators with finite cardinality, and this cardinality is known as the embedding dimension of the semigroup (which coincides with the embedding dimension of the maximal ideal of the local ring \(K[\![S]\!]\)). A classical result in numerical semigroups states that numerical semigroups with embedding dimension three have type one or two. The type is not bounded for numerical semigroups with embedding dimension four. However, under the assumption that \(S\) is almost symmetric, the author proves that \(S\) has type at most three. The main tool used by the author is the concept of RF-matrix (row-factorization matrix). Take \(f\in \mathrm{PF}(S)\), and assume that \(\{n_1,n_2,n_3,n_4\}\) is the minimal generating system for \(S\). Then \(f+n_i\in S\) for all \(i\in\{1,\dots, 4\}\), and consequently there exists \(a_{ij}\) such that \(f=\sum_{i=1}^4 a_{ij}n_j\) for all \(i\), and we take \(a_{ii}=-1\). The RF-matrix associated to \(f\) is then the matrix having coefficients \(a_{ij}\). Almost symmetry translates to symmetry in the set \(\mathrm{PF}(S)\) with respect to \(\mathrm F(S)\), that is, \(\mathrm F(S)-f\) is also in \(\mathrm{PF}(S)\) for any \(f\in\mathrm{PF}(S)\). The RF-matrices of \(f\) and \(\mathrm{PF}(S)\) are in some sense orthogonal: the product entry by entry is zero except in the diagonal (which is one).
      0 references
      numerical semigroup
      0 references
      almost symmetric
      0 references
      almost gorenstein
      0 references
      type of a numerical semigroup
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references