  We introduce a new row insertion algorithm on decreasing tableaux and
increasing tableaux, generalizing Edelman-Greene (EG) row insertion. Our row
insertion algorithm is a nontrivial variation of Hecke column insertion which
generalizes EG column insertion. Similar to Hecke column insertion, our row
insertion is bijective and respects Hecke equivalence, and therefore recovers
the expansions of stable Grothendieck functions into Grassmannian stable
Grothendieck functions.
