|Date: Friday, April 06, 2018
Location: 4088 East Hall (4:10 PM to 5:00 PM)
Title: Newton Polytopes in Algebraic Combinatorics
Abstract: A polynomial has saturated Newton polytope (SNP) if every lattice point of the convex hull of its exponent vectors corresponds to a monomial. We compile instances of SNP in algebraic combinatorics (some with proofs, others conjecturally). Our principal construction is the Schubitope. For any subset of [n] x [n], we describe it by linear inequalities. This generalized permutahedron conjecturally has positive Ehrhart polynomial. We conjecture it describes the Newton polytope of Schubert and key polynomials. This is joint work with Cara Monical and Alexander Yong.
Speaker: Neriman Tokcan
Institution: University of Michigan