A property of dominance of partitions
| dc.creator | Bousquet-Mélou, Mireille | |
| dc.date | 2008-03-18 | |
| dc.date.accessioned | 2026-07-07T12:17:45Z | |
| dc.date.available | 2026-07-07T12:17:45Z | |
| dc.description | Given an integer partition $\la=(\la_1, ..., \la_\ell)$ and an integer k, denote by $\la^{(k)}$ the sequence of length $\ell$ obtained by reordering the values $|\la_i-k|$ in non-increasing order. If $\la$ dominates $μ$ and has the same weight, then $\la^{(k)}$ dominates $μ^{(k)}$. | |
| dc.description | Note. 1.5 page(s) | |
| dc.identifier | https://arxiv.org/abs/0803.2699 | |
| dc.identifier | http://arxiv.org/abs/0803.2699 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/212181 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A17 | |
| dc.title | A property of dominance of partitions | |
| dc.type | text |