Open Problems in Algebraic Combinatorics

Speakers:

• Sami Assaf
• Sylvie Corteel
• Philippe DiFrancesco
• Sergey Fomin
• Pavel Galashin
• Eugene Gorsky
• June Huh
• Joel Kamnitzer
• Rick Kenyon
• Allen Knutson
• Thomas Lam
• Anton Mellit
• Igor Pak
• Greta Panova
• Alex Postnikov
• Claudiu Raicu
• Steven Sam
• Ralf Schiffler
• Anne Schilling
• David Speyer
• Hugh Thomas
• Julianna Tymoczko
• Lauren Williams
• Nathan Williams

Registration for OPAC 2020 is free. To register, please fill out this form.

To apply for funding to attend OPAC 2020, please fill out this form. Priority will be given to those who do not have other sources of funding. The deadline for funding applications is January 15, 2020.

Travel info: Coming soon!

Tentative talk titles:

• Sami Assaf: Using polynomials to resolve open problems in representation theory and geometry
• Sylvie Corteel: Cylindric partitions
• Philippe DiFrancesco: The combinatorics of triangular ice
• Eugene Gorsky: Generalized q,t-Catalan polynomials and link invariants
• June Huh: Lorentzian polynomials
• Joel Kamnitzer: Canonical bases in representation theory and cluster algebras
• Rick Kenyon: Dimers and related models
• Thomas Lam: Positive geometries
• Anton Mellit: Combinatorial expressions for the nabla operator
• Igor Pak: Complexity aspects and challenges in algebraic combinatorics
• Greta Panova: Structure constants in algebraic combinatorics: from Geometric Complexity Theory to Asymptotics
• Claudiu Raicu: Homological invariants of $S_n$-equivariant monomial ideals
• Steven Sam: Combinatorial problems inspired by representation stability
• Ralf Schiffler: Perfect matching problems in cluster algebras and number theory
• Anne Schilling: How crystals might help to make progress on plethysm coefficients
• Hugh Thomas: Newton polytopes in cluster algebras

The conference will be accompanied by a proceedings to be published by the AMS. More info about the proceedings to come.

An Open Problems in Algebraic blog to accompany the OPAC 2020 conference is online here.