Skip to Content

Sponsors

No results

Tags

No results

Types

No results

Search Results

Events

No results
Search events using: keywords, sponsors, locations or event type
When / Where
All occurrences of this event have passed.
This listing is displayed for historical purposes.

Presented By: Learning Seminar in Algebraic Combinatorics - Department of Mathematics

Combinatorial formulas and algorithms on bumpless pipe dreams

Daoji Huang

We introduce combinatorial formulas of (double) Schubert and Grothendieck polynomials based on bumpless pipe dreams and give a combinatorial proof of Monk’s rule for Schubert and double Schubert polynomials using bumpless pipe dreams that generalizes Schensted’s insertion on semi-standard Young tableaux. We also give a bijection between pipe dreams and bumpless pipe dreams and discuss its canonical nature.

Explore Similar Events

  •  Loading Similar Events...

Back to Main Content