Table of Contents
Fetching ...

Linear Recurrences of Generalized Schreier Sets Revisited

Hung Viet Chu, Zachary Louis Vasseur

Abstract

For $p, q\in \mathbb{N}$, a finite nonempty set $F$ is said to be $(p,q)$-Schreier (or maximal $(p,q)$-Schreier, respectively) if $q\min F\ge p|F|$ (or $q\min F = p|F|$, respectively). For $n\in \mathbb{N}$, let $$\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 $$|\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 $(|\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 $(|\mathcal{M}^{p/q}_{n}|)_{n=1}^\infty$ that counts maximal $(p,q)$-Schreier sets. We end with a discussion of the relation between $(|\mathcal{S}^{p/q}_{n}|)_{n=1}^\infty$ and $(|\mathcal{M}^{p/q}_{n}|)_{n=1}^\infty$.

Linear Recurrences of Generalized Schreier Sets Revisited

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 .

Paper Structure

This paper contains 7 sections, 6 theorems, 73 equations, 4 tables.

Key Result

Theorem 1.1

For $(p, q, n)\in \mathbb{N}^3$, it holds that and

Theorems & Definitions (14)

  • Theorem 1.1
  • Corollary 1.2
  • Corollary 1.3
  • proof : Proof of \ref{['eee13']}
  • proof : Proof of \ref{['eee14']}
  • proof : Proof of Theorem \ref{['rc1']}
  • Definition 3.1
  • Lemma 3.2
  • proof : Proof of Corollaries \ref{['cc1']} and \ref{['cc2']}
  • Remark 3.3
  • ...and 4 more