Computational & Applied Mathematics & Statistics Events

Location

Generating bijections for permutation identities and generalized Wilf equivalences

We will explore how bijections demonstrating some combinatorial identities can be constructed recursively. Our first application concerns subsets of the group of permutations of n elements. We derive a bijective proof of the one-term recurrence for derangements, along with a bijective proof of the one-term identity for nonderangements. We then consider bijections showing equivalence relations on consecutive patterns in inversion sequences, deriving some new bijective proofs, and also showing a stronger relation among some consecutive patterns.

Sponsored by: Mathematics

Contact

Gexin Yu

This Event Appears On

• W&M Featured Events
• Arts & Sciences Events
• Mathematics Events
• Computational & Applied Mathematics & Statistics Events