Simulation of random permutations from arbitrary reduced words (EXPERIMENTAL) permutations

Leonid Petrov

Simulation Info

Simulation of random permutations from arbitrary reduced words (EXPERIMENTAL) permutations

Leonid Petrov

This page simulates random permutations arising from nonsymmetric Grothendieck polynomials. For more details, see our paper [45]. Here we allow arbitrary reduced words, not just the staircase one.

Warning: the drawing feature is EXPERIMENTAL, and simulations may not work correctly.

Boundary:

N (Simulation): 1000

p: 0.50

q: 0.00

Use Parity Condition?

Permutation Result (EXPERIMENTAL: MIGHT NOT BE CORRECT IN ALL CASES)

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.)

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