The statistic ``number of udu's'' in Dyck paths (Q1886363): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2004.07.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034762331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dyck path enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the Fine numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bijection between ordered trees and 2-Motzkin paths and its many consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Motzkin numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3037442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3669422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of the two-dimensional directed animal problem to a one- dimensional path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3752390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new enumerative property of the Narayana numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdivision des nombres de Narayana suivant deux paramètres supplémentaires. (Subdivision of Narayana numbers following two supplementary parameters) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Alternative Characterizations of Riordan Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some statistics on Dyck paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another Proof of Tepper's Identity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4855565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4855954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Riordan arrays and combinatorial sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Six etudes in generating functions / rank
 
Normal rank

Latest revision as of 14:20, 7 June 2024

scientific article
Language Label Description Also known as
English
The statistic ``number of udu's'' in Dyck paths
scientific article

    Statements

    The statistic ``number of udu's'' in Dyck paths (English)
    0 references
    0 references
    18 November 2004
    0 references
    This paper studies the enumeration of Dyck paths by the number of \(udu\)'s (up-down-up). More precisely, the enumeration of Dyck paths with given semilength and given number of \(udu\)'s is obtained. An \(udu\) is said to be at low (high) level, if its peak is at level (greater than) one. Enumeration of Dyck paths with given semilength and given number of low (high) level \(udu\)'s is obtained.
    0 references
    Dyck paths
    0 references
    Motzkin numbers
    0 references
    combinatorial identities
    0 references
    enumeration
    0 references

    Identifiers