Keys and alternating sign matrices

dc.creatorAval, Jean-Christophe
dc.date2007-11-14
dc.date2009-05-18
dc.date.accessioned2026-07-07T13:15:19Z
dc.date.available2026-07-07T13:15:19Z
dc.descriptionLascoux and Schützenberger 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.
dc.identifierhttps://arxiv.org/abs/0711.2150
dc.identifierhttp://arxiv.org/abs/0711.2150
dc.identifierSeminaire Lotharingien de Combinatoire 59 (2008) B59f
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/230435
dc.subjectCombinatorics
dc.titleKeys and alternating sign matrices
dc.typetext

Files

Collections