Last HW, due Wednesday Nov 29

1. Let w0 denote the permutation of {1..n} with the most inversions. Show that w0 o w0 = identity.

2. For any pi, show that invs(pi) + invs(w0 o pi) = invs(w0). Also show invs(w0 o pi) = invs(pi o w0).

[More coming in a couple of days]