A lattice path approach to counting partitions with minimum rank \(t\)
A combinatorial proof, using a lattice path counting argument, is given of the Andrews-Bressoud result that for \(t\leq 1\) the number of partitions of \(n\) with all successive ranks at least \(t\) is equal to the number of partitions of \(n\) with no part of size \(2-t\). Recently, a bijective proof was given by \textit{S. Corteel}, \textit{C. D. Savage} and \textit{R. Venkatraman} [J. Comb. Theory, Ser. A 83, 202-220 (1998; Zbl 0914.05003)].
scientific article; zbMATH DE number 1746272