The Mobius Function of the Permutation Pattern Poset

Details The Mobius Function of the Permutation Pattern Poset The Mobius Function of the Permutation Pattern Poset

2009-02-23

arxiv.org/abs/0902.4011v3

Mathematics

Combinatorics

final version; to appear in Journal of Combinatorics

Scientific paper

A permutation \tau contains another permutation \sigma as a pattern if \tau has a subsequence whose elements are in the same order with respect to size as the elements in \sigma. This defines a partial order on the set of all permutations, and gives a graded poset P. We give a large class of pairs of permutations whose intervals in P have Mobius function 0. Also, we give a solution to the problem when \sigma occurs precisely once in \tau, and \sigma and \tau satisfy certain further conditions, in which case the Mobius function is shown to be either -1, 0 or 1. We conjecture that for intervals [\sigma,\tau] consisting of permutations avoiding the pattern 132, the magnitude of the Mobius function is bounded by the number of occurrences of \sigma in \tau. We also conjecture that the Mobius function of the interval [1,\tau] is -1, 0 or 1.

Affiliated with

Also associated with

No associations

Rating

The Mobius Function of the Permutation Pattern Poset 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 The Mobius Function of the Permutation Pattern Poset, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Mobius Function of the Permutation Pattern Poset will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-171504