Cantitate/Preț
Produs

A Course in Enumeration: Graduate Texts in Mathematics, cartea 238

Autor Martin Aigner
en Limba Engleză Hardback – 26 iun 2007

Ne-a atras atenția modul în care A Course in Enumeration reușește să transforme o disciplină adesea aridă într-o narațiune matematică fluidă. Această lucrare, publicată în seria Graduate Texts in Mathematics, aduce o perspectivă proaspătă asupra combinatoricii enumerative prin integrarea unor conexiuni neașteptate cu fizica statistică și algebra superioară. Notăm cu interes structura tripartită — Noțiuni de bază, Metode și Teme — care permite o tranziție graduală de la coeficienții fundamentali și matrici infinite către subiecte complexe precum funcțiile simetrice.

Putem afirma că stilul lui Martin Aigner rămâne fidel eleganței demonstrate în celebra sa lucrare Proofs from THE BOOK. Dacă în volumele anterioare, precum Markov's Theorem and 100 Years of the Uniqueness Conjecture, autorul se concentra pe profunzimea teoriei numerelor, aici el prioritizează accesibilitatea fără a sacrifica rigoarea academică. Fiecare capitol se încheie cu un „highlight”, o prezentare a unui rezultat matematic remarcabil, oferind cititorului o viziune de ansamblu asupra frumuseții domeniului.

Ca alternativă la Enumerative Combinatorics de Charalambos A. Charalambides pentru cursurile de algebră și combinatorică, volumul lui Aigner vine cu avantajul unei abordări mai moderne și a unui aparat pedagogic impresionant, ce include 666 de exerciții calibrate pentru nivelul universitar. În timp ce Notes on Counting: An Introduction to Enumerative Combinatorics de Peter J. Cameron servește ca o introducere succintă, A Course in Enumeration oferă o explorare mult mai detaliată a metodelor de sumare hipergeometrică și a metodelor sitei, fiind o resursă superioară pentru studiul aprofundat.

Citește tot Restrânge

Din seria Graduate Texts in Mathematics

Preț: 52586 lei

Preț vechi: 61866 lei
-15%

Puncte Express: 789

Carte tipărită la comandă

Livrare economică 27 mai-10 iunie


Specificații

ISBN-13: 9783540390329
ISBN-10: 3540390324
Pagini: 576
Ilustrații: X, 565 p. 55 illus.
Dimensiuni: 155 x 235 x 42 mm
Greutate: 0.96 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Graduate Texts in Mathematics

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Academic/professional/technical: Undergraduate

De ce să citești această carte

Recomandăm această carte studenților la matematică și informatică ce doresc să stăpânească tehnicile de numărare și generare. Veți câștiga o înțelegere profundă a structurilor discrete prin intermediul celor 666 de exerciții și al demonstrațiilor de o claritate excepțională. Este un instrument esențial pentru pregătirea în cercetare, oferind punți de legătură între combinatorică și modelele din fizica teoretică.


Descriere scurtă

Combinatorial enumeration is a readily accessible subject full of easily stated, but sometimes tantalizingly difficult problems. This book leads the reader in a leisurely way from the basic notions to a variety of topics, ranging from algebra to statistical physics. Its aim is to introduce the student to a fascinating field, and to be a source of information for the professional mathematician who wants to learn more about the subject. The book is organized in three parts: Basics, Methods, and Topics. There are 666 exercises, and as a special feature every chapter ends with a highlight, discussing a particularly beautiful or famous result.

Cuprins

Basics.- Fundamental Coefficients.- Formal Series and Infinite Matrices.- Methods.- Generating Functions.- Hypergeometric Summation.- Sieve Methods.- Enumeration of Patterns.- Topics.- The Catalan Connection.- Symmetric Functions.- Counting Polynomials.- Models from Statistical Physics.

Recenzii

“I loved Martin Aigner's Proofs from THE BOOK, a showcase of some of the most elegant and appealing proofs from across mathematics, and it has a similar feel to that. The presentations of ideas and proofs have the kind of clarity and luminousness which makes one feel, after reading them, that they are the natural if not the only ones. Each chapter also ends with a 'highlight', tackling a famous and attractive problem using the tools developed.” (Danny Yee, dannyreviews.com, July, 2018)



“It provides mathematical analysis of combinatorial sets … . Martin Aigner has a reputation as a good expositor of mathematics … and the book does not disappoint. The explanations, while often brief, are quite good. … As the book gets more and more advanced, the explanations grow correspondingly in size. … contains the clearest explanation of graph polynomials that I have ever found. … the book contains good and readable expositions of an interesting and beautiful subject.” (PeterBoothe, SIGACT News, Vol. 41 (2), 2010)



"The goal of the text is present enumerative combinatorics together with its many applications, including chapters not common in enumerative combinatorics texts, like the ones on hypergeometric summations, on the Tutte polynomial, and on models from statistical physics. … good number of exercises carry additional material, and a number of selected exercises are given a solution at the end. … A nice trend in recent books – closing chapters with some spectacular ‘book proofs’ – is followed and will help at keeping the attention of the students." (László A. Székely, Zentralblatt MATH, Vol. 1123 (1), 2008)


"The book is divided into three parts … . the structure and topics of this book are well-designed, and there are nearly 700 exercises sprinkled throughout – many with hints and solutions in the back – which make the book far more appealing. I think it would be a good … textbook for any graduate student wishing to learn about enumerative combinatorics." (Darren Glass, MathDL, January, 2008)


"In this graduate textbook on enumerative combinatorics, the author follows the classic structure of basics-methods-special topics. … Each chapter ends with a ‘Highlight’, which is a specific, high-level application of the material learned in that chapter. This will benefit instructors and interested students alike. … the book will broaden access to several special topics and will turn them into more mainstream knowledge. The scope of the book is large, so most readers will find several sections that will teach them many facts, methods and theories." (Miklós Bóna, Mathematical Reviews, Issue 2008 f)


"The techniques one needs to be an expert in enumeration are very involved, sometimes quite genius. … This book moves this important technique much closer to the classrooms than it used to be. … The arguments throughout the book are very clear, many exercises are presented … . This way the lecturers with talented audience will find many ideas how to hold out the beauty behind the dry techniques. We highly recommend this book for anyone related to enumeration … ." (Péter Hajnal, Acta Scientiarum Mathematicarum, Vol. 74, 2008)