Pages that link to "Item:Q1167170"

The following pages link to Bijective proofs of some classical partition identities (Q1167170):

Displaying 24 items.

• Garsia and Milne's bijective proof of the inclusion-exclusion principle (Q795832) (← links)
• A short Hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof (Q801062) (← links)
• Partition bijections, a survey (Q851247) (← links)
• The two-way rewriting in action: removing the mystery of Euler-Glaisher's map (Q882113) (← links)
• Geometry and complexity of O'Hara's algorithm (Q1004250) (← links)
• Bijective proofs of basic hypergeometric series identities (Q1099307) (← links)
• Bijections for partition identities (Q1112027) (← links)
• A class of lattices with Möbius function \(\pm 1,0\) (Q1115893) (← links)
• A Rogers-Ramanujan bijection (Q1160129) (← links)
• Ultimate chromatic polynomials (Q1322289) (← links)
• Combinatorial proofs and generalizations of conjectures related to Euler's partition theorem (Q1633603) (← links)
• Rook and Wilf equivalence of integer partitions (Q1750226) (← links)
• Gray code enumeration of families of integer partitions (Q1805052) (← links)
• Sieve-equivalence and explicit bijections (Q1835670) (← links)
• Sieve equivalence in generalized partition theory (Q1835671) (← links)
• Finding direct partition bijections by two-directional rewriting techniques (Q1877658) (← links)
• Complementary Schur asymptotics for partitions (Q2005695) (← links)
• Multiset rewriting over Fibonacci and tribonacci numbers (Q2453583) (← links)
• Bijective matrix algebra (Q2496661) (← links)
• Counting corners in partitions (Q2634576) (← links)
• A bijective proof of the generating function for the number of reverse plane partitions via lattice paths (Q3344209) (← links)
• The combinatorics of Jeff Remmel (Q5056195) (← links)
• (Q5210579) (← links)
• Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example (Q5366902) (← links)