Abstract
A finite difference equation for the straight ménage numbers (that is, the number of permutations on n letters such that letter i appears in neither position i, 1≤i≤n, nor in position (i-1), 1<i≤n) is derived. The derivation is combinatorial in nature, using a series of bijections. Also it is proved that generalized ménage numbers satisfy a finite recursion with polynomial coefficients.
| Original language | English |
|---|---|
| Pages (from-to) | 117-129 |
| Number of pages | 13 |
| Journal | Discrete Mathematics |
| Volume | 63 |
| Issue number | 2-3 |
| DOIs | |
| Publication status | Published - 1987 |
| Externally published | Yes |