![]() |
Selected Papers of Alan J Hoffman (with Commentary)
ISBN: 9789810241988 / Angielski / Twarda / 492 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Dr Alan J Hoffman is a pioneer in linear programming, combinatorial optimization, and the study of graph spectra. In his principal research interests, which include the fields of linear inequalities, combinatorics and matrix theory, he and his collaborators have contributed fundamental concepts and theorems, many of which bear their names. This volume of Dr Hoffman's selected papers is divided into seven sections: geometry; combinatorics; matrix inequalities and eigenvalues; linear inequalities and linear programming; combinatorial optimization; greedy algorithms; and graph spectra. Dr...
Dr Alan J Hoffman is a pioneer in linear programming, combinatorial optimization, and the study of graph spectra. In his principal research interests,...
|
cena:
845,26 |
![]() |
Combinatorial Mathematics and Its Applications
ISBN: 9780807878200 / Angielski / Miękka / 622 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This volume includes thirty-three papers by eminent mathematicians, statisticians, and electrical engineers. The papers are organized into five main divisions: general problems of combinatorial mathematics; combinatorial problems of experimental designs; error-correcting codes and other problems of information theory; finite geometrics; and graphs. Many of the papers are followed by prepared discussions.
Contents General Editor's Preface Preface Conference Participants PART I. GENERAL PROBLEMS OF COMBINATORIAL MATHEMATICS 1. PROBABILISTIC METHODS IN... This volume includes thirty-three papers by eminent mathematicians, statisticians, and electrical engineers. The papers are organized into five main d...
|
cena:
330,33 |
![]() |
Applications of Combinatorial Matrix Theory to Laplacian Matrices of Graphs
ISBN: 9781439863374 / Angielski / Twarda / 425 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. On the surface, matrix theory and graph theory seem like very different branches of mathematics. However, adjacency, Laplacian, and incidence matrices are commonly used to represent graphs, and many properties of matrices can give us useful information about the structure of graphs. Applications of Combinatorial Matrix Theory to Laplacian Matrices of Graphs is a compilation of many of the exciting results concerning Laplacian matrices developed since the mid 1970s by well-known mathematicians such as Fallat, Fiedler, Grone, Kirkland, Merris, Mohar, Neumann,... On the surface, matrix theory and graph theory seem like very different branches of mathematics. However, adjacency, Laplacian, and incidence matri... |
cena:
922,99 |
![]() |
Graph Theory
ISBN: 9781466254992 / Angielski / Miękka / 474 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This text offers the most comprehensive and up-to-date presentation available on the fundamental topics in graph theory. It develops a thorough understanding of the structure of graphs, the techniques used to analyze problems in graph theory and the uses of graph theoretical algorithms in mathematics, engineering and computer science. There are many new topics in this book that have not appeared before in print: new proofs of various classical theorems, signed degree sequences, criteria for graphical sequences, eccentric sequences, matching and decomposition of planar graphs into trees....
This text offers the most comprehensive and up-to-date presentation available on the fundamental topics in graph theory. It develops a thorough unders...
|
cena:
99,78 |
![]() |
The Four Colour Theorem
ISBN: 9781466265301 / Angielski / Miękka / 82 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. We present a new proof of the famous four colour theorem using algebraic and topological methods. This proof was first announced by the Canadian Mathematical Society in 2000 and subsequently published by Orient Longman and Universities Press of India in 2008. Recent research in physics shows that this proof directly implies the Grand Unification of the Standard Model with Quantum Gravity in its physical interpretation and conversely the existence of the standard model of particle physics shows that nature applies this proof of the four colour theorem at the most fundamental level.
We present a new proof of the famous four colour theorem using algebraic and topological methods. This proof was first announced by the Canadian Mathe...
|
cena:
99,78 |
![]() |
New Directions of Modern Cryptography
ISBN: 9781466501386 / Angielski / Twarda / 400 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Modern cryptography has evolved dramatically since the 1970s. With the rise of new network architectures and services, the field encompasses much more than traditional communication where each side is of a single user. It also covers emerging communication where at least one side is of multiple users. New Directions of Modern Cryptography presents general principles and application paradigms critical to the future of this field. Modern cryptography has evolved dramatically since the 1970s. With the rise of new network architectures and services, the field encompasses much m... |
cena:
534,37 |
![]() |
Combinatorial Algorithms: 22th International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers
ISBN: 9783642250101 / Angielski / Miękka / 386 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This book constitutes the thoroughly referred post-workshop proceedings of the 22nd International Workshop on Combinatorial Algorithms, IWOCA 2011, held in Victoria, BC, Canada, in July 2011. The 30 revised full papers presented were carefully reviewed and selected from a total of 71 submissions. A broad variety of topics in combinatorics and graph theory are addressed, such as combinatorics on words, string algorithms, codes, Venn diagrams, set partitions; Hamiltonian & Eulerian properties, graph drawing, colouring, dominating sets, spanning trees, and others.
This book constitutes the thoroughly referred post-workshop proceedings of the 22nd International Workshop on Combinatorial Algorithms, IWOCA 2011, he...
|
cena:
201,24 |
![]() |
Combinatorial Aspect of Integrable Systems
ISBN: 9784931469372 / Angielski / Twarda / 167 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This volume is a collection of six papers based on the expository lectures of the workshop “Combinatorial Aspect of Integrable Systems” held at RIMS during July 26-30, 2004, as a part of the Project Research 2004 “Method of Algebraic Analysis in Integrable Systems”. The topics range over crystal bases of quantum groups, its algebra-geometric analogue known as geometric crystal, generalizations of Robinson-Schensted type correspondence, fermionic formula related to Bethe ansatz, applications of crystal bases to soliton celluar automata, Yang-Baxter maps, and...
This volume is a collection of six papers based on the expository lectures of the workshop “Combinatorial Aspect of Integrable Systems” ...
|
cena:
97,16 |
![]() |
Orthogonal Decompositions and Functional Limit Theorems for Random Graph Statistics
ISBN: 9780821825952 / Angielski / Miękka / 78 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This work develops a method to obtain limit theorems for various functionals of random graphs. The method is based on a certain orthogonal decomposition. Janson's results include limit theorems for the two standard random graph models, G n, p and G n, m as well as functional limit theorems for the evolution of a random graph and results on the maximum of a function during the evolution. Janson obtains both normal and nonnormal limits, and the method provides an explanation for the appearance of nonnormal limits. Applications to subgraph counts and to vertex degrees are presented as example
This work develops a method to obtain limit theorems for various functionals of random graphs. The method is based on a certain orthogonal decompositi...
|
cena:
184,60 |
![]() |
Graph Theory as I Have Known It
ISBN: 9780199660551 / Angielski / Miękka / 164 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Graph Theory as I Have Known It provides a unique introduction to graph theory by one of the founding fathers, and will appeal to anyone interested in the subject. It is not intended as a comprehensive treatise, but rather as an account of those parts of the theory that have been of special interest to the author. Professor Tutte details his experience in the area, and provides a fascinating insight into how he was led to his theorems and the proofs he used. As well as being of historical interest it provides a useful starting point for research, with references to further suggested books as...
Graph Theory as I Have Known It provides a unique introduction to graph theory by one of the founding fathers, and will appeal to anyone interested in...
|
cena:
215,65 |
![]() |
Ordering Block Designs: Gray Codes, Universal Cycles and Configuration Orderings
ISBN: 9781461443247 / Angielski / Twarda / 208 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The study of combinatorial block designs is a vibrant area of combinatorial mathematics with connections to finite geometries, graph theory, coding theory and statistics. The practice of ordering combinatorial objects can trace its roots to bell ringing which originated in 17th century England, but only emerged as a significant modern research area with the work of F. Gray and N. de Bruijn. These two fascinating areas of mathematics are brought together for the first time in this book. It presents new terminology and concepts which unify existing and recent results from a wide... The study of combinatorial block designs is a vibrant area of combinatorial mathematics with connections to finite geometries, graph theory, coding... |
cena:
201,09 |
![]() |
Advances in Combinatorics: Waterloo Workshop in Computer Algebra, W80, May 26-29, 2011
ISBN: 9783642309786 / Angielski / Twarda / 293 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This volume, as Andrew M. Odlzyko writes in the foreword, commemorates and celebrates the life and achievements of an extraordinary person. Originally conceived as an 80th birthday tribute to Herbert Wilf, the well-known combinatorialist, the book has evolved beyond the proceeds of the W80 tribute. Professor Wilf was an award-winning teacher, who was supportive of women mathematicians, and who had an unusually high proportion of women among his PhD candidates. He was Editor-in-chief of the American Mathematical Monthly and a founder of both the Journal of Algorithms and of the... This volume, as Andrew M. Odlzyko writes in the foreword, commemorates and celebrates the life and achievements of an extraordinary person. Origina... |
cena:
402,53 |
![]() |
Counting (2nd Edition)
ISBN: 9789814401906 / Angielski / Twarda / 224 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This book is a useful, attractive introduction to basic counting techniques for upper secondary and junior college students, as well as teachers. Younger students and lay people who appreciate mathematics, not to mention avid puzzle solvers, will also find the book interesting. The various problems and applications here are good for building up proficiency in counting. They are also useful for honing basic skills and techniques in general problem solving. Many of the problems avoid routine and the diligent reader will often discover more than one way of solving a particular problem, which is...
This book is a useful, attractive introduction to basic counting techniques for upper secondary and junior college students, as well as teachers. Youn...
|
cena:
233,17 |
![]() |
Introduction to the Analysis of Algorithms, an (2nd Edition)
ISBN: 9789814401159 / Angielski / Twarda / 212 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. A successor to the first edition, this updated and revised book is a great companion guide for students and engineers alike, specifically software engineers who design reliable code. While succinct, this edition is mathematically rigorous, covering the foundations of both computer scientists and mathematicians with interest in algorithms. Besides covering the traditional algorithms of Computer Science such as Greedy, Dynamic Programming and Divide & Conquer, this edition goes further by exploring two classes of algorithms that are often overlooked: Randomised and Online algorithms - with...
A successor to the first edition, this updated and revised book is a great companion guide for students and engineers alike, specifically software eng...
|
cena:
262,32 |
![]() |
Counting
ISBN: 9789812380647 / Angielski / Miękka / 124 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. An introduction to basic counting techniques for upper secondary and junior college students, as well as teachers. Younger students and lay people who appreciate mathematics or puzzle solving, should also find the book interesting. The various problems and applications here should help build up proficiency in counting, and hone basic skills and techniques in general problem solving. Many of the problems avoid routine and the diligent reader will often discover more than one way of solving a particular problem, which is an important awareness in problem solving. The book is thus designed to...
An introduction to basic counting techniques for upper secondary and junior college students, as well as teachers. Younger students and lay people who...
|
cena:
77,72 |
![]() |
Combinatorics: An Introduction
ISBN: 9781118404362 / Angielski / Twarda / 328 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This text provides a treatment of counting combinatorics that uniquely includes detailed formulas, proofs, and exercises and features coverage of derangements, elementary probability, conditional probability, independent probability, and Bayes' Theorem.
This text provides a treatment of counting combinatorics that uniquely includes detailed formulas, proofs, and exercises and features coverage of dera...
|
cena:
408,83 |
![]() |
The Foundations of Topological Graph Theory
ISBN: 9781461275732 / Angielski / Miękka / 178 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This is not a traditional work on topological graph theory. No current graph or voltage graph adorns its pages. Its readers will not compute the genus (orientable or non-orientable) of a single non-planar graph. Their muscles will not flex under the strain of lifting walks from base graphs to derived graphs. What is it, then? It is an attempt to place topological graph theory on a purely combinatorial yet rigorous footing. The vehicle chosen for this purpose is the con cept of a 3-graph, which is a combinatorial generalisation of an imbedding. These properly edge-coloured cubic graphs are...
This is not a traditional work on topological graph theory. No current graph or voltage graph adorns its pages. Its readers will not compute the genus...
|
cena:
483,04 |
![]() |
Essays in Game Theory: In Honor of Michael Maschler
ISBN: 9781461276210 / Angielski / Miękka / 203 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This volume presents a collection of papers on game theory dedicated to Michael Maschler. Through his dedication and contributions to game theory, Maschler has become an important figure particularly in the area of cooperative games. Game theory has since become an important subject in operations research, economics and management science. As befits such a volume, the main themes covered are cooperative games, coalitions, repeated games, and a cost allocation games. All the contributions are authoritative surveys of a particular topic, so together they will present an invaluable overview of...
This volume presents a collection of papers on game theory dedicated to Michael Maschler. Through his dedication and contributions to game theory, Mas...
|
cena:
402,53 |
![]() |
Learning Discrete Mathematics with Isetl
ISBN: 9781461281702 / Angielski / Miękka / 416 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The title of this book, Learning Discrete Mathematics with ISETL raises two issues. We have chosen the word "Learning" rather than "Teaching" because we think that what the student does in order to learn is much more important than what the professor does in order to teach. Academia is filled with outstanding mathematics teachers: excellent expositors, good organizers, hard workers, men and women who have a deep understanding of Mathematics and its applications. Yet, when it comes to ideas in Mathe matics, our students do not seem to be learning. It may be that something more is needed and we...
The title of this book, Learning Discrete Mathematics with ISETL raises two issues. We have chosen the word "Learning" rather than "Teaching" because ...
|
cena:
201,24 |
![]() |
Introduction to Discrete Mathematics with Isetl
ISBN: 9781461284802 / Angielski / Miękka / 196 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Intended for first- or second-year undergraduates, this introduction to discrete mathematics covers the usual topics of such a course, but applies constructivist principles that promote - indeed, require - active participation by the student. Working with the programming language ISETL, whose syntax is close to that of standard mathematical language, the student constructs the concepts in her or his mind as a result of constructing them on the computer in the syntax of ISETL. This dramatically different approach allows students to attempt to discover concepts in a "Socratic" dialog with the...
Intended for first- or second-year undergraduates, this introduction to discrete mathematics covers the usual topics of such a course, but applies con...
|
cena:
201,24 |