Gapsets and the $k$-generalized Fibonacci sequences
Combinatorics
2022-08-17 v1
Abstract
In this paper, we bring the terminology of the Kunz coordinates of numerical semigroups to gapsets and we generalize this concept to -extensions. It allows us to identify gapsets and, in general, -extensions with tilings of boards. As a consequence, we prove a version of Bras-Amor\'{o}s conjecture for -extensions. Besides, we obtain a lower bound for the number of gapsets with fixed genus and depth at most 3 and a family of upper bounds for the number of gapsets with fixed genus. Moreover, we present explicit formulas for the number of gapsets with fixed genus and depth, when the multiplicity is 3 or 4, and, in some cases, for the number of gapsets with fixed genus and depth.
Keywords
Cite
@article{arxiv.2208.07692,
title = {Gapsets and the $k$-generalized Fibonacci sequences},
author = {Gilberto B. Almeida Filho and Matheus Bernardini},
journal= {arXiv preprint arXiv:2208.07692},
year = {2022}
}
Comments
23 pages, 1 figure