betaFeedback

WorksMathematics

Counting Second-Order Schreier Sets with Minimum 2

Abstract

A finite nonempty set X⊂Z>0X \subset \mathbb{Z}_{>0} is (first-order) Schreier if ∣X∣≤min⁡X|X| \leq \min X. These Schreier sets can be generalized recursively to higher-order Schreier sets, and we specifically investigate the second-order Schreier sets. We show that the count of second-order Schreier sets with minimum element 22 and maximum element n+4n+4 is one more than the nthn^\text{th} term of the convolution of the Fibonacci numbers F1,F2,…F_1, F_2, \ldots with F2,F3,…F_2, F_3, \ldots (given by Sequence A023610 in the OEIS).

Paper details

vlnc:W_dsgjtycp
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…