English

Linear Recurrences of Generalized Schreier Sets Revisited

Combinatorics 2026-02-17 v3 Number Theory

Abstract

For p,qNp, q\in \mathbb{N}, a finite nonempty set FF is said to be (p,q)(p,q)-Schreier (or maximal (p,q)(p,q)-Schreier, respectively) if qminFpFq\min F\ge p|F| (or qminF=pFq\min F = p|F|, respectively). For nNn\in \mathbb{N}, let Snp/q := {F{1,2,,n}:qminFpF\mboxandnF}.\mathcal{S}^{p/q}_{n}\ :=\ |\{F\subset\{1, 2, \ldots, n\}\,:\, q\min F\ge p|F|\mbox{ and }n\in F\}|. Using the Inclusion-Exclusion Principle, Beanland et al. proved the recurrence Snp/q = k=1q(1)k+1(qk)Snkp/q+Sn(p+q)p/q.|\mathcal{S}^{p/q}_{n}|\ =\ \sum_{k=1}^q(-1)^{k+1}\binom{q}{k}|\mathcal{S}^{p/q}_{n-k}| + |\mathcal{S}^{p/q}_{n-(p+q)}|. We show that (Snp/q)n=1(|\mathcal{S}^{p/q}_n|)_{n=1}^\infty 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 (Mnp/q)n=1(|\mathcal{M}^{p/q}_{n}|)_{n=1}^\infty that counts maximal (p,q)(p,q)-Schreier sets. We end with a discussion of the relation between (Snp/q)n=1(|\mathcal{S}^{p/q}_{n}|)_{n=1}^\infty and (Mnp/q)n=1(|\mathcal{M}^{p/q}_{n}|)_{n=1}^\infty.

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