Mitosis algorithm for Grothendieck polynomials

TL;DR

This paper extends the mitosis algorithm, originally for Schubert polynomials, to Grothendieck polynomials, providing a new computational approach for these algebraic objects.

Contribution

The paper introduces a novel extension of the mitosis algorithm to Grothendieck polynomials, expanding computational tools in algebraic combinatorics.

Findings

Extended mitosis algorithm to Grothendieck polynomials

Provides a new computational method for Grothendieck polynomials

Enhances understanding of algebraic structures related to K-theory

Abstract

In this article we will introduce the way to extend the mitosis algorithm for Schubert polynomials, developed by Ezra Miller, to the case of Grothendieck polynomials.