Keys and alternating sign matrices
Combinatorics
2009-05-18 v2
Abstract
Lascoux and Sch\"utzenberger introduced a notion of key associated to any Young tableau. More recently Lascoux defined the key of an alternating sign matrix by recursively removing all -1's in such matrices. But alternating sign matrices are in bijection with monotone triangles, which form a subclass of Young tableaux. We show that in this case these two notions of keys coincide. Moreover we obtain an elegant and direct way to compute the key of any Young tableau, and discuss consequences of our result.
Cite
@article{arxiv.0711.2150,
title = {Keys and alternating sign matrices},
author = {Jean-Christophe Aval},
journal= {arXiv preprint arXiv:0711.2150},
year = {2009}
}