Avoiding 2-letter signed patterns

Details Avoiding 2-letter signed patterns Avoiding 2-letter signed patterns

2002-07-23

arxiv.org/abs/math/0207204v1

Mathematics

Combinatorics

10 pages

Scientific paper

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 $T \subseteq B_2$. This allow us to express these cardinalities via inverse of binomial coefficients, binomial coefficients, Catalan numbers, and Fibonacci numbers.

Affiliated with

Also associated with

No associations

Rating

Avoiding 2-letter signed patterns does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Avoiding 2-letter signed patterns, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Avoiding 2-letter signed patterns will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-469323