Papers
Topics
Authors
Recent
2000 character limit reached

Subword complexes via triangulations of root polytopes (1502.03997v3)

Published 13 Feb 2015 in math.CO

Abstract: Subword complexes are simplicial complexes introduced by Knutson and Miller to illustrate the combinatorics of Schubert polynomials and determinantal ideals. They proved that any subword complex is homeomorphic to a ball or a sphere and asked about their geometric realizations. We show that a family of subword complexes can be realized geometrically via regular triangulations of root polytopes. This implies that a family of $\beta$-Grothendieck polynomials are special cases of reduced forms in the subdivision algebra of root polytopes. We can also write the volume and Ehrhart series of root polytopes in terms of $\beta$-Grothendieck polynomials.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.