Instructions: click on blue and green circles until the number of crossings in the picture is minimal possible (see 'Minimal possible length' below).
Both types of circles correspond to conjugation moves fsifsi, but blue circles preserve the number (f) of crossings, and green circles decrease it by 2.
Press the "Run ODE" button to solve the problem using a system of linear ODE: xi(0)=i;xi(t)=xf(i)xiiZ, where xi(t) is the horizontal coordiante of the two points labeled i at the top and bottom row of the picture. See the proof of Proposition 4.13 in arXiv:2212.12962 for more details.

[f(1),f(2),...,f(n)]=

Level 1
-7-7-6-6-5-5-4-4-3-3-2-2-1-10011223344556677889910101111121213131414151516161717181819192020

Length: (f)= 4. Minimal possible length: 0. k(f)= 1, n(f)= 4. Number of cycles: ncyc(f)= 1.

Show QR code Switch to Demo mode