On the enumeration of skew Young tableaux

For fixed n and a fixed partition α of k< n we give an explicit formula for the number N( n; α) of standard skew Young tableaux with n squares and shape λ/ α for some λ. From this formula the entire asymptotic expansion of N( n; α) as n→∞ can in principle be computed, generalizing recent work of...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Advances in applied mathematics 2003-01, Vol.30 (1), p.283-294
1. Verfasser:	Stanley, R.P.
Format:	Artikel
Sprache:	eng
Schlagworte:	Classical combinatorial problems Combinatorics Combinatorics. Ordered structures Exact sciences and technology Graph theory Mathematics Sciences and techniques of general use Skew tableau Standard Young tableau
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!