Toufik Mansour

most citedEnumeration of

(k, 2)

-noncrossing partitions

6 citations · 6 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2008★ 6 cited

Enumeration of $(k, 2)$ -noncrossing partitions

Toufik Mansour, Simone Severini

A set partition is said to be $(k, d)$ -noncrossing if it avoids the pattern $12... k 12... d$ . We find an explicit formula for the ordinary generating function of the number of $(k,d…

math.CO2002

Restricted 132-Dumont permutations

T. Mansour

A permutation $π$ is said to be {\em Dumont permutations of the first kind} if each even integer in $π$ must be followed by a smaller integer, and each odd integer is either follow…

Enumeration of (k,2)-noncrossing partitions

Restricted 132-Dumont permutations

Enumeration of $(k, 2)$ -noncrossing partitions