Provides a wide ranging introduction to partitions, accessible to any reader familiar with polynomials and infinite series.

The theory of integer partitions is a subject of enduring interest as well as a major research area. It has found numerous applications, including celebrated results such as the Rogers-Ramanujan identities. The aim of this introductory textbook is to provide an accessible and wide-ranging introduction to partitions, without requiring anything more than some familiarity with polynomials and infinite series. Many exercises are included, together with some solutions and helpful hints.

Discusses mathematics related to partitions of numbers into sums of positive integers.

Ramanujan is recognized as one of the great number theorists of the twentieth century. Here now is the first book to provide an introduction to his work in number theory. Most of Ramanujan's work in number theory arose out of $q$-series and theta functions. This book provides an introduction to these two important subjects and to some of the topics in number theory that are inextricably intertwined with them, including the theory of partitions, sums of squares and triangular numbers, and the Ramanujan tau function. The majority of the results discussed here are originally due to Ramanujan or were rediscovered by him. Ramanujan did not leave us proofs of the thousands of theorems he recorded in his notebooks, and so it cannot be claimed that many of the proofs given in this book are those found by Ramanujan. However, they are all in the spirit of his mathematics. The subjects examined in this book have a rich history dating back to Euler and Jacobi, and they continue to be focal points of contemporary mathematical research. Therefore, at the end of each of the seven chapters, Berndt discusses the results established in the chapter and places them in both historical and contemporary contexts. The book is suitable for advanced undergraduates and beginning graduate students interested in number theory.

This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach. The text began as a set of lecture notes for the discrete mathematics course at the University of Northern Colorado. This course serves both as an introduction to topics in discrete math and as the "introduction to proof" course for math majors. The course is usually taught with a large amount of student inquiry, and this text is written to help facilitate this. Four main topics are covered: counting, sequences, logic, and graph theory. Along the way proofs are introduced, including proofs by contradiction, proofs by induction, and combinatorial proofs. The book contains over 360 exercises, including 230 with solutions and 130 more involved problems suitable for homework. There are also Investigate! activities throughout the text to support active, inquiry based learning. While there are many fine discrete math textbooks available, this text has the following advantages: It is written to be used in an inquiry rich course. It is written to be used in a course for future math teachers. It is open source, with low cost print editions and free electronic editions.

Additive combinatorics is the theory of counting additive structures in sets. This theory has seen exciting developments and dramatic changes in direction in recent years thanks to its connections with areas such as number theory, ergodic theory and graph theory. This graduate-level 2006 text will allow students and researchers easy entry into this fascinating field. Here, the authors bring together in a self-contained and systematic manner the many different tools and ideas that are used in the modern theory, presenting them in an accessible, coherent, and intuitively clear manner, and providing immediate applications to problems in additive combinatorics. The power of these tools is well demonstrated in the presentation of recent advances such as Szemerédi's theorem on arithmetic progressions, the Kakeya conjecture and Erdos distance problems, and the developing field of sum-product estimates. The text is supplemented by a large number of exercises and new results.

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

''In writing this book, care was taken to use language and examples that gradually wean students from a simpleminded mechanical approach and move them toward mathematical maturity. We also recognize that many students who hesitate to ask for help from an instructor need a readable text, and we have tried to anticipate the questions that go unasked. The wide range of examples in the text are meant to augment the "favorite examples" that most instructors have for teaching the topcs in discrete mathematics. To provide diagnostic help and encouragement, we have included solutions and/or hints to the odd-numbered exercises. These solutions include detailed answers whenever warranted and complete proofs, not just terse outlines of proofs. Our use of standard terminology and notation makes Applied Discrete Structures a valuable reference book for future courses. Although many advanced books have a short review of elementary topics, they cannot be complete. The text is divided into lecture-length sections, facilitating the organization of an instructor's presentation.Topics are presented in such a way that students' understanding can be monitored through thought-provoking exercises. The exercises require an understanding of the topics and how they are interrelated, not just a familiarity with the key words. An Instructor's Guide is available to any instructor who uses the text. It includes: Chapter-by-chapter comments on subtopics that emphasize the pitfalls to avoid; Suggested coverage times; Detailed solutions to most even-numbered exercises; Sample quizzes, exams, and final exams. This textbook has been used in classes at Casper College (WY), Grinnell College (IA), Luzurne Community College (PA), University of the Puget Sound (WA).''--

Partitions, q-Series, and Modular Forms contains a collection of research and survey papers that grew out of a Conference on Partitions, q-Series and Modular Forms at the University of Florida, Gainesville in March 2008. It will be of interest to researchers and graduate students that would like to learn of recent developments in the theory of q-series and modular and how it relates to number theory, combinatorics and special functions.