Focusing on a very active area of mathematical research in the last decade, Combinatorics of Set Partitions presents methods used in the combinatorics of pattern avoidance and pattern enumeration in set partitions. Designed for students and researchers in discrete mathematics, the book is a one-stop reference on the results and research activities of set partitions from 1500 A.D. to today.
Each chapter gives historical perspectives and contrasts different approaches, including generating functions, kernel method, block decomposition method, generating tree, and Wilf equivalences. Methods and definitions are illustrated with worked examples and Maple (TM) code. End-of-chapter problems often draw on data from published papers and the author's extensive research in this field. The text also explores research directions that extend the results discussed. C++ programs and output tables are listed in the appendices and available for download on the author's web page.
Rezensionen / Stimmen
"Containing 375 references, this book works best as an encyclopedia for researchers working in this topic. But it can also be effectively used by students who are interested in the combinatorics of set partitions and want to get a hand on researching them. ... a very useful reference for researchers of the enumerative side of set partitions."
-Acta Sci. Math. (Szeged), 80, 2014
"... a comprehensive account of the history and current research in the combinatorics of pattern enumeration and pattern avoidance in set partitions. ... While it is aimed primarily at advanced undergraduate and graduate students in discrete mathematics with a focus on set partitions, its extensive bibliography, with 375 entries, and the variety of constructions and approaches used in the text make it a valuable reference for researchers in this field."
-Ricardo Mamede, Zentralblatt MATH 1261
"... a comprehensive account of recent and current research on the pattern-related aspects of set partitions."
-David Callan, Mathematical Reviews, April 2013
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für Beruf und Forschung
Academic
Illustrationen
38 s/w Abbildungen
38 Illustrations, black and white
Maße
Höhe: 234 mm
Breite: 156 mm
Gewicht
ISBN-13
978-1-032-91912-6 (9781032919126)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
Toufik Mansour is a professor in the Department of Mathematics at the University of Haifa. Dr. Mansour has authored/co-authored more than 200 papers and is a reviewer for many journals, including Advances in Applied Mathematics, Discrete Mathematics, Discrete Applied Mathematics, European Journal of Combinatorics, and the Journal of Combinatorial Theory Series A. His research focuses on pattern avoidance in permutations, colored permutations, set partitions, words, and compositions.
Introduction. Basic Tools of the Book. Generating Functions. Preliminary Results on Set Partitions. Subword Statistics on Set Partitions. Nonsubword Statistics on Set Partitions. Avoidance of Patterns in Set Partitions. Multi Restrictions on Set Partitions. Asymptotics and Random Set Partition. Gray Codes, Loopless Algorithms and Set Partitions. Set Partitions and Normal Ordering. Appendices. Bibliography. Index.
