Автор: Cameron Peter J Название: Notes on Counting: An Introduction to Enumerative Combinator ISBN: 1108404952 ISBN-13(EAN): 9781108404952 Издательство: Cambridge Academ Рейтинг: Цена: 5702.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Enumerative combinatorics, in its algebraic and analytic forms, is vital to many areas of mathematics, from model theory to statistical mechanics. This book, drawn from many years of teaching, invites students into the subject and prepares them for more advanced texts. It is suitable as a class text or for individual study.
Автор: Charalambides, Charalambo Название: Enumerative Combinatorics ISBN: 1584882905 ISBN-13(EAN): 9781584882909 Издательство: Taylor&Francis Рейтинг: Цена: 17609.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: T. Kyle Petersen Название: Inquiry-Based Enumerative Combinatorics ISBN: 3030183106 ISBN-13(EAN): 9783030183103 Издательство: Springer Рейтинг: Цена: 7685.00 р. Наличие на складе: Поставка под заказ.
Описание: Throughout, the theory unfolds via over 150 carefully selected problems for students to solve, many of which connect to state-of-the-art research. Inquiry-Based Enumerative Combinatorics is ideal for lower-division undergraduate students majoring in math or computer science, as there are no formal mathematics prerequisites.
Автор: Richard Stanley Название: Enumerative Combinatorics ISBN: 146159765X ISBN-13(EAN): 9781461597650 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: George E. Martin Название: Counting: The Art of Enumerative Combinatorics ISBN: 1441929150 ISBN-13(EAN): 9781441929150 Издательство: Springer Рейтинг: Цена: 7819.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Counting: The Art of Enumerative Combinatorics provides an introduction to discrete mathematics that addresses questions that begin, How many ways are there to...For example, How many ways are there to order a collection of 12 ice cream cones if 8 flavors are available? At the end of the book the reader should be able to answer such nontrivial counting questions as, How many ways are there to color the faces of a cube if k colors are available with each face having exactly one color? or How many ways are there to stack n poker chips, each of which can be red, white, blue, or green, such that each red chip is adjacent to at least 1 green chip? Since there are no prerequisites, this book can be used for college courses in combinatorics at the sophomore level for either computer science or mathematics students. The first five chapters have served as the basis for a graduate course for in-service teachers. Chapter 8 introduces graph theory.
Автор: Bona Miklos Название: Introduction to Enumerative and Analytic Combinatorics ISBN: 148224909X ISBN-13(EAN): 9781482249095 Издательство: Taylor&Francis Рейтинг: Цена: 13320.00 р. Наличие на складе: Поставка под заказ.
Описание:
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.
Автор: Wagner, Carl G. Название: First course in enumerative combinatorics ISBN: 1470459957 ISBN-13(EAN): 9781470459956 Издательство: Mare Nostrum (Eurospan) Рейтинг: Цена: 10659.00 р. Наличие на складе: Нет в наличии.
Описание: First Course in Enumerative Combinatorics provides an introduction to the fundamentals of enumeration for advanced undergraduates and beginning graduate students in the mathematical sciences. The book offers a careful and comprehensive account of the standard tools of enumeration—recursion, generating functions, sieve and inversion formulas, enumeration under group actions—and their application to counting problems for the fundamental structures of discrete mathematics, including sets and multisets, words and permutations, partitions of sets and integers, and graphs and trees. The author’s exposition has been strongly influenced by the work of Rota and Stanley, highlighting bijective proofs, partially ordered sets, and an emphasis on organizing the subject under various unifying themes, including the theory of incidence algebras. In addition, there are distinctive chapters on the combinatorics of finite vector spaces, a detailed account of formal power series, and combinatorial number theory.The reader is assumed to have a knowledge of basic linear algebra and some familiarity with power series. There are over 200 well-designed exercises ranging in difficulty from straightforward to challenging. There are also sixteen large-scale honors projects on special topics appearing throughout the text. The author is a distinguished combinatorialist and award-winning teacher, and he is currently Professor Emeritus of Mathematics and Adjunct Professor of Philosophy at the University of Tennessee. He has published widely in number theory, combinatorics, probability, decision theory, and formal epistemology. His Erdo?s number is 2. An instructor’s manual for this title is available electronically to those instructors who have adopted the textbook for classroom use. Please send email to textbooks@ams.org for more information.
Автор: Stanley Название: Enumerative Combinatorics ISBN: 1107602629 ISBN-13(EAN): 9781107602625 Издательство: Cambridge Academ Рейтинг: Цена: 5988.00 р. 8554.00-30% Наличие на складе: Есть (1 шт.) Описание: Richard Stanley`s two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of Volume 1 includes more than 300 new exercises, many with solutions, updated and expanded chapter bibliographies and substantial new material on permutation statistics.
Автор: Stanley, Richard (massachusetts Institute Of Technology) Название: Enumerative combinatorics: volume 2 ISBN: 1009262483 ISBN-13(EAN): 9781009262484 Издательство: Cambridge Academ Рейтинг: Цена: 7918.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of volume two covers the composition of generating functions, in particular the exponential formula and the Lagrange inversion formula, labelled and unlabelled trees, algebraic, D-finite, and noncommutative generating functions, and symmetric functions. The chapter on symmetric functions provides the only available treatment of this subject suitable for an introductory graduate course and focusing on combinatorics, especially the Robinson–Schensted–Knuth algorithm. An appendix by Sergey Fomin covers some deeper aspects of symmetric functions, including jeu de taquin and the Littlewood–Richardson rule. The exercises in the book play a vital role in developing the material, and this second edition features over 400 exercises, including 159 new exercises on symmetric functions, all with solutions or references to solutions.
Автор: Gunderson Название: Handbook Of Mathematical Induction ISBN: 113819901X ISBN-13(EAN): 9781138199019 Издательство: Taylor&Francis Рейтинг: Цена: 7961.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
Handbook of Mathematical Induction: Theory and Applications shows how to find and write proofs via mathematical induction. This comprehensive book covers the theory, the structure of the written proof, all standard exercises, and hundreds of application examples from nearly every area of mathematics.
In the first part of the book, the author discusses different inductive techniques, including well-ordered sets, basic mathematical induction, strong induction, double induction, infinite descent, downward induction, and several variants. He then introduces ordinals and cardinals, transfinite induction, the axiom of choice, Zorn's lemma, empirical induction, and fallacies and induction. He also explains how to write inductive proofs.
The next part contains more than 750 exercises that highlight the levels of difficulty of an inductive proof, the variety of inductive techniques available, and the scope of results provable by mathematical induction. Each self-contained chapter in this section includes the necessary definitions, theory, and notation and covers a range of theorems and problems, from fundamental to very specialized.
The final part presents either solutions or hints to the exercises. Slightly longer than what is found in most texts, these solutions provide complete details for every step of the problem-solving process.
Автор: Hammack Название: Handbook Of Product Graphs 2E ISBN: 1138199087 ISBN-13(EAN): 9781138199088 Издательство: Taylor&Francis Рейтинг: Цена: 7961.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
Handbook of Product Graphs, Second Edition examines the dichotomy between the structure of products and their subgraphs. It also features the design of efficient algorithms that recognize products and their subgraphs and explores the relationship between graph parameters of the product and factors. Extensively revised and expanded, the handbook presents full proofs of many important results as well as up-to-date research and conjectures.
Results and Algorithms New to the Second Edition:
Cancellation results
A quadratic recognition algorithm for partial cubes
Results on the strong isometric dimension
Computing the Wiener index via canonical isometric embedding
Connectivity results
A fractional version of Hedetniemi's conjecture
Results on the independence number of Cartesian powers of vertex-transitive graphs
Verification of Vizing's conjecture for chordal graphs
Results on minimum cycle bases
Numerous selected recent results, such as complete minors and nowhere-zero flows
The second edition of this classic handbook provides a thorough introduction to the subject and an extensive survey of the field. The first three parts of the book cover graph products in detail. The authors discuss algebraic properties, such as factorization and cancellation, and explore interesting and important classes of subgraphs. The fourth part presents algorithms for the recognition of products and related classes of graphs. The final two parts focus on graph invariants and infinite, directed, and product-like graphs. Sample implementations of selected algorithms and other information are available on the book's website, which can be reached via the authors' home pages.
Автор: Kai Behrend; Marcos Marino; Marco Manetti; Michael Название: Enumerative Invariants in Algebraic Geometry and String Theory ISBN: 3540798137 ISBN-13(EAN): 9783540798132 Издательство: Springer Рейтинг: Цена: 6282.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: There has been a growing interaction between algebraic geometry and certain areas of theoretical high-energy physics. This volume, a result of the CIME Summer School held in Cetraro, Italy, in 2005, covers the most interesting findings in this subject.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
