Bild 1 von 18
Standardbild
Bild 1 von 18
Standardbild
Discrete Mathematics and Its Applications Ser.: Introduction to Enumerative and Analytic Combinatorics by Miklos Bona (2015, Hardcover)
8
8610elliott (1765)
100% positive Bewertungen
Preis:
US $82,08
(inkl. MwSt.)
Ca.CHF 65,50
+ $31,36 Versand
Rücknahme:
30 Tage Rückgabe. Käufer zahlt Rückversand. Wenn Sie ein eBay-Versandetikett verwenden, werden die Kosten dafür von Ihrer Rückerstattung abgezogen.
Artikelzustand:
- Sofort-KaufenEinführung in die enumerative und analytische Kombinatorik von Miklos Bona - SFB HC
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Über dieses Produkt
Product Identifiers
PublisherCRC Press LLC
ISBN-10148224909X
ISBN-139781482249095
eBay Product ID (ePID)22038395963
Product Key Features
Number of Pages534 Pages
Publication NameIntroduction to Enumerative and Analytic Combinatorics
LanguageEnglish
SubjectOperating Systems / General, General, Combinatorics
Publication Year2015
TypeTextbook
Subject AreaMathematics, Computers
AuthorMiklos Bona
SeriesDiscrete Mathematics and Its Applications Ser.
FormatHardcover
Dimensions
Item Height1.4 in
Item Weight32.8 Oz
Item Length9.4 in
Item Width7 in
Additional Product Features
Edition Number2
Intended AudienceCollege Audience
LCCN2015-452886
ReviewsBona'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 us 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, "Miklós Bóna has done a masterful job of bringing an overview of all of enumerative combinatorics within reach of undergraduates. The two fundamental themes of bijective proofs and generating functions, together with their intimate connections, recur constantly. A wide selection of topics, including several never appearing before in a textbook, is included that gives an idea of the vast range of enumerative combinatorics. In particular, for those with sufficient background in undergraduate linear algebra and abstract algebra, there are many tantalizing hints of the fruitful connection between enumerative combinatorics and algebra that play a central role in the subject of algebraic combinatorics." --From the Foreword to the First Edition by Richard Stanley, Cambridge, Massachusetts, USA
Dewey Edition23
IllustratedYes
Dewey Decimal511/.62
Table Of ContentMETHODS Basic methods When we add and when we subtract When we multiply When we divide Applications of basic counting principles The pigeonhole principle Notes Chapter review Exercises Solutions to exercises Supplementary exercises Applications of basic methods Multisets and compositions Set partitions Partitions of integers The inclusion-exclusion principle The twelvefold way Notes Chapter review Exercises Solutions to exercises Supplementary exercises Generating functions Power series Warming up: Solving recurrence relations Products of generating functions Compositions of generating functions A different type of generating functions Notes Chapter review Exercises Solutions to exercises Supplementary exercises TOPICS Counting permutations Eulerian numbers The cycle structure of permutations Cycle structure and exponential generating functions Inversions Advanced applications of generating functions to permutation enumeration Notes Chapter review Exercises Solutions to exercises Supplementary exercises Counting graphs Trees and forests Graphs and functions When the vertices are not freely labeled Graphs on colored vertices Graphs and generating functions Notes Chapter review Exercises Solutions to exercises Supplementary exercises Extremal combinatorics Extremal graph theory Hypergraphs Something is more than nothing: Existence proofs Notes Chapter review Exercises Solutions to exercises Supplementary exercises AN ADVANCED METHOD Analytic combinatorics Exponential growth rates Polynomial precision More precise asymptotics Notes Chapter review Exercises Solutions to exercises Supplementary exercises SPECIAL TOPICS Symmetric structures Designs Finite projective planes Error-correcting codes Counting symmetric structures Notes Chapter review Exercises Solutions to exercises Supplementary exercises Sequences in combinatorics Unimodality Log-concavity The real zeros property Notes Chapter review Exercises Solutions to exercises Supplementary exercises Counting magic squares and magic cubes A distribution problem Magic squares of fixed size Magic squares of fixed line sum Why magic cubes are different Notes Chapter review Exercises Solutions to exercises Supplementary exercises Appendix: The method of mathematical induction Weak induction Strong induction
SynopsisIntroduction 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.
LC Classification NumberQA164.8
