Linear Recurrences of Generalized Schreier Sets Revisited
Abstract
For p, q∈ N, a finite nonempty set F is said to be (p,q)-Schreier (or maximal (p,q)-Schreier, respectively) if q F p|F| (or q F = p|F|, respectively). For n∈ N, let Sp/qn\ :=\ |\F⊂\1, 2, …, n\\,:\, q F p|F| and n∈ F\|. Using the Inclusion-Exclusion Principle, Beanland et al. proved the recurrence |Sp/qn|\ =\ Σk=1q(-1)k+1qk|Sp/qn-k| + |Sp/qn-(p+q)|. We show that (|Sp/qn|)n=1∞ 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 (|Mp/qn|)n=1∞ that counts maximal (p,q)-Schreier sets. We end with a discussion of the relation between (|Sp/qn|)n=1∞ and (|Mp/qn|)n=1∞.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.