Separable d-permutations and guillotine partitions
| dc.creator | Asinowski, Andrei | |
| dc.creator | Mansour, Toufik | |
| dc.date | 2008-03-24 | |
| dc.date.accessioned | 2026-07-07T09:28:07Z | |
| dc.date.available | 2026-07-07T09:28:07Z | |
| dc.description | We characterize separable multidimensional permutations in terms of forbidden patterns and enumerate them by means of generating function, recursive formula and explicit formula. We find a connection between multidimensional permutations and guillotine partitions of a box. In particular, a bijection between $d$-dimensional permutations and guillotine partitions of a $2^{d-1}$-dimensional box is constructed. We also study enumerating problems related to guillotine partitions under certain restrictions revealing connections to other combinatorial structures. This allows us to obtain results on avoided patterns in permutations. | |
| dc.description | 20 pages, 13 figures | |
| dc.identifier | https://arxiv.org/abs/0803.3414 | |
| dc.identifier | http://arxiv.org/abs/0803.3414 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/157340 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A05, 05A15 (Primary); 05C30, 68R05 (Secondary) | |
| dc.title | Separable d-permutations and guillotine partitions | |
| dc.type | text |