cises 10.7 and 10.9 suggest rather direct links between codes and BIBDs, however.) Similarly, the notion of resilient function introduced in §10.6 is directly related only to codes and orthogonal arrays, the link to designs being left to the reader. Review of2 Combinatorics of Permutations Author of book: Mikl s B na o o Publisher: Chapman & Hall/CRC 2004, 383 pages Review by R. Gregory Taylor Introduction Any permutation of ordered n-element set [n] =: {1, . . . , n} may be regarded as introducing a (possibly null) measure of disorder to that set. For example, the natural order of [7] is maximally disturbed by permutation 7654321, where the occurrence of j in position i with 1 ¤ i, j ¤ 7 indicates that position i, formerly lled by element i, is now lled by element j. In contrast, identity permutation 1234567 preserves the pre-ordained order. Somewhere between these two extremes we nd the likes of p = 2156743, which representation gures as second line in the familiar two-line representation 1 2 3 4 5 6 7 2 1 5 6 7 4 3 of p. The latter suggests the more standard conception of 7-permutations as function
/lp/association-for-computing-machinery/combinatorics-of-permutations-XpLxlKVpuC