On certain partition bijections related to Euler's partition problem

From MaRDI portal
Publication:2666566



Abstract: We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a previous paper by the author , enable us to state and prove new generalizations of two of these results.






Describes a project that uses

Uses Software






This page was built for publication: On certain partition bijections related to Euler's partition problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2666566)