Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2403.13120 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- A \emph{numerical semigroup} is a subset $Λ$ of the nonnegative integers that is closed under addition, contains $0$, and omits only finitely many nonnegative integers (called the \emph{gaps} of $Λ$). The collection of all numerical semigroups may be visually represented by a tree of element removals, in which the children of a semigroup $Λ$ are formed by removing one element of $Λ$ that exceeds all existing gaps of $Λ$. In general, a semigroup may have many children or none at all, making it difficult to understand the number of semigroups at a given depth on the tree. We investigate the problem of estimating the number of semigroups at depth $g$ (i.e.\ of genus $g$) with $h$ children, showing that as $g$ becomes large, it tends to a proportion $ϕ^{-h-2}$ of all numerical semigroups, where $ϕ$ is the golden ratio.