On some invariants in numerical semigroups and estimations of the order bound. (Q617851): Difference between revisions

A set \(S=\{s_0=0<s_1<\cdots\}\) of non-negative integers closed under addition and containing all sufficiently large integers is called a numerical semigroup. The authors consider eleven numerical invariants of \(S\) and prove several relations between them. Of particular importance in coding theory [see e.g. \textit{G.-L. Feng, T. R. N. Rao}, IEEE Trans. Inf. Theory 40, No. 4, 1003-1012 (1994; Zbl 0814.94027)] is the invariant \(m(S)\), defined as follows: for \(i=0,1,2\dots\) let \(\nu(s_i)\) be the number of representations \(s_i=s_j+s_k\) and let \(m=m(S)\) be the minimal index \(j\) such that the sequence \(\nu(s_i)\) is non-decreasing for \(i>j\). The authors obtain lower bounds for \(s_{m(S)}\) in several new cases, extending their results obtained earlier [J. Pure Appl. Algebra 212, No. 10, 2271-2283 (2008; Zbl 1173.20040); ibid. 213, No. 6, 1179-1191 (2009; Zbl 1197.20052)].