Accurate estimation of the number of binary partitions
From MaRDI portal
Publication:4159434
DOI10.1007/BF01933448zbMATH Open0379.10011MaRDI QIDQ4159434FDOQ4159434
Authors: Carl-Erik Fröberg
Publication date: 1977
Published in: BIT (Search for Journal in Brave)
Cites Work
Cited In (5)
- Combinatorics of periods in strings.
- Newman cyclotomic polynomials, refinable splines and the Euler binary partition function
- Algorithmic approach to counting of certain types \(m\)-ary partitions.
- A note on the number of partitions other than binary
- The Euler binary partition function and subdivision schemes
This page was built for publication: Accurate estimation of the number of binary partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4159434)