Counting unions of Schreier sets

DOI10.1017/S0004972723001326MaRDI QIDQ6666487zbMATH OpenFDO

Authors Kevin Beanland, Dmitriy Gorovoy, Daniil Homza

Publication date 20 January 2025

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

Fibonacci numberslinear recurrenceSchreier set

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Recurrences (11B37)

Cites work

• scientific article; zbMATH DE number 169556 (Why is no real title available?)
• scientific article; zbMATH DE number 2109253 (Why is no real title available?)
• scientific article; zbMATH DE number 7646868 (Why is no real title available?)
• Ein Gegenbeispiel zur Theorie der schwachen Konvergenz.
• Higher order Fibonacci sequences from generalized Schreier sets
• Ramsey methods in analysis
• The Fibonacci sequence and Schreier-Zeckendorf sets
• Various sequences from counting subsets

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 Q6666487)