A combinatorial proof of the sum of \(q\)-cubes
A \(q\)-analogue of the classical formula for the sum of cubes and its bijective proof using integer partitions has been given. This \(q\)-analogue maintains some combinatorial properties of the classical formula. The authors express their hope for the existence of other \(q\)-analogues of the sum of the cubes formula. The reviewer feels that this \(q\)-analogue of the cubes formula is not an isolated result. So it may be of interest to look for an analytical proof of this formula.
scientific article; zbMATH DE number 2038355