Abstract
Partitions in which we use d(a) copies of each part a are studied. The results obtained here include various combinatorial identities, a generating function, a recurrence formula, an asymptotic formula and a graphical representation for these new partitions. Some results involving restricted partitions with ″d(a) copies of a″ are also given.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 120-135 |
| Number of pages | 16 |
| Journal | Journal of Combinatorial Theory, Series A |
| Volume | 48 |
| Issue number | 1 |
| DOIs | |
| State | Published - May 1988 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics