Corpus ID: 12443018

Pattern Avoidance in Ternary Trees

@inproceedings{Gabriel2011PatternAI,
  title={Pattern Avoidance in Ternary Trees},
  author={Nathan Gabriel and Katherine Peske and Lara K. Pudwell and Samuel Tay},
  year={2011}
}
This paper considers the enumeration of ternary trees (i.e. rooted trees in which each vertex has 0 or 3 children) avoiding a contiguous ternary tree pattern. We begin by nding the recurrence relations for several simple ternary trees; then, for more complex trees, we extend a known algorithm for nding the generating function that counts n-leaf binary trees avoiding a given pattern. After investigating bijections between these trees’ avoidance sequences and other common combinatorial objects… Expand

Figures from this paper

Non-Contiguous Pattern Avoidance in Binary Trees
TLDR
This paper gives an explicit generating function that counts binary trees avoiding a single non-contiguous tree pattern according to number of leaves and shows that there is exactly one Wilf class of k-leaf tree patterns for any positive integer k. Expand
Noncontiguous Pattern Containment in Binary Trees
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 numberExpand
Pattern avoidance in labelled trees
We discuss a new notion of pattern avoidance motivated by the operad theory: pattern avoidance in planar labelled trees. It is a generalisation of various types of consecutive pattern avoidanceExpand
Tree series and pattern avoidance in syntax trees
TLDR
A way, given a set of generators and a setof patterns, to enumerate the trees avoiding this last, is described, built around inclusion-exclusion formulas forming a system of equations on formal power series of trees, and composition operations of trees. Expand
Pattern avoidance in forests of binary shrubs
TLDR
This work enumerates forests avoiding patterns of length three by using the machinery of analytic combinatorics to determine the minimal polynomial of its generating function, and deduce its growth rate. Expand
Rooted forests that avoid sets of permutations
We say that an unordered rooted labeled forest avoids the pattern $\pi\in\mathcal{S}_n$ if the sequence obtained from the labels along the path from the root to any vertex does not contain aExpand
Pattern Avoidance in Task-Precedence Posets
TLDR
An interesting application of this work can be found when task-precedence posets represent warehouse package fulfillment by robots, in which case avoidance of both 231 and 321 ensures the authors never stack two heavier packages on top of a lighter package. Expand
Supertrees
TLDR
This paper obtains both upper and lower bounds on the minimum possible size of a k-supertree in three cases; in the fourth, the minimum size exactly is determined. Expand
Enumerative properties of restricted words and compositions
In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequenceExpand
Pattern Avoidance in kary Heaps
In this paper, we consider pattern avoidance in k-ary heaps, where the permutation associated with the heap is found by recording the nodes as they are encountered in a breadth-first search. WeExpand
...
1
2
...

References

SHOWING 1-10 OF 17 REFERENCES
Pattern avoidance in binary trees
  • E. Rowland
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 2010
TLDR
An algorithm for computing the generating function that counts n-leaf binary trees avoiding a given binary tree pattern t and develops a general method of restructuring trees that conjecturally succeeds to produce an explicit bijection for each pair of equivalent tree patterns. Expand
Pattern avoidance in labelled trees
We discuss a new notion of pattern avoidance motivated by the operad theory: pattern avoidance in planar labelled trees. It is a generalisation of various types of consecutive pattern avoidanceExpand
Patterns and Pattern-Matching in Trees: An Analysis
TLDR
It appears that for a wide class of statistics on trees, pattern-matching has a linear expected time complexity (in contrast to a quadratic worst-case behaviour). Expand
Analytic Variations on the Common Subexpression Problem
TLDR
It is established here that, under a variety of probabilistic models, a tree of size n has a compacted form of expected size asymptotically, where the constant C is explicitly related to the type of trees to be compacted and to the statistical model reflecting tree usage. Expand
The encyclopedia of integer sequences
TLDR
This book presents methods for Computer Investigation of Sequences, a method for hand analysis of sequences, and some of the methods used in this work, as well as suggestions for further study. Expand
AN INVERSION THEOREM FOR CLUSTER DECOMPOSITIONS OF SEQUENCES WITH DISTINGUISHED SUBSEQUENCES
Certain enumeration problems may be expressed in terms of sequences possessing a specified number of subsequences which are elements of a prescribed set of distinguished sequences. We obtain anExpand
What Is Enumerative Combinatorics
The basic problem of enumerative combinatorics is that of counting the number of elements of a finite set. Usually are given an infinite class of finite sets S i where i ranges over some index set IExpand
The On-Line Encyclopedia of Integer Sequences
  • N. Sloane
  • Mathematics, Computer Science
  • Electron. J. Comb.
  • 1994
TLDR
The On-Line Encyclopedia of Integer Sequences (or OEIS) is a database of some 130000 number sequences which serves as a dictionary, to tell the user what is known about a particular sequence and is widely used. Expand
Analytic Combinatorics
TLDR
This text can be used as the basis for an advanced undergraduate or a graduate course on the subject, or for self-study, and is certain to become the definitive reference on the topic. Expand
The Goulden—Jackson cluster method: extensions, applications and implementations
Th powerful (and so far under-utilized) Goulden—Jackson Cluster method for finding the generating function for the number of words avoiding, as factors, the members of a prescribed set of ‘dirtyExpand
...
1
2
...