On the number of hyper m-ary partitions
From MaRDI portal
Publication:5384258
zbMATH Open1416.05029MaRDI QIDQ5384258FDOQ5384258
Authors: Tom Edgar
Publication date: 21 June 2019
Full work available at URL: http://math.colgate.edu/~integers/s47/s47.pdf
Recommendations
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)
Cites Work
- Stern's diatomic sequence \(0, 1, 1, 2, 1, 3, 2, 3, 1, 4, \dots \)
- Recounting the Rationals
- Title not available (Why is that?)
- Dominance orders, generalized binomial coefficients, and Kummer's theorem
- Identifying an \(m\)-ary partition identity through an \(m\)-ary tree
- Three different ways to obtain the values of hyper \(m\)-ary partition functions
- Dominance over \(\mathbb{N}\)
- Extending a recent result on hyper \(m\)-ary partition sequences
Cited In (10)
- On the number of hypercubic bipartitions of an integer
- On the enumeration and congruences for \(m\)-ary partitions
- Title not available (Why is that?)
- On the \(m\)-ary partition numbers
- Title not available (Why is that?)
- Algorithmic approach to counting of certain types \(m\)-ary partitions.
- Three different ways to obtain the values of hyper \(m\)-ary partition functions
- Counting complements in the partition lattice, and hypertrees
- Title not available (Why is that?)
- Extending a recent result on hyper \(m\)-ary partition sequences
This page was built for publication: On the number of hyper \(m\)-ary partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384258)