← ALB News · curated headline

Counting Second-Order Schreier Sets with Minimum 2

arXiv Mathematics · WORLD · Mathematics · 11/16/2026, 12:00:00 AM

arXiv:2611.17371v1 Announce Type: new Abstract: A finite nonempty set $X \subset \mathbb{Z}_{>0}$ is (first-order) Schreier if $|X| \leq \min X$. These Schreier sets can be generalized recursively to higher-order Schreier sets, and we specifically investigate the second-order Schreier sets. We show that the count of second-order Schreier sets with minimum element $2$ and maximum element $n+4$ is one more than the $n^\text{th}$ term of the convolution of the Fibonacci numbers $F_1, F_2, \ldots$ with $F_2, F_3, \ldots$ (given by Sequence A023610 in the OEIS).

Continue to arXiv Mathematics →

You are being forwarded in 6s — stay on this page