Pattern avoidance in alternating sign rectangles I: Extended avoidance

Abstract

We introduce extendable pattern avoidance for alternating sign rectangles (ASRs), the natural rectangular generalization of alternating sign matrices (ASMs). An ASR extendably avoids a pattern $\pi$ if it is the upper left corner of an ASM avoiding $\pi$. For each of the four length-three patterns in the equivalence class $\{312,132,213,231\}$ we establish a complete system of recurrence relations enumerating extendably $\pi$-avoiding ASRs of size $r\times k$ with a prescribed number $d$ of nonempty rows. For $\pi =312$ we further conjecture a closed-form expression and prove it on several diagonal slices via bijections involving Schröder ballot numbers, refined Schröder numbers and Delannoy paths that do not cross the main diagonal vertically. For ASRs of size $(r-1)\times (r+1)$ extendably avoiding $213$ we give a bijection to little Schröder paths of length $r$. The remaining patterns of length three, $123$ and $321$, are more elusive, mirroring the situation of ASMs.

25 pages