Counting Unions of Schreier Sets

arXiv2211.01049MaRDI QIDQ6415908FDOQ6415908

Authors: Kevin Beanland, Dmitriy Gorovoy, Daniil Homza 

Publication date: 2 November 2022

Abstract: A subset of natural numbers $F$ is called a Schreier set if $|F|leqslantminF$ (where $|F|$ is the cardinality of $F$). Let $mathcalS$ denote the family of Schreier sets. Alistair Bird observed that if $mathcal{S}^n$ denotes all Schreier sets with maximum element $n$, then $(|mathcal{S}^n|{)}_{n=1}^{i}nfty$ is the Fibonacci sequence. In this paper, for each $kinmathbbN$ we consider the family $kmathcalS$, where each set is the union of $k$ many Schreier sets, and prove that each sequence $(|(kmathcalS{)}^n|{)}_{n=1}^{i}nfty$ is a linear recurrence sequence and moreover, the recursions themselves can be generated by a simple inductive procedure. Moreover, we develop some more interesting formulas describing the sequence.

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19)

This page was built for publication: Counting Unions of Schreier Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6415908)