Lagrange Inversion Counts $3\bar{5}241$-Avoiding Permutations
Combinatorics
2011-04-26 v1
Abstract
In a previous paper, we showed that -avoiding permutations are counted by the unique sequence that starts with a 1 and shifts left under the self-composition transform. The proof uses a complicated bijection. Here we give a much simpler proof based on Lagrange inversion.
Keywords
Cite
@article{arxiv.1104.4593,
title = {Lagrange Inversion Counts $3\bar{5}241$-Avoiding Permutations},
author = {David Callan},
journal= {arXiv preprint arXiv:1104.4593},
year = {2011}
}
Comments
5 pages