It is the book version of the e-journal "Contemporary Studies in Discrete Mathematics" published by Contemporary Studies in Discrete Mathematics, Thrissur, India.
Reflecting many of the recent advances and trends in this area, this classroom-tested text covers the core topics in discrete structures as outlined by the ACM and explores an assortment of novel applications, including simulations, genetic algorithms, network flows, probabilistic primality tests, public key cryptography, and coding theory. It p
The philosophy of mathematics is an exciting subject. Philosophy of Mathematics: Classic and Contemporary Studies explores the foundations of mathematical thought. The aim of this book is to encourage young mathematicians to think about the philosophical issues behind fundamental concepts and about different views on mathematical objects and mathematical knowledge. With this new approach, the author rekindles an interest in philosophical subjects surrounding the foundations of mathematics. He offers the mathematical motivations behind the topics under debate. He introduces various philosophical positions ranging from the classic views to more contemporary ones, including subjects which are more engaged with mathematical logic. Most books on philosophy of mathematics have little to no focus on the effects of philosophical views on mathematical practice, and no concern on giving crucial mathematical results and their philosophical relevance, consequences, reasons, etc. This book fills this gap. The book can be used as a textbook for a one-semester or even one-year course on philosophy of mathematics. "Other textbooks on the philosophy of mathematics are aimed at philosophers. This book is aimed at mathematicians. Since the author is a mathematician, it is a valuable addition to the literature." - Mark Balaguer, California State University, Los Angeles "There are not many such texts available for mathematics students. I applaud efforts to foster the dialogue between mathematics and philosophy." - Michele Friend, George Washington University and CNRS, Lille, France
A variety of modern research in analysis and discrete mathematics is provided in this book along with applications in cryptographic methods and information security, in order to explore new techniques, methods, and problems for further investigation. Distinguished researchers and scientists in analysis and discrete mathematics present their research. Graduate students, scientists and engineers, interested in a broad spectrum of current theories, methods, and applications in interdisciplinary fields will find this book invaluable.
Discrete mathematics stands among the leading disciplines of mathematics and theoretical computer science. This is due primarily to its increasing role in university curriculae and its growing importance in applications ranging from optimization to molecular biology. An inaugural conference was held cooperatively by DIMATIA and DIMACS to focus on the versatility, width, and depth of current progress in the subject area. This volume offers a well-balanced blend of research and survey papers reflecting the exciting, attractive topics in contemporary discrete mathematics. Discussed in the book are topics such as graph theory, partially ordered sets, geometrical Ramsey theory, computational complexity issues and applications.
This textbook can serve as a comprehensive manual of discrete mathematics and graph theory for non-Computer Science majors; as a reference and study aid for professionals and researchers who have not taken any discrete math course before. It can also be used as a reference book for a course on Discrete Mathematics in Computer Science or Mathematics curricula. The study of discrete mathematics is one of the first courses on curricula in various disciplines such as Computer Science, Mathematics and Engineering education practices. Graphs are key data structures used to represent networks, chemical structures, games etc. and are increasingly used more in various applications such as bioinformatics and the Internet. Graph theory has gone through an unprecedented growth in the last few decades both in terms of theory and implementations; hence it deserves a thorough treatment which is not adequately found in any other contemporary books on discrete mathematics, whereas about 40% of this textbook is devoted to graph theory. The text follows an algorithmic approach for discrete mathematics and graph problems where applicable, to reinforce learning and to show how to implement the concepts in real-world applications.
This text offers students clarity and instructors flexibility. Its thorough coverage of applications, algorithms, and examples, and its inclusion of many proofs explain and reinforce the material. Its traditional organization makes it a suitable text for several courses. Attention to contemporary topics such as key cryptosystems and coding theory makes the text current. It is flexible enough to be used for courses in applied algebra or modern (abstract) algebra.
This volume is a collection of survey papers in combinatorics that have grown out of lectures given in the workshop on Probabilistic Combinatorics at the Paul Erdös Summer Research Center in Mathematics in Budapest. The papers, reflecting the many facets of modern-day combinatorics, will be appreciated by specialists and general mathematicians alike: assuming relatively little background, each paper gives a quick introduction to an active area, enabling the reader to learn about the fundamental results and appreciate some of the latest developments. An important feature of the articles, very much in the spirit of Erdös, is the abundance of open problems.
This approachable text studies discrete objects and the relationsips that bind them. It helps students understand and apply the power of discrete math to digital computer systems and other modern applications. It provides excellent preparation for courses in linear algebra, number theory, and modern/abstract algebra and for computer science courses in data structures, algorithms, programming languages, compilers, databases, and computation.* Covers all recommended topics in a self-contained, comprehensive, and understandable format for students and new professionals * Emphasizes problem-solving techniques, pattern recognition, conjecturing, induction, applications of varying nature, proof techniques, algorithm development and correctness, and numeric computations* Weaves numerous applications into the text* Helps students learn by doing with a wealth of examples and exercises: - 560 examples worked out in detail - More than 3,700 exercises - More than 150 computer assignments - More than 600 writing projects* Includes chapter summaries of important vocabulary, formulas, and properties, plus the chapter review exercises* Features interesting anecdotes and biographies of 60 mathematicians and computer scientists* Instructor's Manual available for adopters* Student Solutions Manual available separately for purchase (ISBN: 0124211828)