Counting pairs of noncrossing binary paths: a bijective approach (Q1625790): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Pairs of noncrossing free Dyck paths and noncrossing partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic languages and polyominoes enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dyck path enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: An involution on Dyck paths and its consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the Fine numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bijections for pairs of non-crossing lattice paths and walks in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5650405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vicious walkers and Young tableaux I: without walls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vicious walkers, friendly walkers and Young tableaux: II. With a wall / rank
 
Normal rank
Property / cites work
 
Property / cites work: General results on the enumeration of strings in Dyck paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting strings in Dyck paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Catalan triangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4443440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The statistic ``number of udu's'' in Dyck paths / rank
 
Normal rank

Revision as of 12:29, 17 July 2024

scientific article
Language Label Description Also known as
English
Counting pairs of noncrossing binary paths: a bijective approach
scientific article

    Statements

    Identifiers