Bijections between pattern-avoiding fillings of Young diagrams

Details Bijections between pattern-avoiding fillings of Young diagrams Bijections between pattern-avoiding fillings of Young diagrams

2008-01-31

arxiv.org/abs/0801.4928v4

Journal of Combinatorial Theory Series A 117 (2010), 1218--1230

Mathematics

Combinatorics

15 pages Version 2: important simplification and generalization of the original bijection Version 3: small correction in refer

Scientific paper

The pattern-avoiding fillings of Young diagrams we study arose from Postnikov's work on positive Grassman cells. They are called Le-diagrams, and are in bijection with decorated permutations. Other closely-related diagrams are interpreted as acyclic orientations of some bipartite graphs. The definition of the diagrams is the same but the avoided patterns are different. We give here bijections proving that the number of pattern-avoiding filling of a Young diagram is the same, for these two different sets of patterns. The result was obtained by Postnikov via a reccurence relation. This relation was extended by Spiridonov to obtain more general results about other patterns and other polyominoes than Young diagrams, and we show that our bijections also extend to more general polyominoes.

Affiliated with

Also associated with

No associations

Rating

Bijections between pattern-avoiding fillings of Young diagrams 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 Bijections between pattern-avoiding fillings of Young diagrams, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bijections between pattern-avoiding fillings of Young diagrams will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-204797