arXiv · 2611.17371
Counting Second-Order Schreier Sets with Minimum 2
Abstract
A finite nonempty subset of the positive integers is first-order Schreier if the minimum element of that set is greater than or equal to the size of the set. We can generalize the first-order Schreier sets recursively to higher orders, and we specifically investigate the second-order Schreier sets. We show a combinatorial relationship between the count of second-order Schreier sets with minimum element $2$ and the index shift of a convolution of the Fibonacci numbers (given by Sequence A023610 in the OEIS).
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Dongho Kim. 2026-11-16. Counting Second-Order Schreier Sets with Minimum 2. https://searcharxiv.com/abs/2611.17371
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.