Alternating permutations and the mth descents
From MaRDI portal
Publication:409391
DOI10.1016/J.DISC.2011.08.005zbMATH Open1238.05003OpenAlexW2122358978MaRDI QIDQ409391FDOQ409391
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Enumeration of up-down sequences
- A survey of alternating permutations
- Permutations with prescribed pattern
- Descents, inversions, and major indices in permutation groups
- Binomial posets, Möbius inversion, and permutation enumeration
- A conjecture of Stanley on alternating permutations
- Alternating permutations and modified Ghandi-polynomials
- Permutation statistics and partitions
- Enumeration of up-down permutations by upper records
- Combinatorial statistics on alternating permutations
- Enumeration of up-down permutations by number of rises
- Using the Entringer numbers to count the alternating permutations according a new parameter
- Permutations Related to Secant, Tangent and Eulerian Numbers
- Further Divisibility Properties of the q-Tangent Numbers
- Generating Functions for a Special Class of Permutations
- Permutations, Sequences and Special Functions
- Divisibility Properties of the q-Tangent Numbers
- Combinatorics of generalized \(q\)-Euler numbers
- Zeros of generalized Rogers-Ramanujan series: asymptotic and combinatorial properties
Cited In (9)
- Counting simsun permutations by descents
- On the joint distribution of descents and signs of permutations
- Revstack sort, zigzag patterns, descent polynomials of \(t\)-revstack sortable permutations, and Steingrímsson's sorting conjecture
- Descents in \(t\)-sorted permutations
- Counting signed permutations by their alternating runs
- Enumeration of permutations by number of alternating descents
- Enumeration of permutations by the parity of descent positions
- MacMahon's theorem for a set of permutations with given descent indices and right-maximal records
- Statistics on permutations
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)