Counting permutations by their alternating runs

DOI10.1016/J.JCTA.2007.05.006zbMATH Open1144.05005OpenAlexW2040048705MaRDI QIDQ2474491FDOQ2474491

Authors: E. Rodney Canfield, Herbert S. Wilf 

Publication date: 6 March 2008

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2007.05.006

Recommendations

• Enumeration of permutations by number of alternating runs
• Counting permutations by runs
• Counting permutations by alternating descents
• The asymptotics of almost alternating permutations
• Asymptotics of permutations with nearly periodic patterns of rises and falls

zbMATH Keywords

permutationsalternating runsasymptotic seriesexact formulaincreasing and decreasing subsequences

Mathematics Subject Classification ID

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

Cites Work

• The On-Line Encyclopedia of Integer Sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Central and local limit theorems applied to asymptotic enumeration
• Longest alternating subsequences of permutations
• A combinatorial proof of the log-concavity of the numbers of permutations with \(k\) runs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (26)

• On arithmetic and asymptotic properties of up-down numbers
• Number of permutations with prescribed up-down structure as a function of two variables
• Enumerating pairs of permutations with the same up-down form
• Title not available (Why is that?)
• The asymptotics of almost alternating permutations
• A combinatorial proof of the log-concavity of the numbers of permutations with \(k\) runs
• Counting permutations by runs
• Enumeration of permutations by number of alternating runs
• An explicit formula for the number of permutations with a given number of alternating runs
• Counting permutations by alternating descents
• Asymptotics of permutations with nearly periodic patterns of rises and falls
• Periodic de Bruijn triangles: exact and asymptotic results
• Title not available (Why is that?)
• Generating functions of permutations with respect to their alternating runs
• Run distribution over flattened partitions
• Enumerating permutations by their run structure
• Enumeration of type \(D\) permutations with alternating runs
• Subalgebras of Solomon's descent algebra based on alternating runs
• The \(1 / k\)-Eulerian polynomials and \(k\)-Stirling permutations
• Counting signed permutations by their alternating runs
• Enumeration of permutations by number of alternating descents
• Enumeration of a dual set of Stirling permutations by their alternating runs
• David-Barton type identities and alternating run polynomials
• Whole mirror duplication-random loss model and pattern avoiding permutations
• On the alternating runs polynomial in type B and type D Coxeter groups
• Context-free grammars, generating functions and combinatorial arrays

Uses Software

• OEIS

This page was built for publication: Counting permutations by their alternating runs

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