Noncontiguous Pattern Containment in Binary Trees | Zendy

Lara Pudwell | Zendy; Connor Scholten | Zendy; Tyler Schrock | Zendy; Alexa Serrato | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Noncontiguous Pattern Containment in Binary Trees

Author(s) -

Lara Pudwell,

Connor Scholten,

Tyler Schrock,

Alexa Serrato

Publication year - 2014

Publication title -

isrn combinatorics

Language(s) - English

Resource type - Journals

ISSN - 2090-8911

DOI - 10.1155/2014/316535

Subject(s) - binary number , binary tree , tree (set theory) , path (computing) , enumeration , computer science , algorithm , mathematics , combinatorics , arithmetic , programming language

We consider the enumeration of binary trees containing noncontiguous binary tree patterns. First, we show that any two -leaf binary trees are contained in the set of all -leaf trees the same number of times. We give a functional equation for the multivariate generating function for number of -leaf trees containing a specified number of copies of any path tree, and we analyze tree patterns with at most 4 leaves. The paper concludes with implications for pattern containment in permutations.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research