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.
Brush usage:
- Left‐drag to paint or erase
- “Clear All” / “Fill All” resets entire shape
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.)
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