Abstract
Recently, a new class of words, denoted by L_n, was shown to be in bijection with a subset of the Dyck paths of length 2n having cardinality given by the (n-1)-st Catalan number. Here, we consider statistics on L_n recording the number of occurrences of a letter i. In the cases i = 0 and i = 1, we are able to determine explicit expressions for the number of members of L_n containing a given number of zeros or ones, which generalizes the prior result. To do so, we make use of recurrences to derive a functional equation satisfied by the generating function, which we solve by a new method employing Chebyshev polynomials. Recurrences and generating function formulas are also provided in the case of general i.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.