Counting numerical semigroups by genus and some cases of a question of Wilf. (Q436083): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.jpaa.2011.10.038 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1982536303 / rank | |||
Normal rank |
Revision as of 22:18, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Counting numerical semigroups by genus and some cases of a question of Wilf. |
scientific article |
Statements
Counting numerical semigroups by genus and some cases of a question of Wilf. (English)
0 references
30 July 2012
0 references
A numerical semigroup \(S\) is a set of non-negative integers closed under addition and containing all sufficiently large integers. Its genus is the cardinality of \(\mathbb N_0\setminus S\), and its multiplicity is the smallest nonzero element of \(S\). The number of numerical semigroups with genus \(g\) and multiplicity \(m\) is denoted by \(N(g,m)\). The author shows that for each \(k\geq 0\) there exists a monic polynomial \(f_k(X)\) such that if \(m>2k\), then \[ N(m,m+k)={1\over(k+1)!}f_k(m), \] and determines explicitly \(f_k\) for \(k\leq 7\). He shows also that this formula may fail if \(m\leq 2k\), as the example \(m=k=5\) shows. An important step in the proof forms the equality \[ N(m-1,g-1)+N(m-1,g-2)=N(m,g) \] established in Theorem 1. The paper contains also interesting discussions on other aspects of the theory of numerical semigroups.
0 references
numbers of numerical semigroups
0 references
Apéry sets
0 references
multiplicities
0 references
genera
0 references
embedding dimension
0 references
Frobenius numbers
0 references