Avoiding 2-letter signed patterns

Simple item page
dc.creatorMansour, T.
dc.creatorWest, J.
dc.date2002-07-23
dc.date.accessioned2026-07-07T04:49:48Z
dc.date.available2026-07-07T04:49:48Z
dc.descriptionLet 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 $T \subseteq B_2$. This allow us to express these cardinalities via inverse of binomial coefficients, binomial coefficients, Catalan numbers, and Fibonacci numbers.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/math/0207204
dc.identifierhttp://arxiv.org/abs/math/0207204
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/64563
dc.subjectCombinatorics
dc.titleAvoiding 2-letter signed patterns
dc.typetext

Files

Collections

arXiv