Combinatorics and Number Theory of Counting Sequences : Discrete Mathematics and Its Applications - Istvan Mezo
eTextbook alternate format product

Instant online reading.
Don't wait for delivery!

Combinatorics and Number Theory of Counting Sequences

By: Istvan Mezo

Paperback | 21 January 2023

At a Glance

Paperback


RRP $96.99

$82.95

14%OFF

or 4 interest-free payments of $20.74 with

 or 

Available for Backorder. We will order this from our supplier however there isn't a current ETA.

Combinatorics and Number Theory of Counting Sequences is an introduction to the theory of finite set partitions and to the enumeration of cycle decompositions of permutations.



The presentation prioritizes elementary enumerative proofs. Therefore, parts of the book are designed so that even those high school students and teachers who are interested in combinatorics can have the benefit of them. Still, the book collects vast, up-to-date information for many counting sequences (especially, related to set partitions and permutations), so it is a must-have piece for those mathematicians who do research on enumerative combinatorics.



In addition, the book contains number theoretical results on counting sequences of set partitions and permutations, so number theorists who would like to see nice applications of their area of interest in combinatorics will enjoy the book, too.



Features







  • The Outlook sections at the end of each chapter guide the reader towards topics not covered in the book, and many of the Outlook items point towards new research problems.






  • An extensive bibliography and tables at the end make the book usable as a standard reference.






  • Citations to results which were scattered in the literature now become easy, because huge parts of the book (especially in parts II and III) appear in book form for the first time.




Industry Reviews

This book provides an interesting introduction to combinatorics by employing number-theoretic techniques of counting sequences. The level of the presentation often seems elementary, as the author frequently throws out lagniappes suitable for high school students. The text unfolds in three parts. Part 1 covers set partitions, generating functions, Bell polynomials, log-concavity, log-convexity, Bernoulli and Cauchy numbers, ordered partitions, asymptotes, and related inequalities. Part 2 discusses generalizations of counting sequences in three chapters. The final part considers number theoretical properties, including congruences, by way of finite field methods and Diophantine results. Each chapter concludes with an "Outlook" section that gives suggestions about exploring additional topics not covered in the text. Mathematical proof is used throughout the exposition and tends to be "enumerative," again contributing to a sense that the author hopes to engage mathematical novices through this text. However, the more than 250 exercises included in the book are frequently challenging and always interesting. The bibliography comprises more than 600 entries. Anyone who can follow the text is likely to enjoy working through the book.
-D. P. Turner, Faulkner University

More in Mathematical Logic

The Language of Mathematics : The Stories behind the Symbols - Raul Rojas
The Univalence Principle - Benedikt Ahrens

RRP $219.00

$197.25

10%
OFF
Partial Truths : How Fractions Distort Our Thinking - James C. Zimring
Polygraphs : From Rewriting to Higher Categories - Albert  Burroni
Mathematical Intelligence : What We Have that Machines Don't - Junaid Mubeen