Longest alternating subsequences of permutations

DOI10.1307/mmj/1220879431zbMath1247.05016arXivmath/0511419OpenAlexW2087114314MaRDI QIDQ841561

Richard P. Stanley

Publication date: 17 September 2009

Published in: Michigan Mathematical Journal (Search for Journal in Brave)

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

zbMATH Keywords

length of longest alternating subsequencelength of longest increasing subsequence

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Symmetric groups (20B30)

Related Items (30)

Eulerian polynomials and descent statistics ⋮ The peak statistics on simsun permutations ⋮ Counting permutations by runs ⋮ Generating functions of permutations with respect to their alternating runs ⋮ Martingales and descent statistics ⋮ \(q\)-log-convexity from linear transformations and polynomials with only real zeros ⋮ Longest monotone subsequences and rare regions of pattern-avoiding permutations ⋮ Enumeration of permutations by number of alternating runs ⋮ Counting permutations by simsun successions ⋮ A grammatical calculus for peaks and runs of permutations ⋮ Context-free grammars for several polynomials associated with Eulerian polynomials ⋮ An explicit formula for the number of permutations with a given number of alternating runs ⋮ Counting signed permutations by their alternating runs ⋮ Unnamed Item ⋮ Plethystic formulas for permutation enumeration ⋮ Unnamed Item ⋮ Descent-inversion statistics in riffle shuffles ⋮ Longest alternating subsequences of \(k\)-ary words ⋮ Counting permutations by their alternating runs ⋮ Optimal Online Selection of an Alternating Subsequence: A Central Limit Theorem ⋮ On the longest \(k\)-alternating subsequence ⋮ Several variants of the Dumont differential system and permutation statistics ⋮ On the Number of Reflexive and Shared Nearest Neighbor Pairs in One-Dimensional Uniform Data ⋮ David-Barton type identities and alternating run polynomials ⋮ Homomorphisms on noncommutative symmetric functions and permutation enumeration ⋮ Eulerian pairs and Eulerian recurrence systems ⋮ A Central Limit Theorem for Temporally Nonhomogenous Markov Chains with Applications to Dynamic Programming ⋮ Online Selection of Alternating Subsequences from a Random Sample ⋮ Some combinatorial arrays related to the Lotka-Volterra system ⋮ Average length of the longest \(k\)-alternating subsequence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Excluded permutation matrices and the Stanley-Wilf conjecture
• On the limiting distribution for the length of the longest alternating sequence in a random permutation
• Symmetric functions and P-recursiveness
• A variational problem for random Young tableaux
• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• Asymptotics of multivariate sequences. I: Smooth points of the singular variety
• Asymptotic values for degrees associated with strips of Young diagrams
• Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions
• Central and local limit theorems applied to asymptotic enumeration
• On the distribution of the length of the longest increasing subsequence of random permutations

This page was built for publication: Longest alternating subsequences of permutations