Sieve-equivalence and explicit bijections

DOI10.1016/0097-3165(83)90043-2zbMath0504.05001OpenAlexW1986815418MaRDI QIDQ1835670

Basil Gordon

Publication date: 1983

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(83)90043-2

zbMATH Keywords

subsetsbijectionssieve-equivalence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (5)

Finding direct partition bijections by two-directional rewriting techniques ⋮ Bijections for partition identities ⋮ The two-way rewriting in action: removing the mystery of Euler-Glaisher's map ⋮ Multiset rewriting over Fibonacci and tribonacci numbers ⋮ Geometry and complexity of O'Hara's algorithm

Cites Work

• A Rogers-Ramanujan bijection
• Bijective proofs of some classical partition identities
• Sieve equivalence in generalized partition theory

This page was built for publication: Sieve-equivalence and explicit bijections