Young Tableaux In Combinatorics Invariant Theory And Algebra
Download Young Tableaux In Combinatorics Invariant Theory And Algebra PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Young Tableaux In Combinatorics Invariant Theory And Algebra book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Young Tableaux in Combinatorics, Invariant Theory, and Algebra
Young Tableaux in Combinatorics, Invariant Theory, and Algebra: An Anthology of Recent Work is an anthology of papers on Young tableaux and their applications in combinatorics, invariant theory, and algebra. Topics covered include reverse plane partitions and tableau hook numbers; some partitions associated with a partially ordered set; frames and Baxter sequences; and Young diagrams and ideals of Pfaffians. Comprised of 16 chapters, this book begins by describing a probabilistic proof of a formula for the number f? of standard Young tableaux of a given shape f?. The reader is then introduced to the generating function of R. P. Stanley for reverse plane partitions on a tableau shape; an analog of Schensted's algorithm relating permutations and triples consisting of two shifted Young tableaux and a set; and a variational problem for random Young tableaux. Subsequent chapters deal with certain aspects of Schensted's construction and the derivation of the Littlewood-Richardson rule for the multiplication of Schur functions using purely combinatorial methods; monotonicity and unimodality of the pattern inventory; and skew-symmetric invariant theory. This volume will be helpful to students and practitioners of algebra.
Invariant Theory and Tableaux
This volume stems from a workshop held for the Applied Combinatorics program in March 1988. The central idea of the workshop was the recent interplay of the classical analysis of q-series, and the combinatorial analysis of partitions of integers. Many related topics were discussed, including orthogonal polynomials, the Macdonald conjectures for root systems, and related integrals. Those people interested in combinatorial enumeration and special functions will find this volume of interest. Recent applications of q-series (and related functions) to exactly solvable statistical mechanics models and to statistics makes this volume of interest to non-specialists. Included are several expository papers, and a series of papers on new work on the unimodality of the q-binomial coefficient.
Enumerative Combinatorics: Volume 2
Author: Richard P. Stanley
language: en
Publisher: Cambridge University Press
Release Date: 1999-01-13
This second volume of a two-volume basic introduction to enumerative combinatorics covers the composition of generating functions, trees, algebraic generating functions, D-finite generating functions, noncommutative generating functions, and symmetric functions. The chapter on symmetric functions provides the only available treatment of this subject suitable for an introductory graduate course on combinatorics, and includes the important Robinson-Schensted-Knuth algorithm. Also covered are connections between symmetric functions and representation theory. An appendix by Sergey Fomin covers some deeper aspects of symmetric function theory, including jeu de taquin and the Littlewood-Richardson rule. As in Volume 1, the exercises play a vital role in developing the material. There are over 250 exercises, all with solutions or references to solutions, many of which concern previously unpublished results. Graduate students and research mathematicians who wish to apply combinatorics to their work will find this an authoritative reference.