Abstract
Complete partitions are a generalization of MacMahon’s perfect partitions; we further generalize these by defining k-step partitions. A matrix equation shows an unexpected connection between k-step partitions and distinct part partitions. We provide two proofs of the corresponding theorem, one using generating functions and one combinatorial. The algebraic proof relies on a generalization of a conjecture made by Paul Hanna in 2012.
Original language | English (US) |
---|---|
Pages (from-to) | 217-224 |
Number of pages | 8 |
Journal | Annals of Combinatorics |
Volume | 24 |
Issue number | 2 |
DOIs | |
State | Published - Jun 1 2020 |
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics