Jaroslav Nešet^D%ril - Böcker
Visar alla böcker från författaren Jaroslav Nešet^D%ril. Handla med fri frakt och snabb leverans.
3 produkter
3 produkter
2 846 kr
Skickas inom 5-8 vardagar
This book is a clear and self-contained introduction to discrete mathematics. Aimed mainly at undergraduate and early graduate students of mathematics and computer science, it is written with the goal of stimulating interest in mathematics and an active, problem-solving approach to the presented material. The reader is led to an understanding of the basic principles and methods of actually doing mathematics (and having fun at that). Being more narrowly focused than many discrete mathematics textbooks and treating selected topics in an unusual depth and from several points of view, the book reflects the conviction of the authors, active and internationally renowned mathematicians, that the most important gain from studying mathematics is the cultivation of clear and logical thinking and habits useful for attacking new problems. More than 400 enclosed exercises with a wide range of difficulty, many of them accompanied by hints for solution, support this approach to teaching. The readers will appreciate the lively and informal style of the text accompanied by more than 200 drawings and diagrams. Specialists in various parts of science with a basic mathematical education wishing to apply discrete mathematics in their field can use the book as a useful source, and even experts in combinatorics may occasionally learn from pointers to research literature or from presentations of recent results. Invitation to Discrete Mathematics should make a delightful reading both for beginners and for mathematical professionals.The main topics include: elementary counting problems, asymptotic estimates, partially ordered sets, basic graph theory and graph algorithms, finite projective planes, elementary probability and the probabilistic method, generating functions, Ramsey's theorem, and combinatorial applications of linear algebra. General mathematical notions going beyond the high-school level are thoroughly explained in the introductory chapter. An appendix summarizes the undergraduate algebra needed in some of the more advanced sections of the book.
2 372 kr
Skickas inom 3-6 vardagar
Graph theory and especially the study of graph homomorphisms has developed exponentially in the last couple of decades. Originally based on the authors' graduate course lecture notes, this is still the only book devoted entirely to graph homomorphisms, bringing together the highlights of the theory and its many applications. It offers a useful perspective on more traditional graph theory topics such as graph reconstruction, various forms of graph colouring, graph products, automorphism groups, chordality, and interval graphs, and has applications in complexity theory, artificial intelligence, telecommunication, and statistical physics. It is intended to be a sampler of this rich subject and focuses on its most interesting results, techniques, and applications, including its algebraic, combinatorial, and algorithmic aspects. The book discusses most of the recent developments in the field, such as the disproof of the Hedetniemi Product Conjecture, the proof of the Feder-Vardi Dichotomy Conjecture of constraint satisfaction problems, as well as the celebrated theory of graph convergence and graphons. The text contains exercises of varying difficulty, intended to support readers' learning and further development.
661 kr
Skickas
Graph theory and especially the study of graph homomorphisms has developed exponentially in the last couple of decades. Originally based on the authors' graduate course lecture notes, this is still the only book devoted entirely to graph homomorphisms, bringing together the highlights of the theory and its many applications. It offers a useful perspective on more traditional graph theory topics such as graph reconstruction, various forms of graph colouring, graph products, automorphism groups, chordality, and interval graphs, and has applications in complexity theory, artificial intelligence, telecommunication, and statistical physics. It is intended to be a sampler of this rich subject and focuses on its most interesting results, techniques, and applications, including its algebraic, combinatorial, and algorithmic aspects. The book discusses most of the recent developments in the field, such as the disproof of the Hedetniemi Product Conjecture, the proof of the Feder-Vardi Dichotomy Conjecture of constraint satisfaction problems, as well as the celebrated theory of graph convergence and graphons. The text contains exercises of varying difficulty, intended to support readers' learning and further development.