Bijective proofs of some classical partition identities
type: Item
instance of: scholarly article
title: Bijective proofs of some classical partition identities
zbMATH Open document ID: 0491.05012
DOI: 10.1016/0097-3165(82)90040-1
published in: Journal of Combinatorial Theory. Series A
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 05A17
Mathematics Subject Classification ID: 11P81
zbMATH DE Number: 3771613
zbMATH Keywords: involution principle
author: Jeffrey Remmel
MaRDI profile type: Publication
full work available at URL: 0097-3165(82)90040-1
OpenAlex ID: W2064488687
Wikidata QID: Q114215159
cites work: On the Geometry of Numbers in Elementary Number Theory
cites work: Two Theorems of Euler and a General Partition Theorem
cites work: A Combinatorial Proof of Schur's 1926 Partition Theorem
cites work: Some sieves for partition theory
cites work: PIE-sums: A combinatorial tool for partition theory
cites work: A Rogers-Ramanujan bijection
cites work: String overlaps, pattern matching, and nontransitive games
cites work: Bijective proofs of formulae for the number of standard Yound tableaux
cites work: A bijective proof of the Hook formula for the number of column strict tableaux with bounded entries
cites work: A bijective proof of the generating function for the number of reverse plane partitions via lattice paths
cites work: Q5181335
cites work: Partition Theorems for Euler Pairs
description: scientific article; zbMATH DE number 3771613