Pattern avoidance in binary trees (Q986111): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Dyck path enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Motzkin numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Goulden—Jackson cluster method: extensions, applications and implementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: \textsc{IntegerSequences}: a package for computing with \(k\)-regular sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting strings in Dyck paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The On-Line Encyclopedia of Integer Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Patterns and pattern-matching in trees: An analysis / rank
 
Normal rank

Latest revision as of 02:28, 3 July 2024

scientific article
Language Label Description Also known as
English
Pattern avoidance in binary trees
scientific article

    Statements

    Pattern avoidance in binary trees (English)
    0 references
    0 references
    11 August 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    pattern avoidance
    0 references
    binary trees
    0 references
    Wilf equivalence
    0 references
    algebraic generating functions
    0 references
    Dyck words
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references