Sieve-equivalence and explicit bijections

DOI10.1016/0097-3165(83)90043-2MaRDI QIDQ1835670zbMATH OpenOpenAlexFDO

Authors 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

bijectionssieve-equivalencesubsets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cites work

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

Cited in

(5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1835670)