Counting permutations by their alternating runs

DOI10.1016/J.JCTA.2007.05.006MaRDI QIDQ2474491zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

permutationsalternating runsasymptotic seriesexact formulaincreasing and decreasing subsequences

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3704592 (Why is no real title available?)
• scientific article; zbMATH DE number 3786789 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3639628 (Why is no real title available?)
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• scientific article; zbMATH DE number 2107707 (Why is no real title available?)
• A combinatorial proof of the log-concavity of the numbers of permutations with \(k\) runs
• Central and local limit theorems applied to asymptotic enumeration
• Longest alternating subsequences of permutations
• The On-Line Encyclopedia of Integer Sequences

Cited in

(26)

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

Describes a project that uses

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)