Top Ten Correlations between the Old School and Discrete Mathematics

1. Gray codes of binary n-tuples are named after a physicist who published the idea in 1934, but were alluded to by Emile Baudot in 1878.
2. Walsh functions, which approximate trigonometric functions, were discovered in 1923.
3. N.G. de Bruijn discovered the cycle of 2^n digits in which every binary n-tuple occurs consecutively in the 1946 edition of Indagationes Mathematicae.
4. Karnaugh maps for plotting n>2 bit binary output in two dimensions were devised in 1953.
5. Algorithm to generate all lexicographic permutations of a sorted sequence {a1...an} dates back to Narayana Pandita in 14th-century India.
6. The "Cambridge Forty-Eight" sequence of permutations of five bells has been used since the early 1600s.
7. Cayley graphs plotting permutations with a set of generators were devised in 1878.
8. The Sims table for representing groups of permutations was published in Computational Methods in Abstract Algebra in 1970. Every possible permutation of n elements can be represented uniquely as a product of Sims table elements.
9. Evariste Galois put forth the notion of permutation groups in 1830. A set of permutations forms a group, if it is closed under multiplication.
10. Simeon Denis-Poisson published the Poisson Distribution in 1838.