Permutations, cycles, and the pattern 2-13
组合数学
2007-05-23 v1
摘要
We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.
引用
@article{arxiv.math/0607793,
title = {Permutations, cycles, and the pattern 2-13},
author = {Robert Parviainen},
journal= {arXiv preprint arXiv:math/0607793},
year = {2007}
}
备注
13 pages, 1 figure