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

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2018.10.016 / rank
Normal rank
 
Property / author
 
Property / author: Kostas Manes / rank
Normal rank
 
Property / author
 
Property / author: Ioannis Tasoulas / rank
Normal rank
 
Property / author
 
Property / author: Aristidis Sapounakis / rank
Normal rank
 
Property / author
 
Property / author: Panagiotis Tsikouras / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q60692164 / rank
 
Normal rank
Property / author
 
Property / author: Kostas Manes / rank
 
Normal rank
Property / author
 
Property / author: Ioannis Tasoulas / rank
 
Normal rank
Property / author
 
Property / author: Aristidis Sapounakis / rank
 
Normal rank
Property / author
 
Property / author: Panagiotis Tsikouras / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OEIS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2018.10.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2899725959 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2018.10.016 / rank
 
Normal rank

Latest revision as of 23:29, 10 December 2024

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

    Statements

    Identifiers