Combinatorics and Complexity in Schubert Calculus – April 5-9, 2027

Organized by:

  • Leonardo Mihalcea (Virginia Tech)
  • Igor Pak (UCLA)
  • Colleen Robichaux (UCLA)
  • Frank Sottile (Texas A&M)

Schubert calculus aims to compute intersection multiplicities of Schubert varieties in the complete flag variety. With the motivation of Hilbert’s 15th problem, rigorous foundations of these computations were developed using cohomology theory. In the following century, additional tools were developed to compute these intersection multiplicities using ring theory and combinatorics. Additionally, these original problems in Schubert calculus have been generalized to enriched cohomology theories such as equivariant cohomology and K-theory, and their quantum versions.

In this workshop we aim to understand the fundamental combinatorial and algebraic structure of these geometric problems and their associated computational complexity. We aim to bring together researchers from three communities: geometry, algebraic combinatorics and computational complexity. The hope is to bridge the divide and foster some interaction, aiming to eventually make progress in understanding the combinatorial and complexity-theoretic nature of the structure constants and the underlying geometry.