The largest and the smallest fixed points of permutations
| dc.creator | Deutsch, Emeric | |
| dc.creator | Elizalde, Sergi | |
| dc.date | 2009-04-17 | |
| dc.date.accessioned | 2026-07-07T13:05:45Z | |
| dc.date.available | 2026-07-07T13:05:45Z | |
| dc.description | We give a new interpretation of the derangement numbers d_n as the sum of the values of the largest fixed points of all non-derangements of length n-1. We also show that the analogous sum for the smallest fixed points equals the number of permutations of length n with at least two fixed points. We provide analytic and bijective proofs of both results, as well as a new recurrence for the derangement numbers. | |
| dc.description | 7 pages | |
| dc.identifier | https://arxiv.org/abs/0904.2792 | |
| dc.identifier | http://arxiv.org/abs/0904.2792 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/227592 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A05 (Primary); 05A15 (Secondary) | |
| dc.title | The largest and the smallest fixed points of permutations | |
| dc.type | text |