Counting Unions of Schreier Sets

Authors Kevin Beanland, Dmitriy Gorovoy, Daniil Homza

Publication date 2 November 2022

Combinatorial identities, bijective combinatorics (05A19)

Abstract: A subset of natural numbers

F

is called a Schreier set if

| F | l e q s l a n t m i n F

(where

| F |

is the cardinality of

F

). Let

m a t h c a l S

denote the family of Schreier sets. Alistair Bird observed that if

m a t h c a l S^{n}

denotes all Schreier sets with maximum element

n

, then

(| m a t h c a l S^{n} |)_{n = 1}^{i} n f t y

is the Fibonacci sequence. In this paper, for each

k i n m a t h b b N

we consider the family

k m a t h c a l S

, where each set is the union of

k

many Schreier sets, and prove that each sequence

(| (k m a t h c a l S)^{n} |)_{n = 1}^{i} n f t y

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.

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)