THE COMPUTER-AIDED DISCOVERY OF A THEOREM ABOUT YOUNG-TABLEAUX

Authors
Citation
Hs. Wilf, THE COMPUTER-AIDED DISCOVERY OF A THEOREM ABOUT YOUNG-TABLEAUX, Journal of symbolic computation, 20(5-6), 1995, pp. 731-735
Citations number
4
Categorie Soggetti
Mathematics,"Computer Sciences, Special Topics",Mathematics,"Computer Science Theory & Methods
ISSN journal
07477171
Volume
20
Issue
5-6
Year of publication
1995
Pages
731 - 735
Database
ISI
SICI code
0747-7171(1995)20:5-6<731:TCDOAT>2.0.ZU;2-F
Abstract
Recently a relationship was discovered between the number of permutati ons of n letters that have no increasing subsequence of length > k, on the one hand, and the number of Young tableaux of n cells whose first row is of length less than or equal to k, on the other. The proof see med quite unmotivated and artificial. Here we describe the sequence of events that led to the discovery, via computer algebra, of this relat ionship. (C) 1995 Academic Press Limited