Atnaujinkite slapukų nuostatas

El. knyga: Algebraic Combinatorics: Walks, Trees, Tableaux, and More

Kitos knygos pagal šią temą:
Kitos knygos pagal šią temą:

DRM apribojimai

  • Kopijuoti:

    neleidžiama

  • Spausdinti:

    neleidžiama

  • El. knygos naudojimas:

    Skaitmeninių teisių valdymas (DRM)
    Leidykla pateikė šią knygą šifruota forma, o tai reiškia, kad norint ją atrakinti ir perskaityti reikia įdiegti nemokamą programinę įrangą. Norint skaityti šią el. knygą, turite susikurti Adobe ID . Daugiau informacijos  čia. El. knygą galima atsisiųsti į 6 įrenginius (vienas vartotojas su tuo pačiu Adobe ID).

    Reikalinga programinė įranga
    Norint skaityti šią el. knygą mobiliajame įrenginyje (telefone ar planšetiniame kompiuteryje), turite įdiegti šią nemokamą programėlę: PocketBook Reader (iOS / Android)

    Norint skaityti šią el. knygą asmeniniame arba „Mac“ kompiuteryje, Jums reikalinga  Adobe Digital Editions “ (tai nemokama programa, specialiai sukurta el. knygoms. Tai nėra tas pats, kas „Adobe Reader“, kurią tikriausiai jau turite savo kompiuteryje.)

    Negalite skaityti šios el. knygos naudodami „Amazon Kindle“.

Written by one of the foremost experts in the field, Algebraic Combinatorics is a unique undergraduate textbook that will prepare the next generation of pure and applied mathematicians. The combination of the author’s extensive knowledge of combinatorics and classical and practical tools from algebra will inspire motivated students to delve deeply into the fascinating interplay between algebra and combinatorics. Readers will be able to apply their newfound understanding to mathematical, engineering, and business models. Prerequisites include a basic knowledge of linear algebra over a field, existence of finite fields, and rudiments of group theory. The topics in each chapter build on one another and include extensive problem sets as well as hints to selected exercises. Key topics include walks on graphs, cubes and the Radon transform, the Matrix-Tree Theorem, de Bruijn sequences, the Erdos–Moser conjecture, electrical networks, the Sperner property, shellability of simplicial complexes and face rings. There are also three appendices on purely enumerative aspects of combinatorics related to the chapter material: the RSK algorithm, plane partitions, and the enumeration of labeled trees.

The new edition contains a bit more content than intended for a one-semester advanced undergraduate course in algebraic combinatorics, enumerative combinatorics, or graph theory. Instructors may pick and choose chapters/sections for course inclusion and students can immerse themselves in exploring additional gems once the course has ended. A chapter on combinatorial commutative algebra (Chapter 12) is the heart of added material in this new edition. The author gives substantial application without requisites needed for algebraic topology and homological algebra. A sprinkling of additional exercises and a new section (13.8) involving commutative algebra, have been added.

From reviews of the first edition:

“This gentle book provides the perfect stepping-stone up. The various chapters treat diverse topics … . Stanley’s emphasis on ‘gems’ unites all this —he chooses his material to excite students and draw them into further study. … Summing Up:  Highly recommended. Upper-division undergraduates and above.”

—D. V. Feldman, Choice, Vol. 51(8), April, 2014



Written by an expert in the field, this undergraduate textbook will prepare the next generation of pure and applied mathematicians. Key topics include walks on graphs, cubes and the Radon transform, the Matrix–Tree Theorem, and the Sperner property.
Preface to the Second Edition ix
Updated Preface to the First Edition xi
Basic Notation xv
1 Walks in Graphs
1(10)
2 Cubes and the Radon Transform
11(10)
3 Random Walks
21(10)
4 The Sperner Property
31(12)
5 Group Actions on Boolean Algebras
43(14)
6 Young Diagrams and q - Binomial Coefficients
57(18)
7 Enumeration Under Group Action
75(28)
8 A Glimpse of Young Tableaux
103(32)
9 The Matrix-Tree Theorem
135(16)
10 Eulerian Digraphs and Oriented Trees
151(12)
11 Cycles, Bonds, and Electrical Networks
163(24)
11.1 The Cycle Space and Bond Space
163(5)
11.2 Bases for the Cycle Space and Bond Space
168(4)
11.3 Electrical Networks
172(5)
11.4 Planar Graphs (Sketch)
177(3)
11.5 Squaring the Square
180(7)
12 A Glimpse of Combinatorial Commutative Algebra
187(32)
12.1 Simplicial Complexes
187(14)
12.2 The Face Ring
201(18)
13 Miscellaneous Gems of Algebraic Combinatorics
219(26)
13.1 The 100 Prisoners
219(2)
13.2 Oddtown
221(1)
13.3 Complete Bipartite Partitions of Kn
222(1)
13.4 The Nonuniform Fisher Inequality
223(2)
13.5 Odd Neighborhood Covers
225(1)
13.6 Circulant Hadamard Matrices
226(6)
13.7 P-Recursive Functions
232(3)
13.8 Affine Monoids
235(10)
Hints and Comments for Some Exercises 245(6)
Bibliography 251(6)
Index 257
Richard P. Stanley is one of the most well-known algebraic combinatorists in the world. He is currently professor of Applied Mathematics at the Massachusetts Institute of Technology. Amongst his several visiting professorships, Stanley has received numerous awards including the George Polya Prize in Applied Combinatorics, Guggenheim Fellowship, admission to both the American Academy and National Academies of Sciences, Leroy P. Steele Prize for Mathematical Exposition, Rolf Schock Prize in Mathematics, Senior Scholar at Clay Mathematics Institute, Aisenstadt Chair, Honorary Doctor of Mathematics from the University of Waterloo, and an honorary professorship at the Nankai University. Professor Stanley has had over 50 doctoral students and is well known for his excellent teaching skills.