- Full Professor
- University of Haifa
- Department of Mathematics University of Haifa 3498838 Haifa, Israel
- P
- 972 (0)4 8240705
- F
- 972 (0)4 8240024
- EDIT PROFILE

Toufik Mansour obtained his Ph.D. degree in mathematics from the University of Haifa in 2001. After various postdoctoral stints, Toufik became a permanent member of the faculty at the University of Haifa in 2003 and was promoted to associate professor in 2008. He spends his summers as a visitor at institutions around the globe, for example, at the Center for Combinatorics at Nankai University (China), where he was a faculty member from 2004 to 2007, and at The John Knopfmacher Center for Applicable Analysis and Number Theory at the University of the Witwatersrand (South Africa). Toufik's area of specialty is enumerative combinatorics, and more generally, discrete mathematics and its applications. Originally focusing on pattern avoidance in

permutations, he has extended his interest to colored permutations, set partitions, words, and compositions.

Mansour has performed research in Discrete Mathematics and its applications. He has authored or coauthored more than 200 research papers. He also has written two books, Combinatorics of Compositions and Words, and Combinatorics of Set

partitions about permutation patterns on compositions, words and set partitions.

Phd Univ. | University of Haifa | Phd Major | Mathematics | Phd Date | 2001 |
---|---|---|---|---|---|

Master Univ. | University of Haifa | Master Major | Mathematics | Master Date | 1999 |

Bachelor Univ. | Technion Institute of Technology | Bachelor Major | Mathematics | Bachelor Date | 1992 |

Enumerative Combinatorics
Combinatorial identities
Formal power series and Generating functions
Kernel method
Difference relations
Pattern avoidance problem
Discrete Mathematics and its applications to Physics
Biology
and Chemistry
EDIT INTEREST

### Expertise:

- Finite Sets / New Designs (40)
- Random graph / Independence number (15)
- Traditional method / Burgers equation (6)
- Automata Theory / Slender Languages (4)
- Parallel Algorithms / Wormhole Networks (3)
- Approximation Algorithms / Perfect Graphs (3)
### Conference:

- Electr. J. Comb. (17)Discrete Mathematics (15)Discrete Applied Mathematics (13)Ars Comb. (8)Eur. J. Comb. (7)Discrete Mathematics & Theoretical Computer Science (6)

Loading ...

- 90
- 89
- 88
- 87
- 86
- 85
- 84
- 83
- 82
- 81
- 80
- 79
- 78
- 77
- 76
- 75
- 74
- 73
- 72
- 71

PDFButtonSupport

Copyright © 2006-2011 KEG, Tsinghua. All Rights Reserved.