Abstract
Recently a relationship was discovered between the number of permutations 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 ≤ k, on the other. The proof seemed quite unmotivated and artificial. Here we describe the sequence of events that led to the discovery, via computer algebra, of this relationship.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
