0
Your cart

Your cart is empty

Browse All Departments
Price
  • R100 - R250 (18)
  • R250 - R500 (26)
  • R500+ (1,703)
  • -
Status
Format
Author / Contributor
Publisher

Books > Science & Mathematics > Mathematics > Combinatorics & graph theory

Discrete Probability and Algorithms (Paperback, Softcover reprint of the original 1st ed. 1995): David Aldous, Persi Diaconis,... Discrete Probability and Algorithms (Paperback, Softcover reprint of the original 1st ed. 1995)
David Aldous, Persi Diaconis, Joel Spencer, J.Michael Steele
R3,165 Discovery Miles 31 650 Ships in 10 - 15 working days

Discrete probability theory and the theory of algorithms have become close partners over the last ten years, though the roots of this partnership go back much longer. The papers in this volume address the latest developments in this active field. They are from the IMA Workshops "Probability and Algorithms" and "The Finite Markov Chain Renaissance." They represent the current thinking of many of the world's leading experts in the field. Researchers and graduate students in probability, computer science, combinatorics, and optimization theory will all be interested in this collection of articles. The techniques developed and surveyed in this volume are still undergoing rapid development, and many of the articles of the collection offer an expositionally pleasant entree into a research area of growing importance.

Contests in Higher Mathematics - Miklos Schweitzer Competitions 1962-1991 (Paperback, Softcover reprint of the original 1st ed.... Contests in Higher Mathematics - Miklos Schweitzer Competitions 1962-1991 (Paperback, Softcover reprint of the original 1st ed. 1996)
Gabor J. Szekely
R4,547 Discovery Miles 45 470 Ships in 10 - 15 working days

One of the most effective ways to stimulate students to enjoy intellectual efforts is the scientific competition. In 1894 the Hungarian Mathematical and Physical Society introduced a mathematical competition for high school students. The success of high school competitions led the Mathematical Society to found a college level contest, named after Miklos Schweitzer. The problems of the Schweitzer Contests are proposed and selected by the most prominent Hungarian mathematicians. This book collects the problems posed in the contests between 1962 and 1991 which range from algebra, combinatorics, theory of functions, geometry, measure theory, number theory, operator theory, probability theory, topology, to set theory. The second part contains the solutions. The Schweitzer competition is one of the most unique in the world. The experience shows that this competition helps to identify research talents. This collection of problems and solutions in several fields in mathematics can serve as a guide for many undergraduates and young mathematicians. The large variety of research level problems might be of interest for more mature mathematicians and historians of mathematics as well.

The Self-Avoiding Walk (Paperback, 2013 ed.): Neal Madras, Gordon Slade The Self-Avoiding Walk (Paperback, 2013 ed.)
Neal Madras, Gordon Slade
R3,697 Discovery Miles 36 970 Ships in 10 - 15 working days

The self-avoiding walk is a mathematical model that has important applications in statistical mechanics and polymer science. In spite of its simple definition a path on a lattice that does not visit the same site more than once it is difficult to analyze mathematically. "TheSelf-Avoiding Walk"provides the firstunified account of the known rigorous results for the self-avoiding walk, with particular emphasis on its critical behavior. Its goals are to give an account of the current mathematical understanding of the model, to indicate some of the applications of the concept in physics and in chemistry, and to give an introduction to some of the nonrigorous methods used in those fields.

Topics covered in the bookinclude: the lace expansion and its application to the self-avoiding walk in more than four dimensions where most issues are now resolved; an introduction to the nonrigorous scaling theory; classical work of Hammersley and others; a new exposition of Kesten s pattern theorem and its consequences; a discussion of the decay of the two-point function and its relation to probabilistic renewal theory; analysis of Monte Carlo methods that have been used to study the self-avoiding walk; the role of the self-avoiding walk in physical and chemical applications. Methods from combinatorics, probability theory, analysis, and mathematical physics play important roles. The book is highly accessible to both professionals and graduate students in mathematics, physics, and chemistry.

"

Ordered Sets - An Introduction (Paperback, Softcover reprint of the original 1st ed. 2003): Bernd Schroeder Ordered Sets - An Introduction (Paperback, Softcover reprint of the original 1st ed. 2003)
Bernd Schroeder
R1,595 Discovery Miles 15 950 Ships in 10 - 15 working days

An introduction to the basic tools of the theory of (partially) ordered sets such as visualization via diagrams, subsets, homomorphisms, important order-theoretical constructions and classes of ordered sets. Using a thematic approach, the author presents open or recently solved problems to motivate the development of constructions and investigations for new classes of ordered sets. The text can be used as a focused follow-up or companion to a first proof (set theory and relations) or graph theory course.

Topics in Computational Algebra (Paperback, Softcover reprint of the original 1st ed. 1990): G.M.Piacentini Cattaneo,... Topics in Computational Algebra (Paperback, Softcover reprint of the original 1st ed. 1990)
G.M.Piacentini Cattaneo, Elisabetta Strickland
R4,456 Discovery Miles 44 560 Ships in 10 - 15 working days

The main purpose of these lectures is first to briefly survey the fundamental con nection between the representation theory of the symmetric group Sn and the theory of symmetric functions and second to show how combinatorial methods that arise naturally in the theory of symmetric functions lead to efficient algorithms to express various prod ucts of representations of Sn in terms of sums of irreducible representations. That is, there is a basic isometry which maps the center of the group algebra of Sn, Z(Sn), to the space of homogeneous symmetric functions of degree n, An. This basic isometry is known as the Frobenius map, F. The Frobenius map allows us to reduce calculations involving characters of the symmetric group to calculations involving Schur functions. Now there is a very rich and beautiful theory of the combinatorics of symmetric functions that has been developed in recent years. The combinatorics of symmetric functions, then leads to a number of very efficient algorithms for expanding various products of Schur functions into a sum of Schur functions. Such expansions of products of Schur functions correspond via the Frobenius map to decomposing various products of irreducible representations of Sn into their irreducible components. In addition, the Schur functions are also the characters of the irreducible polynomial representations of the general linear group over the complex numbers GLn(C).

Visualization and Mathematics - Experiments, Simulations and Environments (Paperback, Softcover reprint of the original 1st ed.... Visualization and Mathematics - Experiments, Simulations and Environments (Paperback, Softcover reprint of the original 1st ed. 1997)
H.C. Hege, K. Polthier
R1,595 Discovery Miles 15 950 Ships in 10 - 15 working days

Visualization and mathematics have begun a fruitful relationship, establishing links between problems and solutions of both fields. In some areas of mathematics, like differential geometry and numerical mathematics, visualization techniques are applied with great success. However, visualization methods are relying heavily on mathematical concepts.
Applications of visualization in mathematical research and the use of mathematical methods in visualization have been topic of an international workshop in Berlin in June 1995. Selected contributions treat topics of particular interest in current research. Experts are reporting on their latest work, giving an overview on this fascinating new area. The reader will get insight to state-of-the-art techniques for solving visualization problems and mathematical questions.

Parallel Processing of Discrete Problems (Paperback, Softcover reprint of the original 1st ed. 1999): Panos M. Pardalos Parallel Processing of Discrete Problems (Paperback, Softcover reprint of the original 1st ed. 1999)
Panos M. Pardalos
R1,548 Discovery Miles 15 480 Ships in 10 - 15 working days

In the past two decades, breakthroughs in computer technology have made a tremendous impact on optimization. In particular, availability of parallel computers has created substantial interest in exploring the use of parallel processing for solving discrete and global optimization problems. The chapters in this volume cover a broad spectrum of recent research in parallel processing of discrete and related problems. The topics discussed include distributed branch-and-bound algorithms, parallel genetic algorithms for large scale discrete problems, simulated annealing, parallel branch-and-bound search under limited-memory constraints, parallelization of greedy randomized adaptive search procedures, parallel optical models of computing, randomized parallel algorithms, general techniques for the design of parallel discrete algorithms, parallel algorithms for the solution of quadratic assignment and satisfiability problems. The book will be a valuable source of information to faculty, students and researchers in combinatorial optimization and related areas.

Handbook of Formal Languages - Volume 3 Beyond Words (Paperback, Softcover reprint of the original 1st ed. 1997): Grzegorz... Handbook of Formal Languages - Volume 3 Beyond Words (Paperback, Softcover reprint of the original 1st ed. 1997)
Grzegorz Rozenberg, Arto Salomaa
R1,665 Discovery Miles 16 650 Ships in 10 - 15 working days

The need for a comprehensive survey-type exposition on formal languages and related mainstream areas of computer science has been evident for some years. In the early 1970s, when . the book Formal Languages by the second mentioned editor appeared, it was still quite feasible to write a comprehensive book with that title and include also topics of current research interest. This would not be possible anymore. A standard-sized book on formal languages would either have to stay on a fairly low level or else be specialized and restricted to some narrow sector of the field. The setup becomes drastically different in a collection of contributions, where the best authorities in the world join forces, each of them concentrat ing on their own areas of specialization. The present three-volume Handbook constitutes such a unique collection. In these three volumes we present the current state of the art in formal language theory. We were most satisfied with the enthusiastic response given to our request for contributions by specialists representing various subfields. The need for a Handbook of Formal Languages was in many answers expressed in different ways: as an easily accessible his torical reference, a general source of information, an overall course-aid, and a compact collection of material for self-study. We are convinced that the final result will satisfy such various needs. The theory of formal languages constitutes the stem or backbone of the field of science now generally known as theoretical computer science.

Rapid Serial Visual Presentation - Design for Cognition (Paperback, 2013 ed.): Robert Spence, Mark Witkowski Rapid Serial Visual Presentation - Design for Cognition (Paperback, 2013 ed.)
Robert Spence, Mark Witkowski
R1,508 Discovery Miles 15 080 Ships in 10 - 15 working days

A powerful new image presentation technique has evolved over the last twenty years, and its value demonstrated through its support of many and varied common tasks. Conceptually, Rapid Serial Visual Presentation (RSVP) is basically simple, exemplified in the physical world by the rapid riffling of the pages of a book in order to locate a known image. Advances in computation and graphics processing allow RSVP to be applied flexibly and effectively to a huge variety of common tasks such as window shopping, video fast-forward and rewind, TV channel selection and product browsing. At its heart is a remarkable feature of the human visual processing system known as pre-attentive processing, one which supports the recognition of a known image within as little as one hundred milliseconds and without conscious cognitive effort. Knowledge of pre-attentive processing, together with extensive empirical evidence concerning RSVP, has allowed the authors to provide useful guidance to interaction designers wishing to explore the relevance of RSVP to an application, guidance which is supported by a variety of illustrative examples.

Emerging Applications of Number Theory (Paperback, Softcover reprint of the original 1st ed. 1999): Dennis A. Hejhal, Joel... Emerging Applications of Number Theory (Paperback, Softcover reprint of the original 1st ed. 1999)
Dennis A. Hejhal, Joel Friedman, Martin C. Gutzwiller, Andrew M. Odlyzko
R3,072 Discovery Miles 30 720 Ships in 10 - 15 working days

Most people tend to view number theory as the very paradigm of pure mathematics. With the advent of computers, however, number theory has been finding an increasing number of applications in practical settings, such as in cryptography, random number generation, coding theory, and even concert hall acoustics. Yet other applications are still emerging - providing number theorists with some major new areas of opportunity. The 1996 IMA summer program on Emerging Applications of Number Theory was aimed at stimulating further work with some of these newest (and most attractive) applications. Concentration was on number theory's recent links with: (a) wave phenomena in quantum mechanics (more specifically, quantum chaos); and (b) graph theory (especially expander graphs and related spectral theory). This volume contains the contributed papers from that meeting and will be of interest to anyone intrigued by novel applications of modern number-theoretical techniques.

Grid Generation and Adaptive Algorithms (Paperback, Softcover reprint of the original 1st ed. 1999): Marshall W. Bern, Joseph... Grid Generation and Adaptive Algorithms (Paperback, Softcover reprint of the original 1st ed. 1999)
Marshall W. Bern, Joseph E. Flaherty, Mitchell Luskin
R1,532 Discovery Miles 15 320 Ships in 10 - 15 working days

This IMA Volume in Mathematics and its Applications GRID GENERATION AND ADAPTIVE ALGORITHMS is based on the proceedings of a workshop with the same title. The work shop was an integral part of the 1996-97 IMA program on "MATHEMAT ICS IN HIGH-PERFORMANCE COMPUTING. " I would like to thank Marshall Bern (Xerox, Palo Alto Research Cen ter), Joseph E. Flaherty (Department of Computer Science, Rensselaer Polytechnic Institute), and Mitchell Luskin (School of Mathematics, Uni versity of Minnesota), for their excellent work as organizers of the meeting and for editing the proceedings. I also take this opportunity to thank the National Science Founda tion (NSF), Department of Energy (DOE), and the Army Research Office (ARO), whose financial support made the workshop possible. Willard Miller, Jr. , Professor and Director v PREFACE Scientific and engineering computation has become so complex that traditional numerical computation on uniform meshes is generally not pos sible or too expensive. Mesh generation must reflect both the domain geometry and the expected solution characteristics. Meshes should, fur thermore, be related to the solution through computable estimates of dis cretization errors. This, suggests an automatic and adaptive process where an initial mesh is enriched with the goal of computing a solution with prescribed accuracy specifications in an optimal manner. While automatic mesh generation procedures and adaptive strategies are becoming available, major computational challenges remain. Three-dimensional mesh genera tion is still far from automatic.

Structured Adaptive Mesh Refinement (SAMR) Grid Methods (Paperback, Softcover reprint of the original 1st ed. 2000): Scott B.... Structured Adaptive Mesh Refinement (SAMR) Grid Methods (Paperback, Softcover reprint of the original 1st ed. 2000)
Scott B. Baden, Nikos P. Chrisochoides, Dennis B. Gannon, Michael L. Norman
R1,530 Discovery Miles 15 300 Ships in 10 - 15 working days

The papers presented here describe research to improve the general understanding of the application of SAMR to practical problems, to identify issues critical to efficient and effective implementation on high performance computers and to stimulate the development of a community code repository for software including benchmarks to assist in the evaluation of software and compiler technologies. The ten chapters have been divided into two parts reflecting two major issues in the topic: programming complexity of SAMR algorithms and the applicability and numerical challenges of SAMR methods.

Algorithms for Parallel Processing (Paperback, Softcover reprint of the original 1st ed. 1999): Michael T. Heath, Abhiram... Algorithms for Parallel Processing (Paperback, Softcover reprint of the original 1st ed. 1999)
Michael T. Heath, Abhiram Ranade, Robert S. Schreiber
R2,975 Discovery Miles 29 750 Ships in 10 - 15 working days

This IMA Volume in Mathematics and its Applications ALGORITHMS FOR PARALLEL PROCESSING is based on the proceedings of a workshop that was an integral part of the 1996-97 IMA program on "MATHEMATICS IN HIGH-PERFORMANCE COMPUTING. " The workshop brought together algorithm developers from theory, combinatorics, and scientific computing. The topics ranged over models, linear algebra, sorting, randomization, and graph algorithms and their analysis. We thank Michael T. Heath of University of lllinois at Urbana (Com puter Science), Abhiram Ranade of the Indian Institute of Technology (Computer Science and Engineering), and Robert S. Schreiber of Hewlett Packard Laboratories for their excellent work in organizing the workshop and editing the proceedings. We also take this opportunity to thank the National Science Founda tion (NSF) and the Army Research Office (ARO), whose financial support made the workshop possible. A vner Friedman Robert Gulliver v PREFACE The Workshop on Algorithms for Parallel Processing was held at the IMA September 16 - 20, 1996; it was the first workshop of the IMA year dedicated to the mathematics of high performance computing. The work shop organizers were Abhiram Ranade of The Indian Institute of Tech nology, Bombay, Michael Heath of the University of Illinois, and Robert Schreiber of Hewlett Packard Laboratories. Our idea was to bring together researchers who do innovative, exciting, parallel algorithms research on a wide range of topics, and by sharing insights, problems, tools, and methods to learn something of value from one another."

Mathematics - Key Technology for the Future - Joint Projects between Universities and Industry (Paperback, Softcover reprint of... Mathematics - Key Technology for the Future - Joint Projects between Universities and Industry (Paperback, Softcover reprint of the original 1st ed. 2003)
Willi Jager, Hans-Joachim Krebs
R1,696 Discovery Miles 16 960 Ships in 10 - 15 working days

Efficient transfer between science and society is crucial for their future development. The rapid progress of information technology and computer systems offers a large potential and new perspectives for solving complex problems. Mathematical modelling and simulation have become important tools not only in scientific investigations but also in analysing, planning and controlling technological and economic processes. Mathematics, imbedded in an interdisciplinary concept, has become a key technology.

The book covers the results of a variety of major projects in industrial mathematics following an initiative of the German Federal Ministry of Education and Research. All projects are collaborations of industrial companies and university-based researchers, and range from automotive industry to computer technology and medical visualisation. In general, the projects presented in this volume prove that new mathematical ideas and methods can be decisive for the solution of industrial and economic problems.

Graph Drawing Software (Paperback, Softcover reprint of the original 1st ed. 2004): Michael Junger, Petra Mutzel Graph Drawing Software (Paperback, Softcover reprint of the original 1st ed. 2004)
Michael Junger, Petra Mutzel
R4,491 Discovery Miles 44 910 Ships in 10 - 15 working days

Automatic Graph Drawing is concerned with the layout of relational structures as they occur in Computer Science (Data Base Design, Data Mining, Web Mining), Bioinformatics (Metabolic Networks), Businessinformatics (Organization Diagrams, Event Driven Process Chains), or the Social Sciences (Social Networks).

In mathematical terms, such relational structures are modeled as graphs or more general objects such as hypergraphs, clustered graphs, or compound graphs. A variety of layout algorithms that are based on graph theoretical foundations have been developed in the last two decades and implemented in software systems.

After an introduction to the subject area and a concise treatment of the technical foundations for the subsequent chapters, this book features 14 chapters on state-of-the-art graph drawing software systems, ranging from general "tool boxes'' to customized software for various applications. These chapters are written by leading experts, they follow a uniform scheme and can be read independently from each other.

Greedoids (Paperback, Softcover reprint of the original 1st ed. 1991): Bernhard Korte, Laszlo Lovasz, Rainer Schrader Greedoids (Paperback, Softcover reprint of the original 1st ed. 1991)
Bernhard Korte, Laszlo Lovasz, Rainer Schrader
R1,549 Discovery Miles 15 490 Ships in 10 - 15 working days

Oh cieca cupidigia, oh ira folie, Che si ci sproni nella vita corta, E nell' eterna poi si mal c'immolle! o blind greediness and foolish rage, That in our fleeting life so goads us on And plunges us in boiling blood for ever! Dante, The Divine Comedy Inferno, XII, 17, 49/51. On an afternoon hike during the second Oberwolfach conference on Mathematical Programming in January 1981, two of the authors of this book discussed a paper by another two of the authors (Korte and Schrader [1981]) on approximation schemes for optimization problems over independence systems and matroids. They had noticed that in many proofs the hereditary property of independence systems and matroids is not needed: it is not required that every subset of a feasible set is again feasible. A much weaker property is sufficient, namely that every feasible set of cardinality k contains (at least) one feasible subset of cardinality k - 1. We called this property accessibility, and that was the starting point of our investigations on greedoids.

Moment Maps and Combinatorial Invariants of Hamiltonian Tn-spaces (Paperback, Softcover reprint of the original 1st ed. 1994):... Moment Maps and Combinatorial Invariants of Hamiltonian Tn-spaces (Paperback, Softcover reprint of the original 1st ed. 1994)
Victor Guillemin
R2,908 Discovery Miles 29 080 Ships in 10 - 15 working days

The action of a compact Lie group, G, on a compact sympletic manifold gives rise to some remarkable combinatorial invariants. The simplest and most interesting of these is the moment polytopes, a convex polyhedron which sits inside the dual of the Lie algebra of G. One of the main goals of this monograph is to describe what kinds of geometric information are encoded in this polytope. This book is addressed to researchers and can be used as a semester text.

Data Correcting Approaches in Combinatorial Optimization (Paperback, 2012 ed.): Boris I. Goldengorin, Panos M. Pardalos Data Correcting Approaches in Combinatorial Optimization (Paperback, 2012 ed.)
Boris I. Goldengorin, Panos M. Pardalos
R1,432 Discovery Miles 14 320 Ships in 10 - 15 working days

"Data Correcting Approaches in Combinatorial Optimization" focuses on algorithmic applications of thewell known polynomially solvable special cases of computationally intractable problems. The purpose of this text is to design practically efficient algorithms for solving wide classes of combinatorial optimization problems. Researches, students and engineers will benefit from new bounds and branching rules in development efficient branch-and-bound type computational algorithms. This book examines applications for solving the Traveling Salesman Problem and its variations, Maximum Weight Independent Set Problem, Different Classes of Allocation and Cluster Analysis as well as some classes of Scheduling Problems. Data Correcting Algorithms in Combinatorial Optimization introduces the data correcting approach to algorithms which provide an answer to the following questions: how to construct a bound to the original intractable problem and findwhich element of the corrected instance one should branch such that the total size of search tree will be minimized. The PC time needed for solving intractable problems will be adjusted with the requirements for solving real world problems. "

Concepts & Images - Visual Mathematics (Paperback, Softcover reprint of the original 1st ed. 1993): Arthur Loeb Concepts & Images - Visual Mathematics (Paperback, Softcover reprint of the original 1st ed. 1993)
Arthur Loeb
R2,932 Discovery Miles 29 320 Ships in 10 - 15 working days

1. Introduction . 1 2. Areas and Angles . . 6 3. Tessellations and Symmetry 14 4. The Postulate of Closest Approach 28 5. The Coexistence of Rotocenters 36 6. A Diophantine Equation and its Solutions 46 7. Enantiomorphy. . . . . . . . 57 8. Symmetry Elements in the Plane 77 9. Pentagonal Tessellations . 89 10. Hexagonal Tessellations 101 11. Dirichlet Domain 106 12. Points and Regions 116 13. A Look at Infinity . 122 14. An Irrational Number 128 15. The Notation of Calculus 137 16. Integrals and Logarithms 142 17. Growth Functions . . . 149 18. Sigmoids and the Seventh-year Trifurcation, a Metaphor 159 19. Dynamic Symmetry and Fibonacci Numbers 167 20. The Golden Triangle 179 21. Quasi Symmetry 193 Appendix I: Exercise in Glide Symmetry . 205 Appendix II: Construction of Logarithmic Spiral . 207 Bibliography . 210 Index . . . . . . . . . . . . . . . . . . . . 225 Concepts and Images is the result of twenty years of teaching at Harvard's Department of Visual and Environmental Studies in the Carpenter Center for the Visual Arts, a department devoted to turning out students articulate in images much as a language department teaches reading and expressing one self in words. It is a response to our students' requests for a "handout" and to l our colleagues' inquiries about the courses: Visual and Environmental Studies 175 (Introduction to Design Science), YES 176 (Synergetics, the Structure of Ordered Space), Studio Arts 125a (Design Science Workshop, Two-Dimension al), Studio Arts 125b (Design Science Workshop, Three-Dimensional),2 as well as my freshman seminars on Structure in Science and Art."

Introduction to Coding Theory (Paperback, 3rd ed. 1999. Softcover reprint of the original 3rd ed. 1999): J. H. van Lint Introduction to Coding Theory (Paperback, 3rd ed. 1999. Softcover reprint of the original 3rd ed. 1999)
J. H. van Lint
R2,430 Discovery Miles 24 300 Ships in 10 - 15 working days

It is gratifying that this textbook is still sufficiently popular to warrant a third edition. I have used the opportunity to improve and enlarge the book. When the second edition was prepared, only two pages on algebraic geometry codes were added. These have now been removed and replaced by a relatively long chapter on this subject. Although it is still only an introduction, the chapter requires more mathematical background of the reader than the remainder of this book. One of the very interesting recent developments concerns binary codes defined by using codes over the alphabet 7l.4 There is so much interest in this area that a chapter on the essentials was added. Knowledge of this chapter will allow the reader to study recent literature on 7l. -codes. 4 Furthermore, some material has been added that appeared in my Springer Lec ture Notes 201, but was not included in earlier editions of this book, e. g. Generalized Reed-Solomon Codes and Generalized Reed-Muller Codes. In Chapter 2, a section on "Coding Gain" ( the engineer's justification for using error-correcting codes) was added. For the author, preparing this third edition was a most welcome return to mathematics after seven years of administration. For valuable discussions on the new material, I thank C.P.l.M.Baggen, I. M.Duursma, H.D.L.Hollmann, H. C. A. van Tilborg, and R. M. Wilson. A special word of thanks to R. A. Pellikaan for his assistance with Chapter 10."

An Introduction to Convex Polytopes (Paperback, Softcover reprint of the original 1st ed. 1983): Arne Brondsted An Introduction to Convex Polytopes (Paperback, Softcover reprint of the original 1st ed. 1983)
Arne Brondsted
R1,524 Discovery Miles 15 240 Ships in 10 - 15 working days

The aim of this book is to introduce the reader to the fascinating world of convex polytopes. The highlights of the book are three main theorems in the combinatorial theory of convex polytopes, known as the Dehn-Sommerville Relations, the Upper Bound Theorem and the Lower Bound Theorem. All the background information on convex sets and convex polytopes which is m eded to under stand and appreciate these three theorems is developed in detail. This background material also forms a basis for studying other aspects of polytope theory. The Dehn-Sommerville Relations are classical, whereas the proofs of the Upper Bound Theorem and the Lower Bound Theorem are of more recent date: they were found in the early 1970's by P. McMullen and D. Barnette, respectively. A famous conjecture of P. McMullen on the charac terization off-vectors of simplicial or simple polytopes dates from the same period; the book ends with a brief discussion of this conjecture and some of its relations to the Dehn-Sommerville Relations, the Upper Bound Theorem and the Lower Bound Theorem. However, the recent proofs that McMullen's conditions are both sufficient (L. J. Billera and C. W. Lee, 1980) and necessary (R. P. Stanley, 1980) go beyond the scope of the book. Prerequisites for reading the book are modest: standard linear algebra and elementary point set topology in R1d will suffice."

The Graph Isomorphism Problem - Its Structural Complexity (Paperback, Softcover reprint of the original 1st ed. 1993): J.... The Graph Isomorphism Problem - Its Structural Complexity (Paperback, Softcover reprint of the original 1st ed. 1993)
J. Kobler, U. Schoening, J. Toran
R2,944 Discovery Miles 29 440 Ships in 10 - 15 working days

Recently, a variety ofresults on the complexitystatusofthegraph isomorphism problem has been obtained. These results belong to the so-called structural part of Complexity Theory. Our idea behind this book is to summarize such results which might otherwise not be easily accessible in the literature, and also, to give the reader an understanding of the aims and topics in Structural Complexity Theory, in general. The text is basically self contained; the only prerequisite for reading it is some elementary knowledge from Complexity Theory and Probability Theory. It can be used to teach a seminar or a monographic graduate course, but also parts of it (especially Chapter 1) provide a source of examples for a standard graduate course on Complexity Theory. Many people have helped us in different ways III the process of writing this book. Especially, we would like to thank V. Arvind, R.V. Book, E. May ordomo, and the referee who gave very constructive comments. This book project was especially made possible by a DAAD grant in the "Acciones In tegrada" program. The third author has been supported by the ESPRIT project ALCOM-II."

Algebraic Combinatorics and Computer Science - A Tribute to Gian-Carlo Rota (Paperback, Softcover reprint of the original 1st... Algebraic Combinatorics and Computer Science - A Tribute to Gian-Carlo Rota (Paperback, Softcover reprint of the original 1st ed. 2001)
H. Crapo, D. Senato
R3,026 Discovery Miles 30 260 Ships in 10 - 15 working days

This book, dedicated to the memory of Gian-Carlo Rota, is the result of a collaborative effort by his friends, students and admirers. Rota was one of the great thinkers of our times, innovator in both mathematics and phenomenology. I feel moved, yet touched by a sense of sadness, in presenting this volume of work, despite the fear that I may be unworthy of the task that befalls me. Rota, both the scientist and the man, was marked by a generosity that knew no bounds. His ideas opened wide the horizons of fields of research, permitting an astonishing number of students from all over the globe to become enthusiastically involved. The contagious energy with which he demonstrated his tremendous mental capacity always proved fresh and inspiring. Beyond his renown as gifted scientist, what was particularly striking in Gian-Carlo Rota was his ability to appreciate the diverse intellectual capacities of those before him and to adapt his communications accordingly. This human sense, complemented by his acute appreciation of the importance of the individual, acted as a catalyst in bringing forth the very best in each one of his students. Whosoever was fortunate enough to enjoy Gian-Carlo Rota's longstanding friendship was most enriched by the experience, both mathematically and philosophically, and had occasion to appreciate son cote de bon vivant. The book opens with a heartfelt piece by Henry Crapo in which he meticulously pieces together what Gian-Carlo Rota's untimely demise has bequeathed to science.

Imaging Heat and Mass Transfer Processes - Visualization and Analysis (Paperback, 2013 ed.): Pradipta Kumar Panigrahi,... Imaging Heat and Mass Transfer Processes - Visualization and Analysis (Paperback, 2013 ed.)
Pradipta Kumar Panigrahi, Krishnamurthy Muralidhar
R1,516 Discovery Miles 15 160 Ships in 10 - 15 working days

Imaging Heat and Mass Transfer Processes: Visualization and Analysis applies Schlieren and shadowgraph techniques to complex heat and mass transfer processes. Several applications are considered where thermal and concentration fields play a central role. These include vortex shedding and suppression from stationary and oscillating bluff bodies such as cylinders, convection around crystals growing from solution, and buoyant jets. Many of these processes are unsteady and three dimensional. The interpretation and analysis of images recorded are discussed in the text.

A Textbook of Graph Theory (Paperback, 2nd ed. 2012): R. Balakrishnan, K. Ranganathan A Textbook of Graph Theory (Paperback, 2nd ed. 2012)
R. Balakrishnan, K. Ranganathan
R1,941 Discovery Miles 19 410 Ships in 10 - 15 working days

This second edition includes two new chapters: one on domination in graphs and the other on the spectral properties of graphs, the latter including a discussion on graph energy. The chapter on graph colorings has been enlarged, covering additional topics such as homomorphisms and colorings and the uniqueness of the Mycielskian up to isomorphism. This book also introduces several interesting topics such as Dirac's theorem on k-connected graphs, Harary-Nashwilliam's theorem on the hamiltonicity of line graphs, Toida-McKee's characterization of Eulerian graphs, the Tutte matrix of a graph, Fournier's proof of Kuratowski's theorem on planar graphs, the proof of the nonhamiltonicity of the Tutte graph on 46 vertices, and a concrete application of triangulated graphs.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Hieronymus Bosch
Virginia Pitts Rembert Hardcover R974 Discovery Miles 9 740
The Passenger
Ulrich Alexander Boschwitz Paperback R430 R402 Discovery Miles 4 020
All or Nothing and Other Pages
Michael Gibbs Paperback R544 Discovery Miles 5 440
Mass Spectrometry-Based Lipidomics…
Fong-Fu Hsu Hardcover R5,291 Discovery Miles 52 910
The Hastings Center Guidelines for…
Nancy Berlinger, Bruce Jennings, … Hardcover R4,291 Discovery Miles 42 910
Turn & Burn - The Scriptwriter's Guide…
Cj Walley Hardcover R705 Discovery Miles 7 050
Poor Puss - A Social History of English…
Marilyn Crowther Paperback R779 Discovery Miles 7 790
Labyrinth: Bestiary - A Definitive Guide…
Iris Compiet, St Bende Hardcover R717 R604 Discovery Miles 6 040
Methods of Applied Mathematics with a…
Jon H. Davis Hardcover R3,002 R2,439 Discovery Miles 24 390
Contemporary Perspectives in Data…
Kenneth D. Lawrence, Ronald K. Klimberg Hardcover R2,656 Discovery Miles 26 560

 

Partners