Longest alternating subsequences of \(k\)-ary words

DOI10.1016/j.dam.2007.09.009zbMath1126.05007OpenAlexW2050257212MaRDI QIDQ2462358

Toufik Mansour

Publication date: 30 November 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.09.009

zbMATH Keywords

generating functionalternating sequence\(k\)-ary word

Mathematics Subject Classification ID

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

Related Items

Pattern-avoiding alternating words, Descent-inversion statistics in riffle shuffles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Longest alternating subsequences of permutations
• A variational problem for random Young tableaux
• Longest increasing subsequences of random colored permutations
• Generating functions for generating trees
• Linear recurrences with constant coefficients: The multivariate case
• An analytical method in the theory of two-dimensional positive random walks
• Words restricted by patterns with at most 2 distinct letters
• Longest increasing subsequences in pattern-restricted permutations
• Pebbling a Chessboard