Grothendieck shenanigans - simulation of random permutations from staircase reduced word permutations

Leonid Petrov

Simulation Info

Grothendieck shenanigans - simulation of random permutations from staircase reduced word permutations

Leonid Petrov

This page simulates random permutations arising from nonsymmetric Grothendieck polynomials. For more details, see our paper [45]. Use the controls below to choose $N$, $p$, and $q$, then view the resulting permutation matrix drawn via D3.js.

Simulation Controls

$N$: 1000

$p$:

$q$:

The initial pipe dream boundary condition (where the pipe dreams live) is as follows:

code

(note: parameters in the code might differ from the ones in simulation results below)

Link to code (This simulation is interactive, written in JavaScript, see the source code of this page at the link)
Link to code (c code for the simulation of heatmaps, runs faster)

Dear colleagues:

Feel free to use code (unless otherwise specified next to the corresponding link), data, and visualizations to illustrate your research in talks and papers, with attribution (CC BY-SA 4.0). Some images are available in very high resolution upon request. I can also produce other simulations upon request - email me at lenia.petrov@gmail.com

This material is based upon work supported by the National Science Foundation under Grant DMS-2153869