Toufik Mansour's books
5 Toufik Mansour and Armend Sh. Shabani,
Combinatorics of Bargraphs,
Press STEM, January 2026.
4Toufik Mansour and Matthias Schork,
Commutation Relations, Normal Ordering, and Stirling Numbers (Discrete Mathematics and Its
Applications), Chapman & Hall/CRC, York, September 2015.
3Toufik Mansour,
Combinatorics of Set Partitions (Discrete Mathematics and Its Applications), Chapman & Hall/CRC, Taylor & Francis Group, Boca Raton, London, New
York, August 2012.
First pages: Preface of the book,
and Table of Content of the book
Updating References and Typos: click here to see the
list.
Programs as listed in the Appendix of the book: allprogramsSP.txt of the book.
2 Silvia Heubach and Toufik Mansour,
Combinatorics of Compositions and Words (Discrete Mathematics and Its Applications), Chapman & Hall/CRC, Taylor & Francis Group, Boca Raton,
London, New York, 2009.
1 Silvia Heubach and Toufik Mansour,
Combinatorics of Compositions and Words: Solutions Manual, Chapman &
Hall/CRC, Taylor & Francis Group, Boca Raton, London, New York, 2009.
Contents:
1. Preface of the book
2. Table of Content of the book
3. Programs: In Appendix G in the book we described 5 C++ programs G1-G5:
(1) G1: Compositions avoiding a fixed pattern,
(2) G2: Classification patterns in compositions,
(3) G3: k-ary words avoiding a fixed pattern,
(4) G4: Classification patterns in k-ary words,
(5) G5: TOU_AUTO and TOU_FORMULA: formula for |[k]n(pattern)|.
4. JAVA programs:
(1) JAVA H1: Compositions avoiding a fixed set of
patterns, (2) JAVA H3: k-ary words avoiding a fixed
set of
patterns.
5. Classification subsequence patterns:
(1) of lengths 4 and 5 in
compositions, (2) of
lengths 4, 5 and 6 in k-ary words.
6. Updating references: click here to see the list.