Enumeration of several two-by-four classes
Combinatorics
2016-10-07 v1
Abstract
We use catalytic variables to derive generating functions for the permutation classes , , and . Each generating function is algebraic of degree two, and the growth rates of the classes are 4, 5, and , respectively, where . As a consequence of our analysis, we see that a typical large permutation in is likely to also avoid , and is even more likely to avoid . Large permutations which avoid and are likely to also avoid .
Keywords
Cite
@article{arxiv.1610.01908,
title = {Enumeration of several two-by-four classes},
author = {Sam Miner},
journal= {arXiv preprint arXiv:1610.01908},
year = {2016}
}
Comments
22 pages