The shape of a random numerical semigroup
Abstract
We study statistical properties of random numerical semigroups of a given genus. We analyze the graph of a typical numerical semigroup, understood as a function from N to N. If S is a numerical semigroup of genus g, this leads us to consider the collection of points (k-1g-1,ak(S)g ) where 1 k g and ak(S) denotes the kth smallest nonzero element of S. We show that as g → ∞, this set of points typically becomes closer to a union of two line segments. We prove analogous results for numerical semigroups ordered by Frobenius number.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.