Professor Dominic Welsh has made significant contributions to the fields of combinatorics and discrete probability, including matroids, complexity, and percolation, and has taught, influenced and inspired generations of students and researchers in mathematics. This volume summarizes and reviews the consistent themes from his work through a series of articles written by renowned experts. These articles contain original research work, set in a broader context by the inclusion of review material. As a reference text in its own right, this book will be valuable to academic researchers, research students, and others seeking an introduction to the relevant contemporary aspects of these fields.
Combinatorics, Complexity, and Chance
and over one million other books are available for Amazon Kindle.
Learn more
FREE Two-Day Shipping for students on millions of items. Learn more |
| |||||||||||||||
Book Description
Editorial Reviews
Review
Dominic Welsh has made major contributions to the fields of combinatorics and discrete probability. This volume summarises and reviews the consistent themes from his work through a series of articles written by renowed experts. These articles contain original research work, set in a broader context by the inclusion of review material. L'enseignement Mathematique
About the Author
Dominic Welsh has been the resident mathematician at Merton College, Oxford, for about 40 years, where he has guided and influenced generations of undergraduate and graduate students. Prior to his formal retirement in 2005, he was a Professor in the Mathematical Institute at Oxford University, where he served as Chairman for five years. Dominic Welsh is a leading figure worldwide in aspects of combinatorics and probability, including matroids, complexity, and percolation. Geoffrey Grimmett graduated under Dominic Welsh in 1971. He worked in Bristol University for 16 years before moving to Cambridge in 1992 as Professor of Mathematical Statistics. He is currently Head of the Department of Pure Mathematics and Mathematical Statistics, and a professorial fellow of Churchill College. His main interests lie in probability theory and rigorous statistical mechanics, and he is the author of successful texts on percolation theory and the random-cluster model. Colin McDiarmid gained his DPhil under Dominic Welsh in 1975. After a brief spell at the London School of Economics he became a fellow of Wolfson College, Oxford and then a fellow of Corpus Christi College. He is currently Professor of Combinatorics and Head of the Department of Statistics. His main interests lie in combinatorial theory, particularly in random structures and algorithms.
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
A question that we meet in an elementary course on combinatorics or probability is: How many ways can we select n objects from a set of k objects? Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
random planar graphs, coboundary polynomial, big tope, labelled planar graphs, tension polynomials, hypergraph conjecture, orientable matroids, linear hypergraph, strong spatial mixing, cutset space, local uniformity property, unknotting problem, path coupling lemma, ternary matroids, rank generating function, binary matroids, recipe theorem, reorientation classes, representable matroids, balanced matroid, transversal matroids, connected matroids, random colourings, matroid theory, cycle matroid Key Phrases - Capitalized Phrases (CAPs): (learn more)
Theory Ser, Cambridge University Press, Dominic Welsh, New York, Discrete Math, Academic Press, London Math, Oxford University Press, Discrete Algorithms, Las Vergnas, Graph Minors Structure Theorem, Proof Let, British Combinatorial Conference, François Jaeger, University of Oxford, Cambridge Philos, Discrete Applied Mathematics, Dominic's Problem, Graph Structure Theory, Contemporary Mathematics, Finite Fields Appl, Journal of Mathematical Physics, Minor-Recognition Conjecture, Oxford Ser, Proof First New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
A question that we meet in an elementary course on combinatorics or probability is: How many ways can we select n objects from a set of k objects? Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
random planar graphs, coboundary polynomial, big tope, labelled planar graphs, tension polynomials, hypergraph conjecture, orientable matroids, linear hypergraph, strong spatial mixing, cutset space, local uniformity property, unknotting problem, path coupling lemma, ternary matroids, rank generating function, binary matroids, recipe theorem, reorientation classes, representable matroids, balanced matroid, transversal matroids, connected matroids, random colourings, matroid theory, cycle matroid Key Phrases - Capitalized Phrases (CAPs): (learn more)
Theory Ser, Cambridge University Press, Dominic Welsh, New York, Discrete Math, Academic Press, London Math, Oxford University Press, Discrete Algorithms, Las Vergnas, Graph Minors Structure Theorem, Proof Let, British Combinatorial Conference, François Jaeger, University of Oxford, Cambridge Philos, Discrete Applied Mathematics, Dominic's Problem, Graph Structure Theory, Contemporary Mathematics, Finite Fields Appl, Journal of Mathematical Physics, Minor-Recognition Conjecture, Oxford Ser, Proof First New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Books on Related Topics
(learn more)
|
|
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
