Linear Recurrences of Generalized Schreier Sets Revisited
Combinatorics
2026-02-17 v3 Number Theory
Abstract
For , a finite nonempty set is said to be -Schreier (or maximal -Schreier, respectively) if (or , respectively). For , let Using the Inclusion-Exclusion Principle, Beanland et al. proved the recurrence We show that is a subsequence with terms taken periodically from Padovan-like sequences which satisfy simple recurrence relations. As an application, we obtain an alternative proof of the above linear recurrence. Furthermore, a similar result holds for the sequence that counts maximal -Schreier sets. We end with a discussion of the relation between and .
Keywords
Cite
@article{arxiv.2506.14312,
title = {Linear Recurrences of Generalized Schreier Sets Revisited},
author = {Hung Viet Chu and Zachary Louis Vasseur},
journal= {arXiv preprint arXiv:2506.14312},
year = {2026}
}
Comments
16 pages, 4 tables