Search Clay Mathematics Institute

  • About
    About
    • About
    • History
    • Principal Activities
    • Who’s Who
    • CMI Logo
    • Policies
  • Programs & Awards
    Programs & Awards
    • Programs & Awards
    • Funded programs
    • Fellowship Nominations
    • Clay Research Award
    • Dissemination Award
  • People
  • The Millennium Prize Problems
    The Millennium Prize Problems
    • The Millennium Prize Problems
    • Birch and Swinnerton-Dyer Conjecture
    • Hodge Conjecture
    • Navier-Stokes Equation
    • P vs NP
    • Poincaré Conjecture
    • Riemann Hypothesis
    • Yang-Mills & the Mass Gap
    • Rules for the Millennium Prize Problems
  • Online resources
    Online resources
    • Online resources
    • Books
    • Video Library
    • Lecture notes
    • Collections
      Collections
      • Collections
      • Euclid’s Elements
      • Ada Lovelace’s Mathematical Papers
      • Collected Works of James G. Arthur
      • Klein Protokolle
      • Notes of the talks at the I.M.Gelfand Seminar
      • Quillen Notebooks
      • Riemann’s 1859 Manuscript
  • Events
  • News

Home — Lectures — Algebraic combinatorics meets probability: statistical mechanics and asymptotics, part 2

Algebraic combinatorics meets probability: statistical mechanics and asymptotics, part 2

Abstract: Algebraic Combinatorics sits at the intersection of Combinatorics and Representation Theory and Algebra, using algebraic methods to answer combinatorial questions and employs tools from discrete mathematics to study problems in group theory and representation theory. In this minicourse we will start with introducing basic tools and theorems from Algebraic Combinatorics which have seen wide applications in Statistical Mechanics: symmetric function theory, representation theory of the symmetric group, the RSK algorithm and nonintersecting lattice paths etc. We will then see how we can use them to derive probabilistic results like limit behavior in dimer models (mainly lozenge tilings). We will also discuss the application of probabilistic methods in enumerate asymptotically combinatorial objects.

Share
  • Privacy Policy
  • Contact CMI

© 2025 Clay Mathematics Institute

Site by One