Counting involutory, unimodal, and alternating signed permutations

DOI10.1016/j.disc.2006.04.018zbMath1102.05005OpenAlexW1990609193MaRDI QIDQ2509299

Chak-On Chow

Publication date: 19 October 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.04.018

zbMATH Keywords

involutionsunimodal

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)

Related Items

Algorithms for Twisted Involutions in Weyl Groups, ON -VECTORS AND THE DERIVATIVES OF THE TANGENT AND SECANT FUNCTIONS, The parity of the number of permutation tableaux in a fixed shape, Counting derangements, involutions and unimodal elements in the wreath product \(C_r\wr\mathfrak S_n\), On certain combinatorial expansions of the Eulerian polynomials, Enumeration of type \(D\) permutations with alternating runs, Gray codes for signed involutions

Cites Work

• Permutation statistics of indexed permutations
• The cyclic structure of unimodal permutations
• Unnamed Item
• Unnamed Item
• Unnamed Item