1.7k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Technion – Israel Institute of TechnologyIL151 papers
- Oranim Academic College of EducationIL134 papers
- Tel Aviv UniversityIL55 papers
- Heidelberg UniversityDE36 papers
- Carmel (Israel)IL29 papers
- Columbia UniversityUS25 papers
- Massachusetts Institute of TechnologyUS25 papers
- National Research University Higher School of EconomicsRU25 papers
- University of AmsterdamNL22 papers
- Hebrew University of JerusalemIL21 papers
- Princeton UniversityUS21 papers
- Centre National de la Recherche ScientifiqueFR20 papers
11 papers · 2 filters
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…
Diffusion on an Ising chain with kinks
Alioscia Hamma, Toufik Mansour, Simone Severini
We count the number of histories between the two degenerate minimum energy configurations of the Ising model on a chain, as a function of the length n and the number d of kinks tha…
Counting paths in Bratteli diagrams for SU(2)_k
Toufik Mansour, Simone Severini
It is known that the Hilbert space dimensionality for quasiparticles in an SU(2)_k Chern-Simons-Witten theory is given by the number of directed paths in certain Bratteli diagrams.…
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…
Lower Bounds for the Size of Random Maximal H-Free Graphs
Guy Wolfovitz
We consider the next greedy randomized process for generating maximal H-free graphs: Given a fixed graph H and an integer n, start by taking a uniformly random permutation of the e…
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
Raphael Yuster
For every fixed graph and every fixed , we show that if a graph has the property that all subsets of size contain the ``correct'' number of copies of one…
Separable d-permutations and guillotine partitions
Andrei Asinowski, Toufik Mansour
We characterize separable multidimensional permutations in terms of forbidden patterns and enumerate them by means of generating function, recursive formula and explicit formula. W…