Example 4.23 Make all permutations of 5 distinct elements a1,a2,a3,a4,a5, where a1 is not in the 1st or 2nd position, a2 is not in the 2nd or 3rd position, a3 is not in the 5th position, a4 is not in the 4th or 5th position, and a5 is not in the 3rd or 4th position. How many different permutations can be made?
Official solution
Solution: This is a permutation problem with restrictions, and the corresponding 5×5 chessboard R5 with forbidden cells is shown in Figure 4.5. The rook polynomial of the forbidden cell chessboard C of R5 is =t⋅(××)⋅××××+(×××)⋅×××××=t(1+2t)(1+4t+3t2)+(1+3t+t2)(1+5t+6t2+t3)=(t+6t2+11t3+6t4)+(1+8t+22t2+24t3+9t4+t5)=1+9t+28t2+35t3+15t4+t5,
Therefore, the hit polynomial of R5 is E(t)=5!+9⋅4!(t−1)+28⋅3!(t−1)2+35⋅2!(t−1)3+15(t−1)4+(t−1)5,
Thus, the number of all permutations is N=E(0)=5!−9⋅4!+28⋅3!−35⋅2!+15−1=120−216+168−70+15−1=16.
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic, difficulty and ordering added
by this site.