Preface.- Part I: Fundamentals of Discrete Mathematics.- Logic.- Proofs.- Algorithms.- Set Theory.- Relations and Functions.- Sequences, Induction and Recursion.- Introduction to Number Theory.- Counting and Probability.- Boolean Algebra and Combinational Circuits.- Introduction to the Theory of Computation.- Part II: Graph Theory.- Introduction to Graphs.- Trees and Traversals.- Subgraphs.- Connectivity, Network Flows and Shortest Paths.- Graph Applications.- A: .- Pseudocode Conventions.- Index.
Автор: Epp, Susanna Название: Discrete mathematics with applications, metric version 5 edition ISBN: 0357114086 ISBN-13(EAN): 9780357114087 Издательство: Cengage Learning Рейтинг: Цена: 106200.00 T Наличие на складе: Поставка под заказ. Описание: DISCRETE MATHEMATICS WITH APPLICATIONS, 5th Edition, Metric Edition explains complex, abstract concepts with clarity and precision and provides a strong foundation for computer science and upper-level mathematics courses of the computer age. Author Susanna Epp presents not only the major themes of discrete mathematics, but also the reasoning that underlies mathematical thought. Students develop the ability to think abstractly as they study the ideas of logic and proof.
While learning about such concepts as logic circuits and computer addition, algorithm analysis, recursive thinking, computability, automata, cryptography and combinatorics, students discover that the ideas of discrete mathematics underlie and are essential to today's science and technology.
Автор: Watrous, John (university Of Waterloo, Ontario) Название: The theory of quantum information ISBN: 1107180562 ISBN-13(EAN): 9781107180567 Издательство: Cambridge Academ Рейтинг: Цена: 77090.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Intended for graduate students and researchers, this book presents a formal development of the mathematical theory of quantum information. Largely self-contained, with clear proofs and a wide range of exercises, it will help the reader grasp the fundamental facts and techniques that form the mathematical foundations of the subject.
Автор: Mcmullen, Peter (university College London) Название: Geometric regular polytopes ISBN: 1108489583 ISBN-13(EAN): 9781108489584 Издательство: Cambridge Academ Рейтинг: Цена: 128830.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Regular polytopes and their symmetry have a long history. This book, the first to cover modern theory, explores the subject in depth, introducing new techniques and elementary approaches to familiar ideas. It caters for experienced researchers and also for graduate students in discrete and Euclidean geometry, combinatorics and group theory.
Автор: Gross, Benedict H., Название: Fat chance : ISBN: 1108728189 ISBN-13(EAN): 9781108728188 Издательство: Cambridge Academ Рейтинг: Цена: 25350.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Designed for the intellectually curious, this book provides a solid foundation in basic probability theory in a charming style, without technical jargon. This text will immerse the reader in a mathematical view of the world, and teach them techniques to solve real-world problems both inside and outside the casino.
Автор: Mazur Название: Prime Numbers and the Riemann Hypothesis ISBN: 1107101921 ISBN-13(EAN): 9781107101920 Издательство: Cambridge Academ Рейтинг: Цена: 55970.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book introduces prime numbers and explains the celebrated, unsolved Riemann hypothesis in a direct manner. Suitable for both scholars and those with a minimal mathematical background.
Автор: B. V. Senthil Kumar, Hemen Dutta Название: Discrete Mathematical Structures: A Succinct Foundation ISBN: 0367148692 ISBN-13(EAN): 9780367148690 Издательство: Taylor&Francis Рейтинг: Цена: 158230.00 T Наличие на складе: Нет в наличии. Описание: Discrete mathematical Structures are very essential for many fields of study. This book is designed as an introductory book that will provide a sufficient number of solved examples, to motivate the reader to solve similar types of problems.
Автор: Fortney Jon Pierre Название: Discrete Mathematics for Computer Science: An Example-Based Introduction ISBN: 0367549883 ISBN-13(EAN): 9780367549886 Издательство: Taylor&Francis Рейтинг: Цена: 163330.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book is intended for a first or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors, such as algorithms, number representations, logic, set theory, Boolean algebra, functions, combinatorics etc.
Автор: Tointon, Matthew C. H. (university Of Cambridge) Название: London mathematical society student texts ISBN: 1108456448 ISBN-13(EAN): 9781108456449 Издательство: Cambridge Academ Рейтинг: Цена: 27450.00 T Наличие на складе: Поставка под заказ. Описание: Recent years have seen rapid progress in the field of approximate groups, with the emergence of a varied range of applications. Written by a leader in the field, this text for both beginning graduate students and researchers collects, for the first time in book form, the main concepts and techniques into a single, self-contained introduction.
Автор: Stanley Название: Catalan Numbers ISBN: 1107075092 ISBN-13(EAN): 9781107075092 Издательство: Cambridge Academ Рейтинг: Цена: 66530.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Catalan numbers are probably the most ubiquitous sequence of numbers in mathematics. This book gives some basic background and then presents more than 250 exercises and solutions on the properties and applications of these numbers, with difficulty levels ranging from recreational to research.
Название: Discrete Geometric Analysis ISBN: 4864970351 ISBN-13(EAN): 9784864970358 Издательство: World Scientific Publishing Цена: 26400.00 T Наличие на складе: Невозможна поставка. Описание: This is a volume of lecture notes based on three series of lectures given by visiting professors of RIMS, Kyoto University during the year-long project 'Discrete Geometric Analysis', which took place in the Japanese academic year 2012-2013. The aim of the project was to make comprehensive research on topics related to discreteness in geometry, analysis and optimization.Discrete geometric analysis is a hybrid field of several traditional disciplines, including graph theory, geometry, discrete group theory, and probability. The name of the area was coined by Toshikazu Sunada, and since being introduced, it has been extending and making new interactions with many other fields.This volume consists of three chapters: (I) Loop Erased Walks and Uniform Spanning Trees, by Martin T Barlow; (II) Combinatorial Rigidity: Graphs and Matroids in the Theory of Rigid Frameworks, by Tibor Jordan; (III) Analysis and Geometry on Groups, by Andrzej Zuk.The lecture notes are useful surveys that provide an introduction to the history and recent progress in the areas covered. They will also help researchers who work in related interdisciplinary fields to gain an understanding of the material from the viewpoint of discrete geometric analysis.Published by Mathematical Society of Japan and distributed by World Scientific Publishing Co. for all markets
Автор: Matveev, Andrey O., Название: Pattern recognition on oriented matroids / ISBN: 3110530716 ISBN-13(EAN): 9783110530711 Издательство: Walter de Gruyter Рейтинг: Цена: 123910.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание:
Pattern Recognition on Oriented Matroids covers a range of innovative problems in combinatorics, poset and graph theories, optimization, and number theory that constitute a far-reaching extension of the arsenal of committee methods in pattern recognition. The groundwork for the modern committee theory was laid in the mid-1960s, when it was shown that the familiar notion of solution to a feasible system of linear inequalities has ingenious analogues which can serve as collective solutions to infeasible systems. A hierarchy of dialects in the language of mathematics, for instance, open cones in the context of linear inequality systems, regions of hyperplane arrangements, and maximal covectors (or topes) of oriented matroids, provides an excellent opportunity to take a fresh look at the infeasible system of homogeneous strict linear inequalities - the standard working model for the contradictory two-class pattern recognition problem in its geometric setting. The universal language of oriented matroid theory considerably simplifies a structural and enumerative analysis of applied aspects of the infeasibility phenomenon.
The present book is devoted to several selected topics in the emerging theory of pattern recognition on oriented matroids: the questions of existence and applicability of matroidal generalizations of committee decision rules and related graph-theoretic constructions to oriented matroids with very weak restrictions on their structural properties; a study (in which, in particular, interesting subsequences of the Farey sequence appear naturally) of the hierarchy of the corresponding tope committees; a description of the three-tope committees that are the most attractive approximation to the notion of solution to an infeasible system of linear constraints; an application of convexity in oriented matroids as well as blocker constructions in combinatorial optimization and in poset theory to enumerative problems on tope committees; an attempt to clarify how elementary changes (one-element reorientations) in an oriented matroid affect the family of its tope committees; a discrete Fourier analysis of the important family of critical tope committees through rank and distance relations in the tope poset and the tope graph; the characterization of a key combinatorial role played by the symmetric cycles in hypercube graphs.
Contents Oriented Matroids, the Pattern Recognition Problem, and Tope Committees Boolean Intervals Dehn-Sommerville Type Relations Farey Subsequences Blocking Sets of Set Families, and Absolute Blocking Constructions in Posets Committees of Set Families, and Relative Blocking Constructions in Posets Layers of Tope Committees Three-Tope Committees Halfspaces, Convex Sets, and Tope Committees Tope Committees and Reorientations of Oriented Matroids Topes and Critical Committees Critical Committees and Distance Signals Symmetric Cycles in the Hypercube Graphs
Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2) ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
