Counting numerical semigroups by genus and some cases of a question of Wilf. (Q436083): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Władysław Narkiewicz / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20M14 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05A15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 11D07 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6060926 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
numbers of numerical semigroups | |||
Property / zbMATH Keywords: numbers of numerical semigroups / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Apéry sets | |||
Property / zbMATH Keywords: Apéry sets / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
multiplicities | |||
Property / zbMATH Keywords: multiplicities / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
genera | |||
Property / zbMATH Keywords: genera / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
embedding dimension | |||
Property / zbMATH Keywords: embedding dimension / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Frobenius numbers | |||
Property / zbMATH Keywords: Frobenius numbers / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: SageMath / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: NumericalSemigroupsWithGenus / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
Property / cites work | |||
Property / cites work: COUNTING NUMERICAL SEMIGROUPS WITH SHORT GENERATING FUNCTIONS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fibonacci-like behavior of the number of numerical semigroups of a given genus. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Representation of numerical semigroups by Dyck paths. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounds on the number of numerical semigroups of a given genus / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Towards a better understanding of the semigroup tree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: SYSTEMS OF INEQUALITIES AND NUMERICAL SEMIGROUPS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generalized Ehrhart polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3637544 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improved bounds on the number of numerical semigroups of a given genus / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Numerical semigroups. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Postage Stamp Problem and Essential Subsets in Integer Bases / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Non-Weierstrass numerical semigroups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3754723 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Constructions of generalized Sidon sets. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Counting numerical sets with no small atoms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Gaps in semigroups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On symmetric numerical semigroups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving a linear equation in a set of integers I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the linear diophantine problem of Frobenius. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On certain n-sheeted coverings of curves and numerical semigroups which cannot be realized as weierstrass semigroups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Circle-Of-Lights Algorithm for the "Money-Changing Problem" / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Upper bounds for finite additive $2$-bases / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Constructing numerical semigroups of a given genus. / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:40, 5 July 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
0 references