P. M. Rakotomamonjy

activity

20182022

most citedCrossings over permutations avoiding some pairs of patterns of length three

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing 2018Show all

1 paper · 1 filter

math.CO2018

Restricted permutations refined by number of crossings and nestings

Paul M. Rakotomamonjy

Let $s t = {s t_{1}, \dots, s t_{k}}$ be a set of $k$ statistics on permutations with $k \geq 1$ . We say that two given subset of permutations $T$ and $T^{'}$ are $s t$ -Wilf-equivalent if the j…