CMU Campus
Department of         Mathematical Sciences
Events People Colloquia and Seminars Conferences Centers Positions Areas of Research About the Department
Algorithms, Combinatorics and Optimization Seminar

For more information, please visit the home page for the program in Algorithms, Combinatorics and Optimization at Carnegie Mellon University.

Carnegie Mellon University offers an interdisciplinary Ph.D program in Algorithms, Combinatorics and Optimization. This program is the first of its kind in the United States. It is administered jointly by the Tepper School of Business (Operations Research group), the Computer Science Department (Algorithms and Complexity group) and the Department of Mathematical Sciences (Discrete Mathematics group). (Learn more...)


Sevak Mkrtchyan
Carnegie Mellon University
Title: The Entropy of Schur-Weyl measures

Abstract: We will study local and global statistical properties of Young diagrams with respect to a Plancherel-type family of measures called Schur-Weyl measures and use the results to answer a question from asymptotic representation theory. More precisely, we will solve a variational problem to prove a limit-shape result for random Young diagrams with respect to the Schur-Weyl measures and apply the results to obtain logarithmic, order-sharp bounds for the dimensions of certain representations of finite symmetric groups. We will discuss connections with random matrix theory and combinatorics, in particular the RSK algorithm and longest increasing subsequences.

Date: Thursday, September 13, 2012
Time: 3:30 pm
Location: WeH 8220
Submitted by:  Loh