Combinatorial proofs of some enumeration identities
type: Item
instance of: scholarly article
title: Combinatorial proofs of some enumeration identities
zbMATH Open document ID: 0656.05007
author: A. K. Agarwal
published in: Indian Journal of Pure \& Applied Mathematics
publication date: 1988-01-01T00:00:00Z
review text: The author first gives a proof by generating function, as also a combinatorial proof of the following result: Theorem. The number of compositions of n with exactly m parts equals the number of partitions into m distinct parts with largest part n. The above theorem and some related results are then used in proving the following theorem combinatorially: Theorem. The number of compositions of n is the same as the number of self-conjugate partitions with largest part equal to n. Examples are cited to explain the meaning of the results.
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 05A19
Mathematics Subject Classification ID: 05A17
zbMATH DE Number: 4070904
zbMATH Keywords: lattice paths
zbMATH Keywords: generating function
zbMATH Keywords: self-conjugate partitions
reviewed by: Ravinder Krishna Raina
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 4070904