IJPAM: Volume 16, No. 2 (2004)

YOUNG TABLEAUX AND $k$-MATCHINGS
IN FINITE POSETS

Marilena Barnabei$^1$, Flavio Bonetti$^2$, Matteo Silimbani$^3$
$^{1,2,3}$Department of Mathematics
University of Bologna
Piazza di Porta S. Donato, 5
Bologna, 40127, ITALY
$^1$e-mail: barnabei@dm.unibo.it
$^2$e-mail: bonetti@dm.unibo.it
$^3$e-mail: silimban@dm.unibo.it


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.

Received: July 20, 2004

AMS Subject Classification: 05A17, 06A07

Key Words and Phrases: Young tableaux, Robinson-Schensted algorithm, finite partially ordered set

Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2004
Volume: 16
Issue: 2