We present a recursive procedure that directly associates a Young tableau to an arbitrary finite poset with a linear extension, where no a priori information about its Ferrers shape is required.
Young tableaux and k-matchings in finite posets
BARNABEI, MARILENA;BONETTI, FLAVIO;SILIMBANI, MATTEO
2004
Abstract
We present a recursive procedure that directly associates a Young tableau to an arbitrary finite poset with a linear extension, where no a priori information about its Ferrers shape is required.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
