Anick-type resolutions and consecutive pattern avoidance
Combinatorics
2010-02-16 v1 K-Theory and Homology
Abstract
For permutations avoiding consecutive patterns from a given set, we present a combinatorial formula for the multiplicative inverse of the corresponding exponential generating function. The formula comes from homological algebra considerations in the same sense as the corresponding inversion formula for avoiding word patterns comes from the well known Anick's resolution.
Cite
@article{arxiv.1002.2761,
title = {Anick-type resolutions and consecutive pattern avoidance},
author = {Vladimir Dotsenko and Anton Khoroshkin},
journal= {arXiv preprint arXiv:1002.2761},
year = {2010}
}
Comments
16 pages. Preliminary version, comments are welcome