A lattice path approach to counting partitions with minimum rank \(t\)
type: Item
instance of: scholarly article
title: A lattice path approach to counting partitions with minimum rank \(t\)
zbMATH Open document ID: 1001.05016
DOI: 10.1016/S0012-365X(01)00225-4
author: Alexander Burstein
author: Sylvie Corteel
author: Alexander Postnikov
author: Carla D. Savage
published in: Discrete Mathematics
publication date: 2002-05-28T00:00:00Z
review text: 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)].
Mathematics Subject Classification ID: 05A17
zbMATH DE Number: 1746272
zbMATH Keywords: lattice path
zbMATH Keywords: partitions
MaRDI profile type: Publication
full work available at URL: s0012-365x(01)00225-4
OpenAlex ID: W2123252097
Wikidata QID: Q128133056
description: scientific article; zbMATH DE number 1746272