Pattern-Avoiding Involutions: Exact and Asymptotic Enumeration
Combinatorics
2014-09-15 v3
Abstract
We consider the enumeration of pattern-avoiding involutions, focusing in particular on sets defined by avoiding a single pattern of length 4. As we demonstrate, the numerical data for these problems demonstrates some surprising behavior. This strange behavior even provides some very unexpected data related to the number of 1324-avoiding permutations.
Cite
@article{arxiv.1310.7003,
title = {Pattern-Avoiding Involutions: Exact and Asymptotic Enumeration},
author = {Miklós Bóna and Cheyne Homberger and Jay Pantone and Vincent Vatter},
journal= {arXiv preprint arXiv:1310.7003},
year = {2014}
}