105 citations
- Oranim Academic College of EducationIL11 papers
- Carmel (Israel)IL4 papers
- Nankai UniversityCN4 papers
- Technion – Israel Institute of TechnologyIL4 papers
- Centre National de la Recherche ScientifiqueFR3 papers
- Dalian Maritime UniversityCN3 papers
- Hebrew University of JerusalemIL3 papers
- Centrum Wiskunde & InformaticaNL2 papers
- Royal Holloway University of LondonGB2 papers
- University of IcelandIS2 papers
- University of Notre DameUS2 papers
- University UcinfCL2 papers
24 papers · 1 filter
Symmetric Schroder paths and restricted involutions
Eva Y. P. Deng, Mark Dukes, Toufik Mansour +1
Let be the set of permutations in the symmetric group with prefix 12. This paper concerns the enumeration of involutions which avoid the set of patterns . We prese…
Hardness and Algorithms for Rainbow Connection
Sourav Chakraborty, Eldar Fischer, Arie Matsliah +1
An edge-colored graph is {\em rainbow connected} if any two vertices are connected by a path whose edges have distinct colors. The {\em rainbow connection} of a connected graph…
Enumeration of -noncrossing partitions
Toufik Mansour, Simone Severini
A set partition is said to be -noncrossing if it avoids the pattern . We find an explicit formula for the ordinary generating function of the number of $(k,d…
On the number of combinations without certain separations
Toufik Mansour, Yidong Sun
In this paper we enumerate the number of ways of selecting objects from objects arrayed in a line such that no two selected ones are separated by object…
Identities involving Narayana polynomials and Catalan numbers
Toufik Mansour, Yidong Sun
We first establish the result that the Narayana polynomials can be represented as the integrals of the Legendre polynomials. Then we represent the Catalan numbers in terms of the N…
Bell Polynomials and -generalized Dyck Paths
Toufik Mansour, Yidong Sun
A {\em k-generalized Dyck path} of length is a lattice path from to in the plane integer lattice consisting of horizontal-steps $(k…