Abstract

AbstractA partition $\lambda $ of n is said to be nearly self-conjugate if the Ferrers graph of $\lambda $ and its transpose have exactly $n-1$ cells in common. The generating function of the number of such partitions was first conjectured by Campbell and recently confirmed by Campbell and Chern (‘Nearly self-conjugate integer partitions’, submitted for publication). We present a simple and direct analytic proof and a combinatorial proof of an equivalent statement.

Full Text
Published version (Free)

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 call