Counting numerical semigroups by Frobenius number, multiplicity, and depth

DOI10.5070/c63362789arXiv2208.14587OpenAlexW4390114396MaRDI QIDQ6204688

Sean Li

Publication date: 2 April 2024

Published in: Combinatorial Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.14587

zbMATH Keywords

graph homomorphismsnumerical semigroupsKunz coordinates

Mathematics Subject Classification ID

Commutative semigroups (20M14) Asymptotic enumeration (05A16)

Cites Work

• Unnamed Item
• Unnamed Item
• Counting numerical semigroups by genus and some cases of a question of Wilf.
• Fibonacci-like growth of numerical semigroups of a given genus.
• Gapsets and numerical semigroups
• Distribution of genus among numerical semigroups with fixed Frobenius number
• The set of numerical semigroups of a given multiplicity and Frobenius number
• Fibonacci-like behavior of the number of numerical semigroups of a given genus.
• The Bipartite Swapping Trick on Graph Homomorphisms
• SYSTEMS OF INEQUALITIES AND NUMERICAL SEMIGROUPS
• On the number of semigroups of natural numbers.
• Counting Numerical Semigroups
• Parametrizing Arf numerical semigroups
• THE METHOD OF HYPERGRAPH CONTAINERS
• The enumeration of the set of atomic numerical semigroups with fixed Frobenius number
• Integer colorings with forbidden rainbow sums
• Sub-Fibonacci behavior in numerical semigroup enumeration

This page was built for publication: Counting numerical semigroups by Frobenius number, multiplicity, and depth