A combinatorial proof of a result for permutation pairs

DOI10.2478/S11533-012-0001-2zbMath1239.05017OpenAlexW1988346400WikidataQ60692756 ScholiaQ60692756MaRDI QIDQ424080

Toufik Mansour, Mark Shattuck

Publication date: 31 May 2012

Published in: Central European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/s11533-012-0001-2

zbMATH Keywords

permutationsexponential generating functioncombinatorial proof

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumeration of pairs of permutations
• Binomial posets, Möbius inversion, and permutation enumeration
• Statistics on pairs of permutations
• Enumeration of \(m\)-tuples of permutations and a new class of power bases for the space of symmetric functions

This page was built for publication: A combinatorial proof of a result for permutation pairs