Combinatorics of Compositions and Words

Regular price €272.80
Quantity:
Ships in 10-20 days
Delivery/Collection within 10-20 working days
Shipping & Delivery
A01=Silvia Heubach
A01=Toufik Mansour
Adjacency Matrix
advanced mathematical methods
algorithmic enumeration
asymptotic pattern enumeration in compositions
Author_Silvia Heubach
Author_Toufik Mansour
Block Decomposition
C++
Category=PBD
Category=PBV
Category=UMB
Category=UY
combinatorics
complex analysis
computational combinatorics
Continued Fraction
discrete mathematics
Dyck Path
ECO method
enumerative analysis
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Explicit Formula
Exponential Generating Function
Ferrers Diagrams
fibonacci
Fibonacci Sequence
formal language theory
function
generate
generating
Generating Function
graph
Homogeneous Recurrence Relation
LIF
line
Linear Recurrence Relation
Mathematica Code
number
Ordinary Generating Function
Partition Words
pattern
pattern avoidance
Permutation Patterns
Random Composition
Recurrence Relation
sequence
Silvia Heubach
Standard Young Tableau
Subsequence Patterns
subword
Subword Patterns
Transfer Matrix Method
Wilf equivalence
Young Diagram
Young Tableaux

Product details

  • ISBN 9781420072679
  • Weight: 839g
  • Dimensions: 156 x 234mm
  • Publication Date: 20 Jul 2009
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: GB
  • Product Form: Hardback
Secure checkout Fast Shipping Easy returns

A One-Stop Source of Known Results, a Bibliography of Papers on the Subject, and Novel Research Directions

Focusing on a very active area of research in the last decade, Combinatorics of Compositions and Words provides an introduction to the methods used in the combinatorics of pattern avoidance and pattern enumeration in compositions and words. It also presents various tools and approaches that are applicable to other areas of enumerative combinatorics.

After a historical perspective on research in the area, the text introduces techniques to solve recurrence relations, including iteration and generating functions. It then focuses on enumeration of basic statistics for compositions. The text goes on to present results on pattern avoidance for subword, subsequence, and generalized patterns in compositions and then applies these results to words. The authors also cover automata, the ECO method, generating trees, and asymptotic results via random compositions and complex analysis.

Highlighting both established and new results, this book explores numerous tools for enumerating patterns in compositions and words. It includes a comprehensive bibliography and incorporates the use of the computer algebra systems Maple™ and Mathematica®, as well as C++ to perform computations.

Silvia Heubach is a Professor and the Chair of the Department of Mathematics at the California State University, Los Angeles, where she received the Outstanding Professor Award in 1999/2000.

Toufik Mansour is an Associate Professor at the University of Haifa. The author or co-author of more than 60 papers, Professor Mansour’s general research interest is in discrete mathematics and its applications, with an emphasis on pattern avoidance problems.

More from this author