On the number of generalized numerical semigroups
Abstract
Let rk be the unique positive root of xk - (x+1)k-1 = 0. We prove the best known bounds on the number ng,d of d-dimensional generalized numerical semigroups, in particular that \[ng,d > Cdg(d-1)/d r2dg\] for some constant Cd > 0, which can be made explicit. To do this, we extend the notion of multiplicity and depth to generalized numerical semigroups and show our lower bound is sharp for semigroups of depth 2. We also show other bounds on special classes of semigroups by introducing partition labelings, which extend the notion of Kunz words to the general setting.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.