Seminars & Colloquia Calendar
Faculty Research Talks
Jeff Kahn and Anders Buch, Rutgers University
Location: Hill 701 (GSL)
Date & time: Wednesday, 24 April 2019 at 12:15PM - 1:15PM
Jeff Kahn
Title: Trees and Degrees
Abstract: I'll mention a few problems on tree counts in graphs and, as time permits, try to say a little about what these might have to do with one or two topics (random methods, entropy) that I like.
****************
Anders Buch
Title: Schur Polynomials and the Littlewood-Richardson Rule
The ring of symmetric polynomials in a list of variables has a basis consisting of Schur polynomials that is related to many areas in mathematics, including representation theory of GL(n), geometry of Grassmannians, eigenvalues of Hermitian matrices, statistics, and complexity theory. The coefficients obtained when a product of two Schur polynomials is expanded in the basis of Schur polynomials are called Littlewood-Richardson coefficients. The classical Littlewood-Richardson rule expresses these coefficients as the number of ways of filling a diagram of boxes with integers satisfying certain conditions. I will speak about these basic notions, which are important in many parts of mathematics and have inspired many developments within combinatorics.
Title: Trees and Degrees
Abstract: I'll mention a few problems on tree counts in graphs and, as time permits, try to say a little about what these might have to do with one or two topics (random methods, entropy) that I like.
****************
Anders Buch
Title: Schur Polynomials and the Littlewood-Richardson Rule
The ring of symmetric polynomials in a list of variables has a basis consisting of Schur polynomials that is related to many areas in mathematics, including representation theory of GL(n), geometry of Grassmannians, eigenvalues of Hermitian matrices, statistics, and complexity theory. The coefficients obtained when a product of two Schur polynomials is expanded in the basis of Schur polynomials are called Littlewood-Richardson coefficients. The classical Littlewood-Richardson rule expresses these coefficients as the number of ways of filling a diagram of boxes with integers satisfying certain conditions. I will speak about these basic notions, which are important in many parts of mathematics and have inspired many developments within combinatorics.
