Igor Pak is Giving the 2018 Erdős Lectures in Discrete Mathematics and Theoretical Computer Science

Update: The lectures this week are cancelled.  They will be given at a later date.

Next week Igor Pak will give the 2018 Erdős Lectures

 

  • Monday Jun 18 2018

    Combinatorics — Erdos lecture: Igor Pak (UCLA) “Counting linear extensions”

    11:00am to 12:30pm

    Location:

    IIAS, Eilat hall, Feldman bldg (top floor), Givat Ram
    I will survey various known and recent results on counting the number of linear extensions of finite posets. I will emphasize the asymptotic and complexity aspects for special families, where the problem is especially elegant yet remains #P-complete.
  • Wednesday Jun20, 2018

    CS Theory — Erdős Lecture: Igor Pak (UCLA) “Counting Young tableaux”

    Igor Pak (UCLA)
    10:30am to 12:00pm

    Location:

    Rothberg (CS building) B-220

    The number of standard Young tableaux of skew shape is a mesmerizing special case of the number of linear extensions of posets, that is important for applications in representation theory and algebraic geometry.  In this case there is a determinant formula, but finding their asymptotics is a difficult challenge.  I will survey some of the many beautiful result on the subject, explain some surprising product formulas, connections to Selberg integral, lozenge tilings and certain particle systems.

  • Thursday, Jun21, 2018

    Colloquium: Erdos lecture – Igor Pak (UCLA) “Counting integer points in polytopes”

    2:30pm to 3:30pm

    Location:

    Manchester Building (Hall 2), Hebrew University Jerusalem
    Given a convex polytope P, what is the number of integer points in P? This problem is of great interest in combinatorics and discrete geometry, with many important applications ranging from integer programming to statistics. From a computational point of view it is hopeless in any dimensions, as the knapsack problem is a special case. Perhaps surprisingly, in bounded dimension the problem becomes tractable. How far can one go? Can one count points in projections of P, finite intersections of such projections, etc.?
Advertisements
This entry was posted in Combinatorics, Computer Science and Optimization, Geometry, Updates and tagged . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

w

Connecting to %s