Title of article :
Skew Dyck paths, area, and superdiagonal bargraphs
Author/Authors :
Deutsch، نويسنده , , Emeric and Munarini، نويسنده , , Emanuele and Rinaldi، نويسنده , , Simone، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2010
Pages :
13
From page :
1550
To page :
1562
Abstract :
Skew Dyck paths are a generalization of ordinary Dyck paths, defined as paths using up steps U = ( 1 , 1 ) , down steps D = ( 1 , - 1 ) , and left steps L = ( − 1 , - 1 ) , starting and ending on the x-axis, never going below it, and so that up and left steps never overlap. In this paper we study the class of these paths according to their area, extending several results holding for Dyck paths. Then we study the class of superdiagonal bargraphs, which can be naturally defined starting from skew Dyck paths.
Keywords :
Bargraphs , enumerative combinatorics , Dyck paths enumeration
Journal title :
Journal of Statistical Planning and Inference
Serial Year :
2010
Journal title :
Journal of Statistical Planning and Inference
Record number :
2220634
Link To Document :
بازگشت