product iamge

Enumerative Combinatorics of Young tableaux

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Shreeram S. Abhyankar
Series: Monographs and textbooks in pure and applied mathematics #115
Publisher: Marcel Dekker
Year: 1988

Language: English
Commentary: New scan of https://libgen.is/book/index.php?md5=CC4E562BED949AC5BD228D7D812FC18A
Pages: 509+xix
City: New York

Title
Preface
Contents
General Introduction
1. Young Tableaux and Determinantal Polynomials in Binomial Coefficients
1. Introduction
2. Notation and Terminology
3. Summation Lemmas
4. Binomial Lemmas
2. Enumeration of Young Tableaux
5. Preparation for Counting Tableaux
6. Conditional Equivalence of Certain Determinantal Polynomials of Any Width
7. Equivalence of Certain Determinantal Polynomials of Width 2
8. Recursive Relations
9. Counting Tableaux
3. Universal Determinantal Identity
10. Informal Discussion
11. Preview
12. Laplace Development of a Determinant
13. The Basic Case
14. Castification and the Maximal Size Case
15. Unification and the Mixed Size Case
16. The Full Depth Case
17. Partial Order and the Full Depth Case
18. Content and the Full Depth Case
19. An Alternative Treatment of the Full Depth Case
4. Applications to Ideal Theory
20. Hilbertian Ideals and Generalized Second Fundamental Theorem of Invariant Theory
Notation
Index