On the enumeration of the set of numerical semigroups with fixed Frobenius number.
From MaRDI portal
Publication:453850
DOI10.1016/J.CAMWA.2011.12.034zbMATH Open1251.20055OpenAlexW1973388793WikidataQ58842603 ScholiaQ58842603MaRDI QIDQ453850FDOQ453850
Authors: Víctor Blanco, José Carlos Rosales
Publication date: 30 September 2012
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2011.12.034
Recommendations
- scientific article; zbMATH DE number 7637229
- The enumeration of the set of atomic numerical semigroups with fixed Frobenius number
- The set of numerical semigroups of a given genus.
- On the enumeration of the set of numerical semigroups with fixed Frobenius number and fixed number of second kind gaps
- The set of numerical semigroups of a given multiplicity and Frobenius number
Cites Work
- Title not available (Why is that?)
- Numerical semigroups.
- Maximality properties in numerical semigroups and applications to one-dimensional analytically irreducible local domains
- On the linear diophantine problem of Frobenius.
- Title not available (Why is that?)
- Title not available (Why is that?)
- On numerical semigroups
- Irreducible numerical semigroups.
- The frobenius number of some semigroups
- Fundamental gaps in numerical semigroups.
- Irreducibility in the set of numerical semigroups with fixed multiplicity.
- SYSTEMS OF INEQUALITIES AND NUMERICAL SEMIGROUPS
- Title not available (Why is that?)
- Integer knapsacks: average behavior of the Frobenius numbers
- On the Frobenius number of Fibonacci numerical semigroups
Cited In (23)
- Atoms of the set of numerical semigroups with fixed Frobenius number.
- A problem of integer partitions and numerical semigroups
- The enumeration of the set of atomic numerical semigroups with fixed Frobenius number
- Title not available (Why is that?)
- On the enumeration of the set of saturated numerical semigroups with fixed Frobenius number.
- Algorithms and basic asymptotics for generalized numerical semigroups in \(\mathbb N^d\)
- Constructing the set of complete intersection numerical semigroups with a given Frobenius number.
- Quasi-polynomial growth of numerical and affine semigroups with constrained gaps
- An improved algorithm to compute the \(\omega\)-primality
- The covariety of numerical semigroups with fixed Frobenius number
- On the enumeration of the set of numerical semigroups with fixed Frobenius number and fixed number of second kind gaps
- Counting numerical semigroups with short generating functions.
- The set of numerical semigroups of a given genus.
- The maximal denumerant of a numerical semigroup.
- The tree of irreducible numerical semigroups with fixed Frobenius number
- The set of numerical semigroups of a given multiplicity and Frobenius number
- Counting the numerical semigroups with a specific special gap
- Numerical semigroups with a given set of pseudo-Frobenius numbers
- Distribution of genus among numerical semigroups with fixed Frobenius number
- Numerical semigroups with concentration two
- Almost-positioned numerical semigroups
- On the Frobenius Problem of Numerical Semigroups
- On sets related to integer partitions with quasi-required elements and disallowed elements
Uses Software
This page was built for publication: On the enumeration of the set of numerical semigroups with fixed Frobenius number.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453850)