A generalization of a theorem about gapsets with depth at most three

Abstract

In this paper, we provide a generalization of a theorem proved by Eliahou and Fromentin, which exhibit a remarkable property of the sequence $(n_g^{\prime })$, where $n_g^{\prime }$ denotes the number of gapsets with genus $g$ and depth at most $3$.

6 pages

References in corpus (1)

• Fibonacci-Like Behavior of the Number of Numerical Semigroups of a Given Genus