# Maximal 0-1-fillings of moon polyominoes with restricted chain lengths and rc-graphs

Abstract : 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.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [14 references]

https://hal.inria.fr/hal-01215066
Contributor : Coordination Episciences Iam <>
Submitted on : Tuesday, October 13, 2015 - 3:06:05 PM
Last modification on : Sunday, November 25, 2018 - 2:02:17 PM
Long-term archiving on: : Thursday, April 27, 2017 - 12:20:35 AM

### File

dmAO0173.pdf
Publisher files allowed on an open archive

### Identifiers

• HAL Id : hal-01215066, version 1

### Citation

Martin Rubey. Maximal 0-1-fillings of moon polyominoes with restricted chain lengths and rc-graphs. 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), 2011, Reykjavik, Iceland. pp.835-848. ⟨hal-01215066⟩

Record views