Paperlane

no. 16 · Tuesday 17 November 2026

Counting Second-Order Schreier Sets with Minimum 2

Dongho Kim

math.GM · v2 · 17 pp

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).

comments
17 pages
fields
General Mathematics
pdf ↗ page arXiv:2611.17371 ↗