Avoiding 2-letter Signed Patterns
Séminaire lotharingien de combinatoire, Tome 49 (2002-2004)
Citer cet article
Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website
Let Bn be the hyperoctahedral group, the set of all signed permutations on n letters, and let Bn(T) be the set of all signed permutations in Bn which avoid a set T of signed patterns. In this paper, we find all the cardinalities of the sets Bn(T) where T \subseteq B2. Some of the cardinalities encountered involve inverse binomial coefficients, binomial coefficients, Catalan numbers, and Fibonacci numbers.