Papers
Topics
Authors
Recent
Search
2000 character limit reached

Double Grothendieck polynomials and colored lattice models

Published 9 Jul 2020 in math.CO, math-ph, math.KT, and math.MP | (2007.04533v2)

Abstract: We construct an integrable colored six-vertex model whose partition function is a double Grothendieck polynomial. This gives an integrable systems interpretation of bumpless pipe dreams and recent results of Weigandt [arXiv:2003.07342] relating double Grothendieck polynomias with bumpless pipe dreams. For vexillary permutations, we then construct a new model that we call the semidual version model. We use our semidual model and the five-vertex model of Motegi and Sakai to given a new proof that double Grothendieck polynomials for vexillary permutations are equal to flagged factorial Grothendieck polynomials. Taking the stable limit of double Grothendieck polynomials, we obtain a new proof that the stable limit is a factorial Grothendieck polynomial as defined by McNamara. The states of our semidual model naturally correspond to families of nonintersecting lattice paths, where we can then use the Lindstr\"om-Gessel-Viennot lemma to give a determinant formula for double Schubert polynomials corresponding to vexillary permutations.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

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

Continue Learning

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

Collections

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