TreePatterns 1.05

documentation notebook

Eric Rowland
http://math.tulane.edu/~erowland/packages.html

Introduction

TreePatterns is a collection of implementations of various bijections on rooted trees and of functions for computing the weight of the set of binary trees for different weight functions.
This introduction gets you started with a few features of the package; the next section provides a complete list of package symbols along with their usage messages and further examples.

TreePatterns uses functions from my package BinaryTrees, so you will need to have BinaryTrees installed as well.

To use TreePatterns, first you will need to load the package by evaluating the following cell.  (If you need help, see loading a package.)

index_1.gif

Representing trees

Tree patterns and specific bijections

Computing the number of binary trees avoiding a given pattern

Equivalence of tree patterns and general bijections

Package symbols

Bijections

BinaryTree42Bijection and BinaryTree42BijectionInverse

BinaryTree43Bijection and BinaryTree43BijectionInverse

BinaryTree45Bijection and BinaryTree45BijectionInverse

BinaryTreeClassData

BinaryTreePatternQ

BottomUpReplaceAll and TopDownReplaceAll

FindOverlaps

MatchingTrees and NonMatchingTrees

PatternIntersection

ProbableAvoidingBijectionQ

ProbableAvoidingBijections

TreePattern and FromTreePattern

TreeReplacementRules

Weight

WeightEquation and AvoidingWeightEquation

Spikey Created with Wolfram Mathematica 8.0