A lattice path approach to counting partitions with minimum rank \(t\) (Q1598837)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A lattice path approach to counting partitions with minimum rank \(t\) |
scientific article; zbMATH DE number 1746272
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lattice path approach to counting partitions with minimum rank \(t\) |
scientific article; zbMATH DE number 1746272 |
Statements
A lattice path approach to counting partitions with minimum rank \(t\) (English)
0 references
28 May 2002
0 references
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)].
0 references
lattice path
0 references
partitions
0 references
