On the enumeration of the set of saturated numerical semigroups with fixed Frobenius number.

DOI10.1016/j.amc.2014.03.058zbMath1334.20050DBLPjournals/amc/RosalesBT14OpenAlexW2016172581WikidataQ58842562 ScholiaQ58842562MaRDI QIDQ273341

D. Torrão, José Carlos Rosales, Manuel Batista Branco

Publication date: 21 April 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.03.058

zbMATH Keywords

algorithmsminimal systems of generatorsFrobenius numberssaturated numerical semigroups

Mathematics Subject Classification ID

Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05)

Related Items (3)

Parametrizing Arf numerical semigroups ⋮ Unnamed Item ⋮ Perfect numerical semigroups

Uses Software

• GAP
• numericalsgps

Cites Work

• Algebro-geometric properties of saturated rings
• Numerical semigroups.
• Maximality properties in numerical semigroups and applications to one-dimensional analytically irreducible local domains
• General Theory of Saturation and of Saturated Local Rings. III. Saturation in Arbitrary Dimension and, in Particular, Saturation of Algebroid Hypersurfaces
• Fast algorithms for genegrating integer partitions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the enumeration of the set of saturated numerical semigroups with fixed Frobenius number.