Words restricted by patterns with at most 2 distinct letters
组合数学
2007-05-23 v1
摘要
We find generating functions for the number of words avoiding certain patterns or sets of patterns on at most 2 distinct letters and determine which of them are equally avoided. We also find the exact number of words avoiding certain patterns and provide bijective proofs for the resulting formulas.
引用
@article{arxiv.math/0110056,
title = {Words restricted by patterns with at most 2 distinct letters},
author = {Alexander Burstein and Toufik Mansour},
journal= {arXiv preprint arXiv:math/0110056},
year = {2007}
}
备注
15 pages, LaTeX2e