Mansour Combinatorics of Set Partitions

1. Auflage 2013
ISBN: 978-1-4398-6334-3
Verlag: Taylor & Francis
Format: PDF
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)

E-Book, Englisch, 516 Seiten

Reihe: Discrete Mathematics and Its Applications

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™ 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.

Zielgruppe

Researchers and graduate students in combinatorics, discrete mathematics, and computer science.

Autoren/Hrsg.

Mansour, Toufik

Fachgebiete

• Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik

Inhaltsverzeichnis

Introduction
Historical Overview and Earliest Results
Timeline of Research for Set Partitions
A More Detailed Book

Basic Tools of the Book
Sequences
Solving Recurrence Relations

Generating Functions
Lagrange Inversion Formula
The Principle of Inclusion and Exclusion
Generating Trees

Preliminary Results on Set Partitions
Dobinski’s Formula
Different Representations

Subword Statistics on Set Partitions
Subword Patterns of Size Two: Rises, Levels and Descents
Peaks and Valleys
Subword Patterns: l-Rises, l-Levels, and l-Descents
Families of Subword Patterns
Patterns of Size Three

Nonsubword Statistics on Set Partitions
Statistics and Block Representation
Statistics and Canonical and Rook Representations
Records and Weak Records
Number of Positions between Adjacent Occurrences of a Letter
The Internal Statistic
Statistics and Generalized Patterns
Major Index
Number of Crossings, Nestings and Alignments

Avoidance of Patterns in Set Partitions
History and Connections
Avoidance of Subsequence Patterns
Generalized Patterns
Partially Ordered Patterns

Multi Restrictions on Set Partitions
Avoiding a Pattern of Size Three and Another Pattern
Pattern Avoidance in Noncrossing Set Partitions
General Equivalences
Two Patterns of Size Four
Left Motzkin Numbers
Sequence A054391
Catalan and Generalized Catalan Numbers
Pell Numbers
Regular Set Partitions
Distance Restrictions
Singletons
Block-Connected

Asymptotics and Random Set Partition
Tools from Probability Theory
Tools from Complex Analysis
Z-Statistics
Set Partitions as Geometric Words
Asymptotics for Set Partitions

Gray Codes, Loopless Algorithms and Set Partitions
Gray Code and Loopless Algorithms
Gray Codes for Pn
Loopless Algorithm for Generating Pn

Set Partitions and Normal Ordering
Preliminaries
Linear Representation and N((a†a)n)
Wick’s Theorem and q-Normal Ordering
p-Normal Ordering
Noncrossing Normal Ordering

Appendices
Bibliography
Index

Exercises, Research Directions, and Open Problems appear at the end of each chapter.

Über Autor(innen)

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.