Contents

Online Journal of Analytic Combinatorics

  • Research article

Longest alternating subsequences in Pattern-Restricted k-ary Words

Toufik Mansour 1
1Department of Mathematics, University of Haifa, Haifa 31905, Israel
  • Published: 29/01/2008

Abstract

We study the generating functions for pattern-restricted \(k\)-ary words of length \(n\) corresponding to the longest alternating subsequence statistic in which the pattern is any one of the six permutations of length three.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Toufik Mansour . Longest alternating subsequences in Pattern-Restricted k-ary Words[J], Online Journal of Analytic Combinatorics, Issue 3, 2008. -. https://doi.org/10.61091/ojac-305.