arXiv Analytics

Sign in

arXiv:1608.06969 [math.CO]AbstractReferencesReviewsResources

On the growth of merges and staircases of permutation classes

Michael Albert, Jay Pantone, Vincent Vatter

Published 2016-08-24Version 1

There is a well-known upper bound on the growth rate of the merge of two permutation classes. Curiously, there is no known merge for which this bound is not achieved. Using staircases of permutation classes, we provide sufficient conditions for this upper bound to be achieved. In particular, our results apply to all merges of principal permutation classes. We end by demonstrating how our techniques can be used to reprove a result of B\'ona.

Related articles: Most relevant | Search more
arXiv:1405.6802 [math.CO] (Published 2014-05-27)
On the growth rate of 1324-avoiding permutations
arXiv:0710.2995 [math.CO] (Published 2007-10-16)
On the growth rate of minor-closed classes of graphs
arXiv:0807.2815 [math.CO] (Published 2008-07-17, updated 2009-06-22)
Permutation classes of every growth rate above 2.48188