A combinatorial proof of a result for permutation pairs
From MaRDI portal
Publication:424080
DOI10.2478/S11533-012-0001-2zbMATH Open1239.05017OpenAlexW1988346400WikidataQ60692756 ScholiaQ60692756MaRDI QIDQ424080FDOQ424080
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Enumeration of \(m\)-tuples of permutations and a new class of power bases for the space of symmetric functions
- Binomial posets, Möbius inversion, and permutation enumeration
- Enumeration of pairs of permutations
- Statistics on pairs of permutations
Cited In (8)
- A combination theorem for \(PD(n)\)-pairs
- A combinatorial proof for the enumeration of alternating permutations with given peak set
- Reciprocals of exponential polynomials and permutation enumeration
- A combinatorial proof of a result of Gessel and Greene
- Application of a combinatorial identity in the enumeration of combinations that are invariant with respect to substitution
- A simple proof of a theorem of Schmerl and Trotter for permutations
- A direct combinatorial proof of a positivity result
- A combinatorial proof for the relation between the exponential function and the logarithmic function
Uses Software
This page was built for publication: A combinatorial proof of a result for permutation pairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q424080)