Mathematics – Combinatorics
Scientific paper
2010-09-20
Mathematics
Combinatorics
22 pages, v2: references added, v3: included proof for bijection for stack polyominoes, v4: include conjecture and improve pre
Scientific paper
We show that maximal 0-1-fillings of moon polynomials with restricted chain lengths can be identified with certain rc-graphs, also known as pipe dreams. In particular, this exhibits a connection between maximal 0-1-fillings of Ferrers shapes and Schubert polynomials. Moreover, it entails a bijective proof showing that the number of maximal fillings of a stack polyomino S with no north-east chains longer than k depends only on k and the multiset of column heights of S. Our main contribution is a slightly stronger theorem, which in turn leads us to conjecture that the poset of rc-graphs with covering relation given by generalised chute moves is in fact a lattice.
No associations
LandOfFree
Maximal 0-1 fillings of moon polyominoes with restricted chain-lengths and rc-graphs 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 Maximal 0-1 fillings of moon polyominoes with restricted chain-lengths and rc-graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximal 0-1 fillings of moon polyominoes with restricted chain-lengths and rc-graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-265760