Key-avoidance for alternating sign matrices
Abstract
We initiate a systematic study of key-avoidance on alternating sign matrices (ASMs) defined via pattern-avoidance on an associated permutation called the \emph{key} of an ASM. We enumerate alternating sign matrices whose key avoids a given set of permutation patterns in several instances. We show that ASMs whose key avoids are permutations, thus any known enumeration for a set of permutation patterns including extends to ASMs. We furthermore enumerate by the Catalan numbers ASMs whose key avoids both and . We also show ASMs whose key avoids are in bijection with the gapless monotone triangles of [Ayyer, Cori, Gouyou-Beauchamps 2011]. Thus key-avoidance generalizes the notion of -avoidance studied there. Finally, we enumerate ASMs with a given key avoiding and using a connection to Schubert polynomials, thereby deriving an interesting Catalan identity.
Keywords
Cite
@article{arxiv.2408.05311,
title = {Key-avoidance for alternating sign matrices},
author = {Mathilde Bouvel and Rebecca Smith and Jessica Striker},
journal= {arXiv preprint arXiv:2408.05311},
year = {2025}
}
Comments
28 pages