In 1977, Diaconis and Graham proved inequalities involving different permutation statistics that measure disarray of permutations. This talk will focus on a new proof of these inequalities by Cornwell and McNew from 2024 that uses links associated to permutations. In particular, they prove the inequalities by expressing the Euler characteristic of these links in terms of the permutation statistics appearing in the inequalities.