Sieve equivalence in generalized partition theory

DOI10.1016/0097-3165(83)90042-0zbMath0504.05002OpenAlexW1964656733MaRDI QIDQ1835671

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

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

Related Items (6)

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 ⋮ Sieve-equivalence and explicit bijections ⋮ Garsia and Milne's bijective proof of the inclusion-exclusion principle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some sieves for partition theory
• PIE-sums: A combinatorial tool for partition theory
• A Rogers-Ramanujan bijection
• Bijective proofs of some classical partition identities
• A method and two algorithms on the theory of partitions
• Théorie géométrique des polynômes eulériens

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