Generating functions of permutations with respect to their alternating runs

zbMATH Open1491.05013arXiv2005.12847MaRDI QIDQ2145990FDOQ2145990

Authors: Miklós Bóna 

Publication date: 15 June 2022

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Abstract: We present a short, direct proof of the fact that the generating function of all permutations of a fixed length $ngeq4$ is divisible by $(1+z{)}^m$, where $m=lfloor(n-2)/2floor$.

Full work available at URL: https://arxiv.org/abs/2005.12847

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Enumeration of permutations by number of alternating runs
• Counting permutations by their alternating runs
• Generating functions for permutations avoiding a consecutive pattern
• Generating functions for the number of permutations with limited displacement
• Enumeration of type \(D\) permutations with alternating runs
• Generating functions for permutations which contain a given descent set
• On the generating function for consecutively weighted permutations
• Generating functions for permutation representations.
• An explicit formula for the number of permutations with a given number of alternating runs
• Generating functions for descents over permutations which avoid sets of consecutive patterns

zbMATH Keywords

alternating rungroup action in counting permutations

Mathematics Subject Classification ID

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

Cites Work

• Combinatorics of permutations
• A survey of alternating permutations
• Longest alternating subsequences of permutations
• A combinatorial proof of the log-concavity of the numbers of permutations with \(k\) runs

Cited In (7)

• Simple permutations and algebraic generating functions
• Title not available (Why is that?)
• Generating Functions Associated with Random Binary Sequences Consisting of Runs of Lengths 1 and 2
• Title not available (Why is that?)
• Reciprocals of exponential polynomials and permutation enumeration
• A grammatical calculus for peaks and runs of permutations
• Title not available (Why is that?)

This page was built for publication: Generating functions of permutations with respect to their alternating runs

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