Abstract
We give short elementary expositions of combinatorial proofs of some variants of Euler's partition identity that were first addressed analytically by George Andrews, and later combinatorially by others. The method using certain matrices to concisely explain these bijections, based on ideas first used in a previous manuscript by the author, enables us to also give new generalizations of two of these results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
