Alternating permutations and the mth descents

DOI10.1016/J.DISC.2011.08.005MaRDI QIDQ409391zbMATHOpenAlexFDO

Authors Kağan Kurşungöz, Ae Ja Yee

Publication date 13 April 2012

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

permutationsdescentsinversions\(m\)th descents\(q\)-analogs\(q\)-Euler numbers

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Recommendations

• Variations on descents and inversions in permutations
• Generating functions for alternating descents and alternating major index
• Counting permutations by alternating descents
• Statistics on permutations
• Enumeration of permutations by number of alternating descents

Cites work

• scientific article; zbMATH DE number 3577263 (Why is no real title available?)
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• A conjecture of Stanley on alternating permutations
• A survey of alternating permutations
• Alternating permutations and modified Ghandi-polynomials
• Binomial posets, Möbius inversion, and permutation enumeration
• Combinatorial statistics on alternating permutations
• Combinatorics of generalized \(q\)-Euler numbers
• Descents, inversions, and major indices in permutation groups
• Divisibility Properties of the q-Tangent Numbers
• Enumeration of up-down permutations by number of rises
• Enumeration of up-down permutations by upper records
• Enumeration of up-down sequences
• Further Divisibility Properties of the q-Tangent Numbers
• Generating Functions for a Special Class of Permutations
• Permutation statistics and partitions
• Permutations Related to Secant, Tangent and Eulerian Numbers
• Permutations with prescribed pattern
• Permutations, Sequences and Special Functions
• Using the Entringer numbers to count the alternating permutations according a new parameter
• Zeros of generalized Rogers-Ramanujan series: asymptotic and combinatorial properties

Cited in

(9)

• Counting simsun permutations by descents
• Revstack sort, zigzag patterns, descent polynomials of \(t\)-revstack sortable permutations, and Steingrímsson's sorting conjecture
• On the joint distribution of descents and signs of permutations
• Statistics on permutations
• Enumeration of permutations by the parity of descent positions
• Descents in \(t\)-sorted permutations
• Enumeration of permutations by number of alternating descents
• Counting signed permutations by their alternating runs
• MacMahon's theorem for a set of permutations with given descent indices and right-maximal records

This page was built for publication: Alternating permutations and the \(m\)th descents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409391)