You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Berge's Principles of Combinatorics is now an acknowledged classic work of the field. Complementary to his previous books, Berge's introduction deals largely with enumeration. The choice of topics is balanced, the presentation elegant, and the text can be followed by anyone with an interest in the subject with only a little algebra required as a background. Some topics were here described for the first time, including Robinston-Shensted theorum, the Eden-Schutzenberger theorum, and facts connecting Young diagrams, trees, and the symmetric group.
In July 2004, a conference on graph theory was held in Paris in memory of Claude Berge, one of the pioneers of the field. The event brought together many prominent specialists on topics such as perfect graphs and matching theory, upon which Claude Berge's work has had a major impact. This volume includes contributions to these and other topics from many of the participants.
Graph Theory has proved to be an extremely useful tool for solving combinatorial problems in such diverse areas as Geometry, Algebra, Number Theory, Topology, Operations Research and Optimization. It is natural to attempt to generalise the concept of a graph, in order to attack additional combinatorial problems. The idea of looking at a family of sets from this standpoint took shape around 1960. In regarding each set as a ``generalised edge'' and in calling the family itself a ``hypergraph'', the initial idea was to try to extend certain classical results of Graph Theory such as the theorems of Turán and König. It was noticed that this generalisation often led to simplification; moreover, one single statement, sometimes remarkably simple, could unify several theorems on graphs. This book presents what seems to be the most significant work on hypergraphs.
Algorithmic Graph Theory and Perfect Graphs provides an introduction to graph theory through practical problems. This book presents the mathematical and algorithmic properties of special classes of perfect graphs. Organized into 12 chapters, this book begins with an overview of the graph theoretic notions and the algorithmic design. This text then examines the complexity analysis of computer algorithm and explains the differences between computability and computational complexity. Other chapters consider the parameters and properties of a perfect graph and explore the class of perfect graphs known as comparability graph or transitively orientable graphs. This book discusses as well the two characterizations of triangulated graphs, one algorithmic and the other graph theoretic. The final chapter deals with the method of performing Gaussian elimination on a sparse matrix wherein an arbitrary choice of pivots may result in the filling of some zero positions with nonzeros. This book is a valuable resource for mathematicians and computer scientists.
**Also an Academy Award–winning film starring Russell Crowe and Jennifer Connelly—directed by Ron Howard** The powerful, dramatic biography of math genius John Nash, who overcame serious mental illness and schizophrenia to win the Nobel Prize. “How could you, a mathematician, believe that extraterrestrials were sending you messages?” the visitor from Harvard asked the West Virginian with the movie-star looks and Olympian manner. “Because the ideas I had about supernatural beings came to me the same way my mathematical ideas did,” came the answer. “So I took them seriously.” Thus begins the true story of John Nash, the mathematical genius who was a legend by age thirty when he slipped into madness, and who—thanks to the selflessness of a beautiful woman and the loyalty of the mathematics community—emerged after decades of ghostlike existence to win a Nobel Prize for triggering the game theory revolution. The inspiration for an Academy Award–winning movie, Sylvia Nasar’s now-classic biography is a drama about the mystery of the human mind, triumph over adversity, and the healing power of love.
This book provides a comprehensive introduction to modern global variational theory on fibred spaces. It is based on differentiation and integration theory of differential forms on smooth manifolds, and on the concepts of global analysis and geometry such as jet prolongations of manifolds, mappings, and Lie groups. The book will be invaluable for researchers and PhD students in differential geometry, global analysis, differential equations on manifolds, and mathematical physics, and for the readers who wish to undertake further rigorous study in this broad interdisciplinary field. Featured topics - Analysis on manifolds - Differential forms on jet spaces - Global variational functionals - Eu...
"These notes are about the process of design: the process of inventing things which display new physical order, organization, form, in response to function." This book, opening with these words, presents an entirely new theory of the process of design. In the first part of the book, Christopher Alexander discusses the process by which a form is adapted to the context of human needs and demands that has called it into being. He shows that such an adaptive process will be successful only if it proceeds piecemeal instead of all at once. It is for this reason that forms from traditional un-self-conscious cultures, molded not by designers but by the slow pattern of changes within tradition, are s...