Sieve equivalence in generalized partition theory

DOI10.1016/0097-3165(83)90042-0MaRDI QIDQ1835671zbMATH OpenOpenAlexFDO

Authors Herbert S. Wilf

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)90042-0

zbMATH Keywords

involutionsbijectionsmultisetsrooted forestsprefabssieve-equivalenceunique factorization of rooted trees

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Trees (05C05) Combinatorial aspects of partitions of integers (05A17)

Cites work

• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3344587 (Why is no real title available?)
• scientific article; zbMATH DE number 3199765 (Why is no real title available?)
• A Rogers-Ramanujan bijection
• A method and two algorithms on the theory of partitions
• Bijective proofs of some classical partition identities
• PIE-sums: A combinatorial tool for partition theory
• Some sieves for partition theory
• Théorie géométrique des polynômes eulériens

Cited in

(6)

• Multiset rewriting over Fibonacci and tribonacci numbers
• Bijections for partition identities
• The two-way rewriting in action: removing the mystery of Euler-Glaisher's map
• Sieve-equivalence and explicit bijections
• Finding direct partition bijections by two-directional rewriting techniques
• Garsia and Milne's bijective proof of the inclusion-exclusion principle

This page was built for publication: Sieve equivalence in generalized partition theory

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