Cantitate/Preț
Produs

Introduction to Enumerative and Analytic Combinatorics: Discrete Mathematics and Its Applications

Autor Miklos Bona
en Limba Engleză Hardback – 2 oct 2015
Introduction to Enumerative and Analytic Combinatorics fills the gap between introductory texts in discrete mathematics and advanced graduate texts in enumerative combinatorics. 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.
Strengthening the analytic flavor of the book, this Second Edition:
  • Features a new chapter on analytic combinatorics and new sections on advanced applications of generating functions
  • Demonstrates powerful techniques that do not require the residue theorem or complex integration
  • Adds new exercises to all chapters, significantly extending coverage of the given topics
Introduction to Enumerative and Analytic Combinatorics, Second Edition makes combinatorics more accessible, increasing interest in this rapidly expanding field.
Outstanding Academic Title of the Year, Choice magazine, American Library Association.
 
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 35166 lei  43-57 zile
  CRC Press – 14 oct 2024 35166 lei  43-57 zile
Hardback (1) 67322 lei  43-57 zile
  CRC Press – 2 oct 2015 67322 lei  43-57 zile

Din seria Discrete Mathematics and Its Applications

Preț: 67322 lei

Preț vechi: 79203 lei
-15% Nou

Puncte Express: 1010

Preț estimativ în valută:
12884 13383$ 10702£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781482249095
ISBN-10: 148224909X
Pagini: 556
Ilustrații: 147
Dimensiuni: 156 x 234 x 30 mm
Greutate: 0.93 kg
Ediția:Revised
Editura: CRC Press
Colecția Chapman and Hall/CRC
Seria Discrete Mathematics and Its Applications

Locul publicării:Boca Raton, United States

Public țintă

Postgraduate

Cuprins

Basic methods. Applications of basic methods. Generating functions. Counting permutations. Counting graphs. Extremal combinatorics. Analytic combinatorics. Symmetric structures. Sequences in combinatorics. Counting magic squares and magic cubes. Appendix: The method of mathematical induction.

Notă biografică

Miklós Bóna received his Ph.D in mathematics from the Massachusetts Institute of Technology in 1997. Since 1999, he has taught at the University of Florida, where, in 2010, he was inducted into the Academy of Distinguished Teaching Scholars. Professor Bóna has mentored numerous graduate and undergraduate students. He is the author of four books and more than 65 research articles, mostly focusing on enumerative and analytic combinatorics. His book, Combinatorics of Permutations, won a 2006 Outstanding Title Award from Choice, the journal of the American Library Association. He is also an editor-in-chief for the Electronic Journal of Combinatorics, and for two book series at CRC Press.

Recenzii

Bona's work is a superb text for any reader learning the vast topic of combinatorics. It includes a well-written description of the fundamentals of combinatorics and several chapters of applications. Each chapter concludes with a list of important formulas available for future reference and a lengthy list of exercises. These exercises are quite comprehensive in that they include a wide range of topics, many exploring other interesting topics unexplained in the text. Most of these exercises are accompanied by complete, well-explained solutions to assist struggling readers. One of the best aspects of the book is the conversational tone in which it is written. When reading through the numerous proofs in the text, readers will feel as though they are actually in the classroom with Bona (Univ. of Florida). His explanations are clear and concise, and his dry humor is both entertaining and essential to the text's development. People spreading rumors, wearing colorful hats, and embarking on hazardous vacations are much more enjoyable to count than indistinguishable balls in jars. This work is an excellent addition to the combinatorics library.
--A. Misseldine, Southern Utah University


Descriere

This book fills the gap between introductory texts in discrete mathematics and advanced graduate texts in enumerative combinatorics. The text 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 book discusses supplemental topics, including error-correcting codes, properties of sequences, and magic squares. The second edition adds a new chapter on analytic combinatorics, new sections on advanced applications of generating functions, and new exercises to all chapters.