Avoiding 2-letter signed patterns
组合数学
2007-05-23 v1
摘要
Let B_n be the hyperoctahedral group; that is, the set of all signed permutations on n letters, and let B_n(T) be the set of all signed permutations in B_n which avoids a set T of signed patterns. In this paper, we find all the cardinalities of the sets B_n(T) where . This allow us to express these cardinalities via inverse of binomial coefficients, binomial coefficients, Catalan numbers, and Fibonacci numbers.
引用
@article{arxiv.math/0207204,
title = {Avoiding 2-letter signed patterns},
author = {T. Mansour and J. West},
journal= {arXiv preprint arXiv:math/0207204},
year = {2007}
}
备注
10 pages