Schreier Sets in Combinatorics

• Schreier sets are finite subsets of ℕ defined by a lower bound linking the minimum element and the set's cardinality, with several conventions used in current research.
• Their enumeration exhibits Fibonacci-like recurrences, often derived via inclusion–exclusion and bijective proofs, which underpin many generalizations.
• Variants of Schreier sets extend applications to Banach space theory, combinatorial partitioning, and graph and arithmetic interpretations, highlighting their structural versatility.

Schreier sets are finite subsets of the natural numbers defined by a lower bound linking cardinality to the least element. In the most common combinatorial convention, a nonempty finite set $F\subset \mathbb N$ is Schreier when $\min F\ge |F|$; nearby conventions replace $\ge$ by $>$, include $\emptyset$, or isolate the exact-equality barrier $|s|=1+\min s$. Since their introduction by Jozef Schreier in 1930, these families have become a recurring object in Banach space theory, combinatorics, and adjacent areas, with later work connecting them to Fibonacci numbers, higher-order linear recurrences, partition theory, Turán-type graph counts, and Ramsey-like principles on barriers (Nataraj, 2022, Beanland et al., 2021, Carlucci et al., 2024).

1. Classical definition, variants, and notation

The basic inequality is stable across the literature, but the surrounding convention is not. Some authors work with nonempty finite sets, some adjoin the empty set, and some reserve the name “Schreier” for the strict inequality. The following table records the conventions that occur explicitly in recent work.

Convention	Defining condition	Source
Classical Schreier set	$F\subseteq \mathbb N$ nonempty finite, $|F|\le \min F$	(Beanland et al., 2022)
Schreier set with empty set adjoined	$A=\emptyset$ or $\min A\ge |A|$	(Chu, 2022)
Strong/strict Schreier convention	$\min F\ge |F|$0	(Chu et al., 2023)
Exact Schreier barrier	$\min F\ge |F|$1	(Carlucci et al., 2024)
$\min F\ge |F|$2-strong Schreier	$\min F\ge |F|$3	(Beanland et al., 2023)

A second standard refinement distinguishes weak, strong, and maximal forms. One paper explicitly uses “weak-Schreier” for $\min F\ge |F|$4, “strong-Schreier” for $\min F\ge |F|$5, and “maximal” for $\min F\ge |F|$6 (Chu, 2019). In that terminology, maximal Schreier sets sit on the boundary of admissibility, while strong Schreier sets lie strictly inside it.

The exact barrier $\min F\ge |F|$7 is not merely a cosmetic variant of the weak inequality family. In the logic and barrier-Ramsey literature it is treated as the Schreier barrier, equivalently the family of exactly $\min F\ge |F|$8-large sets, and its role is structural rather than enumerative (Carlucci et al., 2024). This distinction matters because several results that hold for $\min F\ge |F|$9 have different formulations, and sometimes different strength, for $\ge$0.

2. Historical origin and Fibonacci enumerations

The historical starting point recorded in the number-theoretic literature is that Schreier sets were introduced in 1930 by Jozef Schreier to construct a counterexample to a conjecture of Banach (Nataraj, 2022). Later work broadened their role: one paper notes that they are “fundamental in the study of weakly null sequences, convex combinations, and related asymptotic structures in Banach spaces,” even when the focus is purely combinatorial (Beanland et al., 2022). The same abstract record states that George Andrews found “interesting connections between these sets and Fibonacci number” in 1974, and that later combinatorial results were proved by Chu, Beanland, and Finch-Smith (Nataraj, 2022).

The canonical enumerative result is Bird’s Fibonacci theorem. With

$\ge$1

one has

$\ge$2

so the counting sequence is Fibonacci (Beanland et al., 2021). This is the template from which many later generalizations proceed.

The Fibonacci phenomenon persists under several classical re-indexings. If $\ge$3 counts weak-Schreier sets with largest element $\ge$4, $\ge$5 strong-Schreier sets with largest element $\ge$6, $\ge$7 maximal sets with largest element $\ge$8, $\ge$9 weak-Schreier subsets of $>$0, and $>$1 strong-Schreier subsets of $>$2, then

$>$3

in the normalization $>$4, $>$5, $>$6 (Chu, 2019). The same paper gives a direct bijection between weak-Schreier subsets of $>$7 and Zeckendorf subsets, using

$>$8

which converts the Schreier lower bound on the minimum into the nonconsecutiveness condition for Zeckendorf sets (Chu, 2019).

This body of results shows that Fibonacci counts are not an isolated accident of one indexing choice. They are a recurrent manifestation of the same combinatorial mechanism: admissible sets can often be partitioned according to the presence or absence of a critical large element, and the two pieces are naturally identified with earlier stages.

3. Generalized Schreier-type recurrences

A large part of the modern theory replaces the classical inequality by a linear relation between $>$9 and $\emptyset$0. One important family is

$\emptyset$1

for fixed $\emptyset$2. For $\emptyset$3,

$\emptyset$4

When $\emptyset$5 this becomes Fibonacci; when $\emptyset$6 it yields

$\emptyset$7

and when $\emptyset$8 it produces the new binomial-coefficient recurrences

$\emptyset$9

The proof is explicitly inclusion–exclusion on the last $|s|=1+\min s$0 positions, supported by order-preserving relabeling bijections (Beanland et al., 2021).

A related one-parameter generalization counts

$|s|=1+\min s$1

This sequence satisfies

$|s|=1+\min s$2

a linear recurrence of order $|s|=1+\min s$3, so the classical Fibonacci law is the $|s|=1+\min s$4 case (Chu et al., 2019). The same paper refines the condition further by requiring

$|s|=1+\min s$5

with $|s|=1+\min s$6 the second smallest element. The resulting sequence $|s|=1+\min s$7 admits an explicit counting formula and, after elimination of the auxiliary one-parameter term, a recurrence of depth $|s|=1+\min s$8, notably independent of $|s|=1+\min s$9 (Chu et al., 2019).

Other specializations also retain linear-recursive behavior. For

$F\subseteq \mathbb N$0

one has

$F\subseteq \mathbb N$1

For $F\subseteq \mathbb N$2 the inhomogeneous term vanishes, and $F\subseteq \mathbb N$3 is Fibonacci (Chu, 2022).

The union operation introduces another hierarchy. If $F\subseteq \mathbb N$4 is the classical Schreier family and $F\subseteq \mathbb N$5 is the collection of unions of at most $F\subseteq \mathbb N$6 Schreier sets, then

$F\subseteq \mathbb N$7

satisfies a linear recurrence with characteristic polynomial $F\subseteq \mathbb N$8 defined recursively by

$F\subseteq \mathbb N$9

The same characteristic polynomial controls the number of maximal $|F|\le \min F$0-Schreier sets (Beanland et al., 2022). A later survey groups these results under several proof paradigms—formula-based arguments, bijective proofs, mathematical induction, the inclusion–exclusion principle, and the characteristic polynomial method—thereby treating linear-recursive Schreier enumeration as a coherent methodology rather than a list of isolated theorems (Chu, 20 Jun 2026).

4. Partitions, compositions, multisets, and weighted counts

Several papers replace the ambient class of finite sets by more structured subclasses and recover partition-theoretic or higher-step Fibonacci behavior. For $|F|\le \min F$1-strong Schreier sets,

$|F|\le \min F$2

the sparse family

$|F|\le \min F$3

satisfies

$|F|\le \min F$4

where $|F|\le \min F$5 is the set of partitions of $|F|\le \min F$6 with no parts in $|F|\le \min F$7. The strongly sparse analogue satisfies

$|F|\le \min F$8

and if sparsity is removed entirely then

$|F|\le \min F$9

so the non-sparse family is counted by restricted compositions rather than partitions (Beanland et al., 2023).

Allowing multiplicities yields another major extension. For $A=\emptyset$0,

$A=\emptyset$1

where each $A=\emptyset$2 appears with multiplicity $A=\emptyset$3, and

$A=\emptyset$4

the $A=\emptyset$5-step Fibonacci sequence (Chu et al., 2023). The same paper also studies a linear family with condition $A=\emptyset$6, whose counts satisfy

$A=\emptyset$7

and nonlinear families

$A=\emptyset$8

which are linked to decomposition counts $A=\emptyset$9 (Chu et al., 2023).

A later multiset paper gives a broader recurrence framework. For

$\min A\ge |A|$0

one has

$\min A\ge |A|$1

while the colored version

$\min A\ge |A|$2

satisfies

$\min A\ge |A|$3

The same paper also derives Pascal-row recurrences for Schreier sets that avoid multiples of a fixed integer $\min A\ge |A|$4 (Chu et al., 5 Sep 2025).

Weighted size functionals preserve Fibonacci behavior in a different way. If

$\min A\ge |A|$5

then

$\min A\ge |A|$6

satisfies

$\min A\ge |A|$7

and, in the stable range $\min A\ge |A|$8,

$\min A\ge |A|$9

For the two-zero-weight statistic

$\min F\ge |F|$00

the family

$\min F\ge |F|$01

has cardinality $\min F\ge |F|$02 (Chu et al., 2024). These weighted models show that Fibonacci enumeration survives some localized perturbations of the classical size constraint.

5. Barrier, graph-theoretic, and arithmetic reinterpretations

The exact Schreier barrier

$\min F\ge |F|$03

occupies a different position from the weak inequality family. It is treated as a barrier in the sense of Nash-Williams theory and as the family of exactly $\min F\ge |F|$04-large sets. On this domain, the paper on Ramsey-like theorems proves barrier analogues of the free set, thin set, and rainbow Ramsey theorems. In particular, over $\min F\ge |F|$05,

$\min F\ge |F|$06

while the exactly $\min F\ge |F|$07-large rainbow Ramsey theorem does not code the halting set and admits strong cone avoidance (Carlucci et al., 2024). This sharp separation shows that the Schreier barrier is not merely a convenient family of unbounded-size finite sets; it is a domain with distinctive proof-theoretic strength.

Graph-theoretic reformulations are equally striking. For interval Schreier-type sets,

$\min F\ge |F|$08

one has

$\min F\ge |F|$09

where $\min F\ge |F|$10 denotes the number of edges in the Turán graph (Beanland et al., 2021). A later note extends this from intervals to arithmetic progressions of fixed difference $\min F\ge |F|$11: if

$\min F\ge |F|$12

and

$\min F\ge |F|$13

then

$\min F\ge |F|$14

where $\min F\ge |F|$15 is the number of edges of a modification of Turán graphs. The same note proves the first-difference formula

$\min F\ge |F|$16

and therefore

$\min F\ge |F|$17

(Chu, 2022).

Arithmetic reinterpretations use the Schreier condition on divisor sets and on arithmetic progressions of multiples. One abstract defines a Schreier number as a natural number whose nontrivial small divisor set is Schreier, proves that the asymptotic density of Schreier numbers is $\min F\ge |F|$18, proves that there are infinitely many non-prime Schreier pairs with difference $\min F\ge |F|$19 or $\min F\ge |F|$20, and characterizes the natural numbers whose nontrivial small divisors satisfy a linear recurrence of order at most $\min F\ge |F|$21 (Nataraj, 2022). Another paper studies

$\min F\ge |F|$22

shows that $\min F\ge |F|$23 is a periodically sampled subsequence of a Padovan-like sequence $\min F\ge |F|$24 with

$\min F\ge |F|$25

and derives the Pascal-triangle recurrence

$\min F\ge |F|$26

together with the maximal-count identity

$\min F\ge |F|$27

(Chu et al., 17 Jun 2025).

6. Terminological scope beyond Schreier sets

The term “Schreier” is not confined to set families, and this can obscure the literature if the context is not fixed. In geometric group theory and dynamics, a Schreier graph is the orbital or coset graph of a group action. For Thompson’s group $\min F\ge |F|$28, the graphs $\min F\ge |F|$29 of the action on $\min F\ge |F|$30 or on the Cantor set $\min F\ge |F|$31 are explicitly constructed for dyadic rationals, irrationals, and rational Cantor points; these graphs are amenable, have infinitely many ends, and pointed versions determine the underlying point (Savchuk, 2011). None of this uses the inequality $\min F\ge |F|$32; the adjective “Schreier” there refers to Schreier’s coset-graph construction.

Category-theoretic algebra uses the term differently again. A split extension of monoids

$\min F\ge |F|$33

is weakly Schreier if every $\min F\ge |F|$34 can be written

$\min F\ge |F|$35

for some $\min F\ge |F|$36. The associated theory involves admissible equivalence relations on $\min F\ge |F|$37, compatible actions, and $\min F\ge |F|$38-semidirect products of inverse monoids; it does not define or use Schreier sets in the combinatorial sense (Faul, 2020). A useful editorial distinction is therefore that “Schreier sets” designate finite subset families defined by minimum-versus-cardinality constraints, whereas “Schreier graphs” and “weakly Schreier extensions” are separate constructions that share only the historical name.

This multiplicity of meanings is not a defect of the terminology, but it does require local precision. Within combinatorics, Banach space theory, and the recent arXiv literature on counting problems, “Schreier sets” almost always means one of the inequalities in Section 1, together with one of the structural variants described in Sections 3–5.