Matheus Bernardini, Patrick Melo
Published 2022-02-15Version 1
In this note, we give an alternative proof for a theorem by Eliahou and Fromentin, which exhibit a remarkable property of the sequence $(n'_g)$, where $n'_g$ denotes the number of gapsets with genus $g$ and depth at most $3$.
The meet operation in the imbalance lattice of maximal instantaneous codes: alternative proof of existence
Short note on the convolution of binomial coefficients
Sets with no solutions to $x+y=3z$
![QR code for arXiv:2202.07694 [math.CO]](http://oss.arxitics.com/images/favicon.svg)