Circuits and connectivity in ordered matroids (manuscript from 1990)

Notes on the Vershik-Okounkov approach to the representation theory of the symmetric groups

Note on Doron Zeilberger's paper:

${5\choose 2}$ Proofs that ${n\choose k} \leq {n\choose {k+1}}$ if $k< n/2$