Permutations with Restricted Position

Frank Harary · Mathematics of Computation · 1962

In his book on combinatorial analysis, Riordan [4, discusses permutations with restricted position and mentions an open question : "Any restrictions of position may be represented on a square, with the elements to be permuted as column heads and the positions as row heads, by putting a cross at a row-column intersection to mark a restriction.For example, for permutations of four (distinct) elements, the arrays of restrictions for the rencontres and reduced ménage problems mentioned above are

Read the paper · More papers on PaperTik