A generalization of a theorem about gapsets with depth at most three
Combinatorics
2023-06-07 v2
Abstract
In this paper, we provide a generalization of a theorem proved by Eliahou and Fromentin, which exhibit a remarkable property of the sequence , where denotes the number of gapsets with genus and depth at most .
Cite
@article{arxiv.2202.07694,
title = {A generalization of a theorem about gapsets with depth at most three},
author = {Matheus Bernardini and Patrick Melo},
journal= {arXiv preprint arXiv:2202.07694},
year = {2023}
}
Comments
6 pages