Discrete Mathematics and Its Applications – serie

Crossing Numbers of Graphs is the first book devoted to the crossing number, an increasingly popular object of study with surprising connections. The field has matured into a large body of work, which includes identifiable core results and techniques. The book presents a wide variety of ideas and techniques in topological graph theory, discrete geometry, and computer science. The first part of the text deals with traditional crossing number, crossing number values, crossing lemma, related parameters, computational complexity, and algorithms. The second part includes the rich history of alternative crossing numbers, the rectilinear crossing number, the pair crossing number, and the independent odd crossing number.It also includes applications of the crossing number outside topological graph theory.Aimed at graduate students and professionals in both mathematics and computer scienceThe first book of its kind devoted to the topicAuthored by a noted authority in crossing numbers

A CHOICE "Outstanding Academic Title," the first edition of this bestseller was lauded for its detailed yet engaging treatment of permutations. Providing more than enough material for a one-semester course, Combinatorics of Permutations, third edition continues to clearly show the usefulness of this subject for both students and researchers.The research in combinatorics of permutations has advanced rapidly since this book was published in a first edition. Now the third edition offers not only updated results, it remains the leading textbook for a course on the topic.Coverage is mostly enumerative, but there are algebraic, analytic, and topological parts as well, and applications.Since the publication of the second edition, there is tremendous progress in pattern avoidance (Chapters 4 and 5). There is also significant progress in the analytic combinatorics of permutations, which will be incorporated. •A completely new technique from extremal combinatorics disproved a long-standing conjecture, and this is presented in Chapter 4. •The area of universal permutations has undergone a lot of very recent progress, and that has been noticed outside the academic community as well. This also influenced the revision of Chapter 5.•New results in stack sorting are added to Chapter 8.•Chapter 9 applications to biology has been revised.The author’s other works include Introduction to Enumerative and Analytic Combinatorics, second edition (CHOICE "Outstanding Academic Title") and Handbook of Enumerative Combinatorics, published by CRC Press. The author also serves as Series Editor for CRC’s Discrete Mathematics and Its Applications.

Volume of geometric objects plays an important role in applied and theoretical mathematics. This is particularly true in the relatively new branch of discrete geometry, where volume is often used to find new topics for research. Volumetric Discrete Geometry demonstrates the recent aspects of volume, introduces problems related to it, and presents methods to apply it to other geometric problems.Part I of the text consists of survey chapters of selected topics on volume and is suitable for advanced undergraduate students. Part II has chapters of selected proofs of theorems stated in Part I and is oriented for graduate level students wishing to learn about the latest research on the topic. Chapters can be studied independently from each other. Provides a list of 30 open problems to promote research Features more than 60 research exercises Ideally suited for researchers and students of combinatorics, geometry and discrete mathematics

50 Years of Combinatorics, Graph Theory, and Computing advances research in discrete mathematics by providing current research surveys, each written by experts in their subjects. The book also celebrates outstanding mathematics from 50 years at the Southeastern International Conference on Combinatorics, Graph Theory & Computing (SEICCGTC). The conference is noted for the dissemination and stimulation of research, while fostering collaborations among mathematical scientists at all stages of their careers. The authors of the chapters highlight open questions. The sections of the book include: Combinatorics; Graph Theory; Combinatorial Matrix Theory; Designs, Geometry, Packing and Covering. Readers will discover the breadth and depth of the presentations at the SEICCGTC, as well as current research in combinatorics, graph theory and computer science.Features: Commemorates 50 years of the Southeastern International Conference on Combinatorics, Graph Theory & Computing with research surveys Surveys highlight open questions to inspire further research Chapters are written by experts in their fields Extensive bibliographies are provided at the end of each chapter

Because of its portability and platform-independence, Java is the ideal computer programming language to use when working on graph algorithms and other mathematical programming problems. Collecting some of the most popular graph algorithms and optimization procedures, A Java Library of Graph Algorithms and Optimization provides the source code for a library of Java programs that can be used to solve problems in graph theory and combinatorial optimization. Self-contained and largely independent, each topic starts with a problem description and an outline of the solution procedure, followed by its parameter list specification, source code, and a test example that illustrates the usage of the code.The book begins with a chapter on random graph generation that examines bipartite, regular, connected, Hamilton, and isomorphic graphs as well as spanning, labeled, and unlabeled rooted trees. It then discusses connectivity procedures, followed by a paths and cycles chapter that contains the Chinese postman and traveling salesman problems, Euler and Hamilton cycles, and shortest paths. The author proceeds to describe two test procedures involving planarity and graph isomorphism. Subsequent chapters deal with graph coloring, graph matching, network flow, and packing and covering, including the assignment, bottleneck assignment, quadratic assignment, multiple knapsack, set covering, and set partitioning problems. The final chapters explore linear, integer, and quadratic programming. The appendices provide references that offer further details of the algorithms and include the definitions of many graph theory terms used in the book.

Researchers and practitioners of cryptography and information security are constantly challenged to respond to new attacks and threats to information systems. Authentication Codes and Combinatorial Designs presents new findings and original work on perfect authentication codes characterized in terms of combinatorial designs, namely strong partially balanced designs (SPBD).Beginning with examples illustrating the concepts of authentication schemes and combinatorial designs, the book considers the probability of successful deceptions followed by schemes involving three and four participants, respectively. From this point, the author constructs the perfect authentication schemes and explores encoding rules for such schemes in some special cases.Using rational normal curves in projective spaces over finite fields, the author constructs a new family of SPBD. He then presents some established combinatorial designs that can be used to construct perfect schemes, such as t-designs, orthogonal arrays of index unity, and designs constructed by finite geometry. The book concludes by studying definitions of perfect secrecy, properties of perfectly secure schemes, and constructions of perfect secrecy schemes with and without authentication.Supplying an appendix of construction schemes for authentication and secrecy schemes, Authentication Codes and Combinatorial Designs points to new applications of combinatorial designs in cryptography.

Enumerative Combinatorics presents elaborate and systematic coverage of the theory of enumeration. The first seven chapters provide the necessary background, including basic counting principles and techniques, elementary enumerative topics, and an extended presentation of generating functions and recurrence relations. The remaining seven chapters focus on more advanced topics, including, Stirling numbers, partitions of integers, partition polynomials, Eulerian numbers and Polya's counting theorem.Extensively classroom tested, this text was designed for introductory- and intermediate-level courses in enumerative combinatorics, but the far-reaching applications of the subject also make the book useful to those in operational research, the physical and social science, and anyone who uses combinatorial methods. Remarks, discussions, tables, and numerous examples support the text, and a wealth of exercises-with hints and answers provided in an appendix--further illustrate the subject's concepts, theorems, and applications.

The practice of modeling is best learned by those armed with fundamental methodologies and exposed to a wide variety of modeling experience. Ideally, this experience could be obtained by working on actual modeling problems. But time constraints often make this difficult. Applied Mathematical Modeling provides a collection of models illustrating the power and richness of the mathematical sciences in supplying insight into the operation of important real-world systems. It fills a gap within modeling texts, focusing on applications across a broad range of disciplines. The first part of the book discusses the general components of the modeling process and highlights the potential of modeling in practice. These chapters discuss the general components of the modeling process, and the evolutionary nature of successful model building. The second part provides a rich compendium of case studies, each one complete with examples, exercises, and projects.In keeping with the multidimensional nature of the models presented, the chapters in the second part are listed in alphabetical order by the contributor's last name. Unlike most mathematical books, in which you must master the concepts of early chapters to prepare for subsequent material, you may start with any chapter. Begin with cryptology, if that catches your fancy, or go directly to bursty traffic if that is your cup of tea.Applied Mathematical Modeling serves as a handbook of in-depth case studies that span the mathematical sciences, building upon a modest mathematical background. Readers in other applied disciplines will benefit from seeing how selected mathematical modeling philosophies and techniques can be brought to bear on problems in their disciplines. The models address actual situations studied in chemistry, physics, demography, economics, civil engineering, environmental engineering, industrial engineering, telecommunications, and other areas.

This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as:Combinations Permutations Graphs Designs Many classical areas are covered as well as new research topics not included in most existing texts, such as: Group algorithms Graph isomorphism Hill-climbing Heuristic search algorithms This work serves as an exceptional textbook for a modern course in combinatorial algorithms, providing a unified and focused collection of recent topics of interest in the area. The authors, synthesizing material that can only be found scattered through many different sources, introduce the most important combinatorial algorithmic techniques - thus creating an accessible, comprehensive text that students of mathematics, electrical engineering, and computer science can understand without needing a prior course on combinatorics.

The first thing you will find out about this book is that it is fun to read. It is meant for the browser, as well as for the student and for the specialist wanting to know about the area. The footnotes give an historical background to the text, in addition to providing deeper applications of the concept that is being cited. This allows the browser to look more deeply into the history or to pursue a given sideline. Those who are only marginally interested in the area will be able to read the text, pick up information easily, and be entertained at the same time by the historical and philosophical digressions. It is rich in structure and motivation in its concentration upon quadratic orders.This is not a book that is primarily about tables, although there are 80 pages of appendices that contain extensive tabular material (class numbers of real and complex quadratic fields up to 104; class group structures; fundamental units of real quadratic fields; and more!). This book is primarily a reference book and graduate student text with more than 200 exercises and a great deal of hints!The motivation for the text is best given by a quote from the Preface of Quadratics: "There can be no stronger motivation in mathematical inquiry than the search for truth and beauty. It is this author's long-standing conviction that number theory has the best of both of these worlds. In particular, algebraic and computational number theory have reached a stage where the current state of affairs richly deserves a proper elucidation. It is this author's goal to attempt to shine the best possible light on the subject."

The interplay continues to grow between graph theory and a wide variety of models and applications in mathematics, computer science, operations research, and the natural and social sciences.Topics in Graph Theory is geared toward the more mathematically mature student. The first three chapters provide the basic definitions and theorems of graph theory and the remaining chapters introduce a variety of topics and directions for research. These topics draw on numerous areas of theoretical and applied mathematics, including combinatorics, probability, linear algebra, group theory, topology, operations research, and computer science. This makes the book appropriate for a first course at the graduate level or as a second course at the undergraduate level.The authors build upon material previously published in Graph Theory and Its Applications, Third Edition, by the same authors. That text covers material for both an undergraduate and graduate course, while this book builds on and expands the graduate-level material.Features Extensive exercises and applications. Flexibility: appropriate for either a first course at the graduate level or an advanced course at the undergraduate level. Opens avenues to a variety of research areas in graph theory. Emphasis on topological and algebraic graph theory.

This book presents methods for the summation of infinite and finite series and the related identities and inversion relations. The summation includes the column sums and row sums of lower triangular matrices. The convergence of the summation of infinite series is considered. The author’s focus is on symbolic methods and the Riordan array approach. In addition, this book contains hundreds summation formulas and identities, which can be used as a handbook for people working in computer science, applied mathematics, and computational mathematics, particularly, combinatorics, computational discrete mathematics, and computational number theory. The exercises at the end of each chapter help deepen understanding.Much of the materials in this book has never appeared before in textbook form. This book can be used as a suitable textbook for advanced courses for high lever undergraduate and lower lever graduate students. It is also an introductory self-study book for re- searchers interested in this field, while some materials of the book can be used as a portal for further research.

This book covers both theoretical and practical results for graph polynomials. Graph polynomials have been developed for measuring combinatorial graph invariants and for characterizing graphs. Various problems in pure and applied graph theory or discrete mathematics can be treated and solved efficiently by using graph polynomials. Graph polynomials have been proven useful areas such as discrete mathematics, engineering, information sciences, mathematical chemistry and related disciplines.

The origins of computation group theory (CGT) date back to the late 19th and early 20th centuries. Since then, the field has flourished, particularly during the past 30 to 40 years, and today it remains a lively and active branch of mathematics.The Handbook of Computational Group Theory offers the first complete treatment of all the fundamental methods and algorithms in CGT presented at a level accessible even to advanced undergraduate students. It develops the theory of algorithms in full detail and highlights the connections between the different aspects of CGT and other areas of computer algebra. While acknowledging the importance of the complexity analysis of CGT algorithms, the authors' primary focus is on algorithms that perform well in practice rather than on those with the best theoretical complexity.Throughout the book, applications of all the key topics and algorithms to areas both within and outside of mathematics demonstrate how CGT fits into the wider world of mathematics and science. The authors include detailed pseudocode for all of the fundamental algorithms, and provide detailed worked examples that bring the theorems and algorithms to life.

This handbook presents a thorough introduction to current topics of mathematical research in combinatorial algebraic geometry. The editors’ aim is to introduce researchers to key literature from the past 20-30 years needed to address open questions in the field. The chapters of Handbook of Combinatorial Algebraic Geometry: Subvarieties of the Flag Variety give concrete, computational examples of Lie-theoretic and combinatorial tools applied to the geometry of flag varieties and their subvarieties. Lie theory provides a common language for the articles in this text, so while chapters are self-contained, it is recommended readers have some prior familiarity with the foundations of the subject. Each chapter benefits multiple sets of readers including:Graduate students seeking to conduct research in algebraic combinatorics and Lie theory. New researchers will be introduced to relevant techniques used to prove key results and gain insight from leading researchers into the context of these results.Experts in the field seeking insights and exposure to techniques and the finer expository points of related topics.Mathematicians looking for a centralized reference on the geometry and combinatorics of flag varieties.The topics of this handbook break down into four sections. The first section of this book consists of an introduction to the cohomology of flag varieties, Schubert varieties, and Schubert polynomials. The second section explores subvarieties of the flag variety that generalize or complement Schubert varieties in various ways. The third section of the book focuses on Hessenberg varieties. Finally, the last section explores additional topics related to flag varieties.Last, the editors include a brief word about a few things this book does not do. Although great care is taken to streamline notation, the avid reader will still find variation throughout the chapters. This is reflective of, and prepares the reader for, the state of the field. For example, different notations for Richardson varieties typically appear in work on positivity than in other subfields of combinatorial algebraic geometry.The editors and contributors hope readers find this book useful and enjoyable.

Graph Theory: An Introduction to Proofs, Algorithms, and ApplicationsGraph theory is the study of interactions, conflicts, and connections. The relationship between collections of discrete objects can inform us about the overall network in which they reside, and graph theory can provide an avenue for analysis.This text, for the first undergraduate course, will explore major topics in graph theory from both a theoretical and applied viewpoint. Topics will progress from understanding basic terminology, to addressing computational questions, and finally ending with broad theoretical results. Examples and exercises will guide the reader through this progression, with particular care in strengthening proof techniques and written mathematical explanations. Current applications and exploratory exercises are provided to further the reader’s mathematical reasoning and understanding of the relevance of graph theory to the modern world.FeaturesThe first chapter introduces graph terminology, mathematical modeling using graphs, and a review of proof techniques featured throughout the book The second chapter investigates three major route problems: eulerian circuits, hamiltonian cycles, and shortest paths. The third chapter focuses entirely on trees – terminology, applications, and theory. Four additional chapters focus around a major graph concept: connectivity, matching, coloring, and planarity. Each chapter brings in a modern application or approach. Hints and Solutions to selected exercises provided at the back of the book.AuthorKarin R. Saoub is an Associate Professor of Mathematics at Roanoke College in Salem, Virginia. She earned her PhD in mathematics from Arizona State University and BA from Wellesley College. Her research focuses on graph coloring and on-line algorithms applied to tolerance graphs. She is also the author of A Tour Through Graph Theory, published by CRC Press.

This book is the very first one in the English language entirely dedicated to the Lambert W function, its generalizations, and its applications. One goal is to promote future research on the topic. The book contains all the information one needs when trying to find a result. The most important formulas and results are framed. The Lambert W function is a multi-valued inverse function with plenty of applications in areas like molecular physics, relativity theory, fuel consumption models, plasma physics, analysis of epidemics, bacterial growth models, delay differential equations, fluid mechanics, game theory, statistics, study of magnetic materials, and so on.The first part of the book gives a full treatise of the W function from theoretical point of view.The second part presents generalizations of this function which have been introduced by the need of applications where the classical W function is insufficient.The third part presents a large number of applications from physics, biology, game theory, bacterial cell growth models, and so on.The second part presents the generalized Lambert functions based on the tools we had developed in the first part. In the third part familiarity with Newtonian physics will be useful. The text is written to be accessible for everyone with only basic knowledge on calculus and complex numbers. Additional features include the Further Notes sections offering interesting research problems and information for further studies. Mathematica codes are included.The Lambert function is arguably the simplest non-elementary transcendental function out of the standard set of sin, cos, log, etc., therefore students who would like to deepen their understanding of real and complex analysis can see a new “almost elementary” function on which they can practice their knowledge.

Additive Combinatorics: A Menu of Research Problems is the first book of its kind to provide readers with an opportunity to actively explore the relatively new field of additive combinatorics. The author has written the book specifically for students of any background and proficiency level, from beginners to advanced researchers. It features an extensive menu of research projects that are challenging and engaging at many different levels. The questions are new and unsolved, incrementally attainable, and designed to be approachable with various methods. The book is divided into five parts which are compared to a meal. The first part is called Ingredients and includes relevant background information about number theory, combinatorics, and group theory. The second part, Appetizers, introduces readers to the book’s main subject through samples. The third part, Sides, covers auxiliary functions that appear throughout different chapters. The book’s main course, so to speak, is Entrees: it thoroughly investigates a large variety of questions in additive combinatorics by discussing what is already known about them and what remains unsolved. These include maximum and minimum sumset size, spanning sets, critical numbers, and so on. The final part is Pudding and features numerous proofs and results, many of which have never been published. Features: The first book of its kind to explore the subject Students of any level can use the book as the basis for research projects The text moves gradually through five distinct parts, which is suitable both for beginners without prerequisites and for more advanced students Includes extensive proofs of propositions and theorems Each of the introductory chapters contains numerous exercises to help readers

The Art of Proving Binomial Identities accomplishes two goals: (1) It provides a unified treatment of the binomial coefficients, and (2) Brings together much of the undergraduate mathematics curriculum via one theme (the binomial coefficients). The binomial coefficients arise in a variety of areas of mathematics: combinatorics, of course, but also basic algebra (binomial theorem), infinite series (Newton’s binomial series), differentiation (Leibniz’s generalized product rule), special functions (the beta and gamma functions), probability, statistics, number theory, finite difference calculus, algorithm analysis, and even statistical mechanics. The book is very suitable for advanced undergraduates or beginning graduate students and includes various exercises asking them to prove identities. Students will find that the text and notes at the end of the chapters encourages them to look at binomial coefficients from different angles. With this learning experience, students will be able to understand binomial coefficients in a new way. Features: Provides a unified treatment of many of the techniques for proving binomial coefficient identities. Ties together several of the courses in the undergraduate mathematics curriculum via a single theme. A textbook for a capstone or senior seminar course in mathematics. Contains several results by the author on proof techniques for binomial coefficients that are not well-known. Ideal for self-study, it contains a large number of exercises at the end of each chapter, with hints or solutions for every exercise at the end of the book.

The first thing you will find out about this book is that it is fun to read. It is meant for the browser, as well as for the student and for the specialist wanting to know about the area. The footnotes give an historical background to the text, in addition to providing deeper applications of the concept that is being cited. This allows the browser to look more deeply into the history or to pursue a given sideline. Those who are only marginally interested in the area will be able to read the text, pick up information easily, and be entertained at the same time by the historical and philosophical digressions. It is rich in structure and motivation in its concentration upon quadratic orders.This is not a book that is primarily about tables, although there are 80 pages of appendices that contain extensive tabular material (class numbers of real and complex quadratic fields up to 104; class group structures; fundamental units of real quadratic fields; and more!). This book is primarily a reference book and graduate student text with more than 200 exercises and a great deal of hints!The motivation for the text is best given by a quote from the Preface of Quadratics: "There can be no stronger motivation in mathematical inquiry than the search for truth and beauty. It is this author's long-standing conviction that number theory has the best of both of these worlds. In particular, algebraic and computational number theory have reached a stage where the current state of affairs richly deserves a proper elucidation. It is this author's goal to attempt to shine the best possible light on the subject."

This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as:Combinations Permutations Graphs Designs Many classical areas are covered as well as new research topics not included in most existing texts, such as: Group algorithms Graph isomorphism Hill-climbing Heuristic search algorithms This work serves as an exceptional textbook for a modern course in combinatorial algorithms, providing a unified and focused collection of recent topics of interest in the area. The authors, synthesizing material that can only be found scattered through many different sources, introduce the most important combinatorial algorithmic techniques - thus creating an accessible, comprehensive text that students of mathematics, electrical engineering, and computer science can understand without needing a prior course on combinatorics.

Cryptography, in particular public-key cryptography, has emerged in the last 20 years as an important discipline that is not only the subject of an enormous amount of research, but provides the foundation for information security in many applications. Standards are emerging to meet the demands for cryptographic protection in most areas of data communications. Public-key cryptographic techniques are now in widespread use, especially in the financial services industry, in the public sector, and by individuals for their personal privacy, such as in electronic mail. This Handbook will serve as a valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography. It is a necessary and timely guide for professionals who practice the art of cryptography. The Handbook of Applied Cryptography provides a treatment that is multifunctional:It serves as an introduction to the more practical aspects of both conventional and public-key cryptography It is a valuable source of the latest techniques and algorithms for the serious practitioner It provides an integrated treatment of the field, while still presenting each major topic as a self-contained unit It provides a mathematical treatment to accompany practical discussions It contains enough abstraction to be a valuable reference for theoreticians while containing enough detail to actually allow implementation of the algorithms discussedNow in its third printing, this is the definitive cryptography reference that the novice as well as experienced developers, designers, researchers, engineers, computer scientists, and mathematicians alike will use.

The demand for digital speech coding algorithms grows every day, fueled by applications such as streaming speech over the Internet, Internet telephone, digital cellular telephony, wireless teleconferencing, and various multimedia applications. Until now, most of the books available on audio coding have been collections of individually authored papers. Others have discussed the fundamental coders, but neglected many of the innovations currently in use. Unlike these books, A Practical Handbook of Speech Coders offers in-depth treatment of the basics of speech coding plus the innovations to the basic methods that make the coders useful and efficient.The authors designed this work for engineers, scientists, and manager who need to understand the emerging speech coding techniques and telecommunication standards. However, it will prove useful to people at all levels of speech coder experience:If you want to simply download the code for an existing algorithm, this book helps you evaluate the strengths and weaknesses of all publicly available codes and choose the right one, then points you to the Internet location where the code is available for download. For experts who want to improve on existing coders, this book provides the parameters of current coders and the techniques to improve upon them. You can download an existing algorithm or code it using the algorithmic descriptions in the book, make your innovations, and then test the code with the procedures given. If you want to become an expert and have some basic knowledge of digital signal processing, you can learn the innovative steps taken by the inventor of each coder, explore the rigorous research techniques needed to develop your own coder, and become proficient in existing vocoder technology.

Ramsey theory is a fascinating topic. The author shares his view of the topic in this contemporary overview of Ramsey theory. He presents from several points of view, adding intuition and detailed proofs, in an accessible manner unique among most books on the topic. This book covers all of the main results in Ramsey theory along with results that have not appeared in a book before.The presentation is comprehensive and reader friendly. The book covers integer, graph, and Euclidean Ramsey theory with many proofs being combinatorial in nature. The author motivates topics and discussion, rather than just a list of theorems and proofs. In order to engage the reader, each chapter has a section of exercises.This up-to-date book introduces the field of Ramsey theory from several different viewpoints so that the reader can decide which flavor of Ramsey theory best suits them. Additionally, the book offers: A chapter providing different approaches to Ramsey theory, e.g., using topological dynamics, ergodic systems, and algebra in the Stone-Čech compactification of the integers. A chapter on the probabilistic method since it is quite central to Ramsey-type numbers. A unique chapter presenting some applications of Ramsey theory. Exercises in every chapterThe intended audience consists of students and mathematicians desiring to learn about Ramsey theory. An undergraduate degree in mathematics (or its equivalent for advanced undergraduates) and a combinatorics course is assumed. TABLE OF CONENTSPrefaceList of FiguresList of TablesSymbols1. Introduction2. Integer Ramsey Theory3. Graph Ramsey Theory4. Euclidean Ramsey Theory 5. Other Approaches to Ramsey Theory 6. The Probabilistic Method 7. Applications Bibliography IndexBiographyAaron Robertson received his Ph.D. in mathematics from Temple University under the guidance of his advisor Doron Zeilberger. Upon finishing his Ph.D. he started at Colgate University in upstate New York where he is currently Professor of Mathematics. He also serves as Associate Managing editor of the journal Integers. After a brief detour into the world of permutation patterns, he has focused most of his research on Ramsey theory.

This book presents methods for the summation of infinite and finite series and the related identities and inversion relations. The summation includes the column sums and row sums of lower triangular matrices. The convergence of the summation of infinite series is considered. The author’s focus is on symbolic methods and the Riordan array approach. In addition, this book contains hundreds summation formulas and identities, which can be used as a handbook for people working in computer science, applied mathematics, and computational mathematics, particularly, combinatorics, computational discrete mathematics, and computational number theory. The exercises at the end of each chapter help deepen understanding.Much of the materials in this book has never appeared before in textbook form. This book can be used as a suitable textbook for advanced courses for high lever undergraduate and lower lever graduate students. It is also an introductory self-study book for re- searchers interested in this field, while some materials of the book can be used as a portal for further research.

This book is the very first one in the English language entirely dedicated to the Lambert W function, its generalizations, and its applications. One goal is to promote future research on the topic. The book contains all the information one needs when trying to find a result. The most important formulas and results are framed. The Lambert W function is a multi-valued inverse function with plenty of applications in areas like molecular physics, relativity theory, fuel consumption models, plasma physics, analysis of epidemics, bacterial growth models, delay differential equations, fluid mechanics, game theory, statistics, study of magnetic materials, and so on.The first part of the book gives a full treatise of the W function from theoretical point of view.The second part presents generalizations of this function which have been introduced by the need of applications where the classical W function is insufficient.The third part presents a large number of applications from physics, biology, game theory, bacterial cell growth models, and so on.The second part presents the generalized Lambert functions based on the tools we had developed in the first part. In the third part familiarity with Newtonian physics will be useful. The text is written to be accessible for everyone with only basic knowledge on calculus and complex numbers. Additional features include the Further Notes sections offering interesting research problems and information for further studies. Mathematica codes are included.The Lambert function is arguably the simplest non-elementary transcendental function out of the standard set of sin, cos, log, etc., therefore students who would like to deepen their understanding of real and complex analysis can see a new “almost elementary” function on which they can practice their knowledge.

A CHOICE "Outstanding Academic Title," the first edition of this bestseller was lauded for its detailed yet engaging treatment of permutations. Providing more than enough material for a one-semester course, Combinatorics of Permutations, third edition continues to clearly show the usefulness of this subject for both students and researchers.The research in combinatorics of permutations has advanced rapidly since this book was published in a first edition. Now the third edition offers not only updated results, it remains the leading textbook for a course on the topic.Coverage is mostly enumerative, but there are algebraic, analytic, and topological parts as well, and applications.Since the publication of the second edition, there is tremendous progress in pattern avoidance (Chapters 4 and 5). There is also significant progress in the analytic combinatorics of permutations, which will be incorporated. •A completely new technique from extremal combinatorics disproved a long-standing conjecture, and this is presented in Chapter 4. •The area of universal permutations has undergone a lot of very recent progress, and that has been noticed outside the academic community as well. This also influenced the revision of Chapter 5.•New results in stack sorting are added to Chapter 8.•Chapter 9 applications to biology has been revised.The author’s other works include Introduction to Enumerative and Analytic Combinatorics, second edition (CHOICE "Outstanding Academic Title") and Handbook of Enumerative Combinatorics, published by CRC Press. The author also serves as Series Editor for CRC’s Discrete Mathematics and Its Applications.

This award-winning textbook targets the gap between introductory texts in discrete mathematics and advanced graduate texts in enumerative combinatorics. The author’s goal is to make combinatorics more accessible to encourage student interest and to expand the number of students studying this rapidly expanding field.The book first deals with basic counting principles, compositions and partitions, and generating functions. It then focuses on the structure of permutations, graph enumeration, and extremal combinatorics. Lastly, the text discusses supplemental topics, including error-correcting codes, properties of sequences, and magic squares.Updates to the Third Edition include:Quick Check exercises at the end of each section, which are typically easier than the regular exercises at the end of each chapter.A new section discussing the Lagrange Inversion Formula and its applications, strengthening the analytic flavor of the book.An extended section on multivariate generating functions.Numerous exercises contain material not discussed in the text allowing instructors to extend the time they spend on a given topic. A chapter on analytic combinatorics and sections on advanced applications of generating functions, demonstrating powerful techniques that do not require the residue theorem or complex integration, and extending coverage of the given topics are highlights of the presentation.The second edition was recognized as an Outstanding Academic Title of the Year by Choice Magazine, published by the American Library Association.

Analytic Combinatorics: A Multidimensional Approach is written in a reader-friendly fashion to better facilitate the understanding of the subject. Naturally, it is a firm introduction to the concept of analytic combinatorics and is a valuable tool to help readers better understand the structure and large-scale behavior of discrete objects. Primarily, the textbook is a gateway to the interactions between complex analysis and combinatorics. The study will lead readers through connections to number theory, algebraic geometry, probability and formal language theory. The textbook starts by discussing objects that can be enumerated using generating functions, such as tree classes and lattice walks. It also introduces multivariate generating functions including the topics of the kernel method, and diagonal constructions. The second part explains methods of counting these objects, which involves deep mathematics coming from outside combinatorics, such as complex analysis and geometry. Features Written with combinatorics-centric exposition to illustrate advanced analytic techniques Each chapter includes problems, exercises, and reviews of the material discussed in them Includes a comprehensive glossary, as well as lists of figures and symbols About the author Marni Mishna is a professor of mathematics at Simon Fraser University in British Columbia. Her research investigates interactions between discrete structures and many diverse areas such as representation theory, functional equation theory, and algebraic geometry. Her specialty is the development of analytic tools to study the large-scale behavior of discrete objects.