Abstract
Abstract
A 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.
Publisher
Cambridge University Press (CUP)
Reference5 articles.
1. Almost partition identities;Andrews;Proc. Natl. Acad. Sci. USA,2019
2. Integer Partitions
3. [4] Campbell, J. M. , ‘Sequence A246581’, On-Line Encyclopedia of Integer Sequences, Sloane, N. J. A. (ed.), http://oeis.org.
4. A Constructive Theory of Partitions, Arranged in Three Acts, an Interact and an Exodion