Colleen Robichaux – Deciding Schubert positivity
Speaker: Colleen Robichaux (University of California, Davis) Title: Deciding Schubert positivity Abstract: Schubert coefficients count the number of points in a generic intersection of Schubert varieties. Using the framework of computational complexity, we discuss the problem of determining when a given Schubert coefficient is positive. Then we present an algorithmic solution to the Schubert positivity problem and highlight a connection to Polynomial Identity Testing. This is joint work with Igor Pak. Thematic program "Algebraic combinatorics and applications" Center for Mathematics at Notre Dame June 29 – July 10, 2026 sites.nd.edu/cmnd2026-thematic-program Mathematics at Notre Dame: math.nd.edu
▶︎
Nathan Reading – Theta functions in acyclic affine type
▶︎
Alex Yong – RSK as a linear operator
▶︎
Anna Weigandt – Weak order on alternating sign matrix varieties
▶︎
Limits of Logic: The Gödel Legacy
▶︎
Hunter Spink – The quasisymmetric flag variety
▶︎
Vincent Pilaud – Building lattices with flat scaffolding projections
▶︎
You've Never Seen Eigenvectors Explained Like This
▶︎
CHOSEN ONE!! YOUR IDENTITY REVEAL JUST SHOOK THE INTERNET... AND THEIR MINDS
▶︎
Saunders Mac Lane: "Mysteries and Marvels of Mathematics"
▶︎
Beyond Computation: The P vs NP Problem - Michael Sipser
▶︎
Philosopher David Chalmers asks: When we talk to AI, what are we talking to?
▶︎
I Bought And Restored "Old" Technology To Prove The Economy Is Imploding
▶︎
Edward Frenkel - New Frontiers in the Langlands Program for Riemann Surfaces
▶︎
How (and why) to take a logarithm of an image
▶︎
The Langlands Program - Numberphile
▶︎
General relativity from first principles – Adam Brown
▶︎
Martha Precup – Dimension stability for Hessenberg varieties
▶︎
The Hardest Questions in Physics | World Science Festival
▶︎
Yann LeCun: World Models: Enabling the next AI revolution
▶︎