No Detail Found!

Letters of a given size in Catalan words

Author(s)
Aubrey Blecher School of Mathematics, University of Witwatersrand,Johannesburg,South Africa
Arnold Knopfmacher School of Mathematics, University of Witwatersrand,Johannesburg,South Africa
Abstract
A Catalan word with n letters, w = w1w2 : : :wn over the set of positive integers is a word in which w1 = 1 and for each i 2 f2; 3 : : : ; ng, the inequality wi  wi??1 + 1 holds. We find generating functions A(x; qi) for the number of letters equal to i in Catalan words with n letters. We also develop the generating function A(x; qijj) that tracks the number of letters i in Catalan words ending in a letter j. The relationship between A(x; qi) and A(x; qijj) is fundamental to the kernel method used to obtain these generating functions.
Publication Details
Page(s) 117-121
Published Journal: Discrete Mathematics Letters, Volume: 13, Issue: 0, Year: 2024

Request the full text from PASTIC

Keywords
kernel method, generating functions, Catalan words, letters
References
Baril J.-L.,Khalil C.,Vajnovszki V.,Baril J.-L.,Kirgizov S.,Vajnovszki V.,Blecher A.,Brennan C.,Knopfmacher A.,Blecher A.,Brennan C.,Knopfmacher A.,Blecher A.,Brennan C.,Knopfmacher A.,Blecher A.,Brennan C.,Knopfmacher A.,Callan D.,Mansour T.,Ram J. L.,Mansour T.,Mansour T.,Ram J. L.,Mansour T.,Shabani A. .2019 .´ırez, D. A. Toquica, Counting lattice points on bargraphs of Catalan words. Discrete Math. Lett. 2, 15(2) : 65-94.
Prodinger H.,Prodinger H.,Stanley R. .2015 .Partial skew Dyck paths - a kernel method approach. Lothar. Combin, 38 : 135.
. .The OEIS Foundation, The On-line Encyclopedia of Integer Sequences. , : .
0

Citations

0

Downloads

41

Views