Guest Column: A Primer on the Statistics of Longest Increasing Subsequences and Quantum States

摘要

Suppose you encounter a cryptogram (substitution cipher) written in Spanish. To decipher it, you'll probably want to know the frequency of letters in Spanish text. So you download Don Quixote [2] and pick out a sample of 500 letters, drawn randomly with replacement; say, z, v, s, r, n, ..., q.