Toufik Mansour's curriculum vitae

 
 
 
 

Personal Details

Date of birth: January 17, 1968

Place of birth: Israel

Citizenship: Israel

Family status: Married two children (Wife: Ronit, childs: Itar, Atil).

Languages: Hebrew, English and Arabic.

Address: Toufik Mansour, Department of Mathematics, Hiafa University, 31905 Haifa, Israel,  Email: toufik@math.haifa.ac.il

 

Academic Background       and     Grants and Scholarships

February 2004

During my visit at Nankai University, Tianjin, China),

which had been support by Center for Combinatorics.

                      2003-2006(MAOF): Department of Mathematics, Haifa University, 31905 Haifa, Israel.

MAOF Scholarship 2003-2006 (9000$), Department of Mathematics, Haifa University.

POSTDOC 2002-2003(EU-Network): Department of Mathematics, Chalmers University of Technology, S-412 96 G\"oteborg, Sweden.

Supporter: Professor Einar Steingrimsson.

July 2003 EU-Network, During my visit Linkoping Institute of Technology for the Network Summer School, which had been support by EU-Network

Jan 2003 During my visit University of Haifa, which had been support by HIACS Research Center and the Caesarea Edmond Banjamin de Rothschild Foundation for Interdisciplinary Applications of Computer Science.

2002-2003 EU-Network: EC's IHRP Programme, within the Research Training Network "Algebraic Combinatorics in Europe", grant HPRN-CT-2001-00272, Sweden (Gothenborg + Linkpoing).

POSTDOC 2001-2002(France Government): Laboratoire Bordelais de Recherche Informatique (LaBRI), 351 cours de la Liberation, 33405 Talence Cedex, France.

 
Supporter: Professor Alexandre Zvonkine.

2001-2002 Bourse Chateaubriand, France (Bordeaux, LaBRI).

PH.D Mathematics, Haifa University, 1998-2001.

 
PH.D Thesis: Permutations with forbidden patterns.

 
Advisor: Professor Alek Vainshtein.

1999-1999 Isfia Local Council Scholarship.

1997-1998 Rahal and Banin Scholarship.

M.A. Mathematics, Haifa University, 1996-1998.

 
M.A. Thesis: Different approaches to the representations theory of the symmetric groups.

 
Advisor: Doctor Valdamir Hinich.

 

B.C.S. Mathematics, Technion, 1988-1992.

 

 

 

Courses Taught

2001-2001 Discrete Mathematics, Open University, Israel.

2001-2001 Differential equations I, Open University, Israel.

 

1999-2001 Theory of complex functions, Haifa University, Israel.

 

1999-2001 Algebra I, The Academic Arab College for Education, Israel.

 

1999-2001 Combinatorics, The Academic Arab College for Education, Israel.

 

1999-2001 Logic and set theory, The Academic Arab College for Education, Israel.

 

1999-2000 Calculus I, Haifa University, Israel.

 

1999-1999 Theory of real functions, Haifa University, Israel.

 

1997-1997 Linear algebra I,II, Haifa University, Israel.

 


 

Conference Presentations

Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polynomials, Paths, Permutations and Trees, China (Tianjin), February 25-27, 2004.

321-Polygon-avoiding permutations and Chebyshev polynomilas, Formal Power Series and Algenraic Combinatorics 2003 (FPSAC'03), Sweden (Vadstena), June 23-27, 2003.

Counting occurrences of 132 in an even permutation, Formal Power Series and Algenraic Combinatorics 2003 (FPSAC'03), Sweden (Vadstena), June 23-27, 2003.

Counting occurrences of 132 in an even permutation, S\'eminaire Lotharingien de Combinatoire 50 (SLC'50), Obernai (France), March 22-27, 2003.

Counting occurrences of 132 in a permutation, S\'eminaire Lotharingien de Combinatoire 48 (SLC'48), Obernai (France), March 10-13, 2002.

Restricted permutations and Chebyshev polynomials, S\'eminaire Lotharingien de Combinatoire 46 (SLC'46), Lyon (France), March 18-21, 2001.

Avoiding and containing certain patterns, Formal Power Series and Algebraic combinatorics 2000 (FPSAC'00), Moscow, June 25-30, 2000.

Restricted permutations, continued fractions, and Chebyshev polynomials, Israel Meeting Union (IMU), Haifa (Israel), May 17, 2000.

 
 

Talks

2004:

3. Nankai University of (Tianjin, China), February 2004, Restricted permutations, Block decomposition, and Chebyshev polynomials.

2. Nankai University of (Tianjin, China), February 2004, Avoidance pattern Problem and Combinatorial Objects.

1. Nankai University of (Tianjin, China), February 2004, Restricted 321-avoiding permutations.

2003:

1. University of Haifa, December 2003, Finite automata and pattern avoidance in words.

2. Matematiska Institutionen Linkopings Universitet, July 2003 (Summer School), Counting occurrences of 3-letter patterns in a permutation.

3. Chalmers University of Technology, March 2003, Average norms of polynomials.

4. Haifa University, February 2003, Average norms of polynomials.

5. Ben-Gurion University, January 2003, Average norms of polynomials.

2002:

1. Chalmers University of Technology, December 2002, Counting occurrences of 132 in even permutations.

2. Technion Institute of Technology, October 2002, Restricted permutations and Chebyshev polynomials.

3. Haifa University, October 2002, Restricted permutations.

4. Chalmers University of Technology, October 2002, Counting occurrences of 132 in a permutations.

5. Chalmers University of Technology, September 2002, Restricted permutations and Chebyshev polynomials.

6. Bar Ilan University, April 2002, Counting occurrences of generalized pattern of length three in a permutation.

7. Wiezmann Institute, April 2002, Permutations avoiding a pattern of length three or length four.

8. Laboratoire Bordelais de Recherche Informatique (LaBRI), March 2002, Counting occurrences of 132 in a permutation.

2001:

1. Laboratoire Bordelais de Recherche Informatique (LaBRI), December 2001, Pattern avoidance in coloured permutations.

2. Laboratoire Bordelais de Recherche Informatique (LaBRI), October 2001, Restricted permutations and Chebyshev polynomials.

3. Tel Aviv University, July 2001, Pattern avoidance in coloured permutations.

4. Wiezmann Institute, June 2001, Restricted permutations and Chebyshev polynomials.

5. Bar Ilan University, May 2001, Restricted permutations, Continued fractions, and Chebyshev polynomials.

*Home*