Russell Merris – författare
Visar alla böcker från författaren Russell Merris. Handla med fri frakt och snabb leverans.
3 produkter
3 produkter
2 082 kr
Skickas inom 5-8 vardagar
A mathematical gem–freshly cleaned and polished This book is intended to be used as the text for a first course in combinatorics. the text has been shaped by two goals, namely, to make complex mathematics accessible to students with a wide range of abilities, interests, and motivations; and to create a pedagogical tool, useful to the broad spectrum of instructors who bring a variety of perspectives and expectations to such a course.Features retained from the first edition: Lively and engaging writing styleTimely and appropriate examplesNumerous well-chosen exercisesFlexible modular formatOptional sections and appendicesHighlights of Second Edition enhancements: Smoothed and polished exposition, with a sharpened focus on key ideasExpanded discussion of linear codesNew optional section on algorithmsGreatly expanded hints and answers sectionMany new exercises and examples
2 170 kr
Skickas inom 5-8 vardagar
A lively invitation to the flavor, elegance, and power of graph theory This mathematically rigorous introduction is tempered and enlivened by numerous illustrations, revealing examples, seductive applications, and historical references. An award-winning teacher, Russ Merris has crafted a book designed to attract and engage through its spirited exposition, a rich assortment of well-chosen exercises, and a selection of topics that emphasizes the kinds of things that can be manipulated, counted, and pictured. Intended neither to be a comprehensive overview nor an encyclopedic reference, this focused treatment goes deeply enough into a sufficiently wide variety of topics to illustrate the flavor, elegance, and power of graph theory. Another unique feature of the book is its user-friendly modular format. Following a basic foundation in Chapters 1-3, the remainder of the book is organized into four strands that can be explored independently of each other. These strands center, respectively, around matching theory; planar graphs and hamiltonian cycles; topics involving chordal graphs and oriented graphs that naturally emerge from recent developments in the theory of graphic sequences; and an edge coloring strand that embraces both Ramsey theory and a self-contained introduction to Pólya's enumeration of nonisomorphic graphs. In the edge coloring strand, the reader is presumed to be familiar with the disjoint cycle factorization of a permutation. Otherwise, all prerequisites for the book can be found in a standard sophomore course in linear algebra. The independence of strands also makes Graph Theory an excellent resource for mathematicians who require access to specific topics without wanting to read an entire book on the subject.
2 608 kr
Skickas inom 10-15 vardagar
The prototypical multilinear operation is multiplication. Indeed, every multilinear mapping can be factored through a tensor product. Apart from its intrinsic interest, the tensor product is of fundamental importance in a variety of disciplines, ranging from matrix inequalities and group representation theory, to the combinatorics of symmetric functions, and all these subjects appear in this book. Another attraction of multilinear algebra lies in its power to unify such seemingly diverse topics. This is done in the final chapter by means of the rational representations of the full linear group. Arising as characters of these representations, the classical Schur polynomials are one of the keys to unification. Prerequisites for the book are minimized by self-contained introductions in the early chapters. Throughout the text, some of the easier proofs are left to the exercises, and some of the more difficult ones to the references.