Pechenik, Speyer and Weigandt defined a statistic rajcode(⋅) on permutations which characterizes the leading monomial in top degree components of double Grothendieck polynomials. Their proof is combinatorial: They showed there exists a unique pipedream of a permutation w with row weight rajcode(w) and column weight rajcode(w-1). They proposed the problem of finding a "direct recipe" for this pipedream. We solve this problem by providing an algorithm that constructs this pipedream via ladder moves.
@article{10_37236_12665,
author = {Chen-An Chou and Tianyi Yu},
title = {Constructing maximal pipedreams of double {Grothendieck} polynomials},
journal = {The electronic journal of combinatorics},
year = {2024},
volume = {31},
number = {3},
doi = {10.37236/12665},
zbl = {1548.05324},
url = {http://geodesic.mathdoc.fr/articles/10.37236/12665/}
}
TY - JOUR
AU - Chen-An Chou
AU - Tianyi Yu
TI - Constructing maximal pipedreams of double Grothendieck polynomials
JO - The electronic journal of combinatorics
PY - 2024
VL - 31
IS - 3
UR - http://geodesic.mathdoc.fr/articles/10.37236/12665/
DO - 10.37236/12665
ID - 10_37236_12665
ER -