<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.upr.si/IzpisGradiva.php?id=22070"><dc:title>Enumerating runs, valleys, and peaks in Catalan words</dc:title><dc:creator>Baril,	Jean-Luc	(Avtor)
	</dc:creator><dc:creator>Harris,	Pamela	(Avtor)
	</dc:creator><dc:creator>Harry,	Kimberly	(Avtor)
	</dc:creator><dc:creator>McClinton,	Matt	(Avtor)
	</dc:creator><dc:creator>Ramírez,	José L.	(Avtor)
	</dc:creator><dc:subject>Catalan word</dc:subject><dc:subject>generating function</dc:subject><dc:subject>combinatorial statistic</dc:subject><dc:subject>Dyck path</dc:subject><dc:description>We provide generating functions, formulas, and asymptotic expressions for the number of Catalan words based on the number of runs of ascents (descents), runs of weak ascents (descents), l-valleys, valleys, symmetric valleys, l-peaks, peaks, and symmetric peaks. We also establish some bijections with restricted Dyck paths and ordered trees that transports some statistics.</dc:description><dc:publisher>Založba Univerze na Primorskem</dc:publisher><dc:date>2025</dc:date><dc:date>2025-11-03 11:49:20</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>22070</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
