
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
This book concentrates on two distinct areas in discrete mathematics. The first section deals with combinatorics, loosely defined as the study of counting. We provide functions for generating combinatorial objects such as permutations, partitions, and Young tableaux, as well as for studying various aspects of these structures.The second section considers graph theory, which can be defined equally loosely as the study of binary relations. We consider a wide variety of graphs, provide functions to create them, and functions to show what special properties they have, Although graphs are combinatorial structures, understanding them requires pictures or embeddings. Thus we provide functions to create a variety of graph embeddings, so the same structure can be viewed in several different ways. Algorithmic graph theory is an important interface between mathematics and computer science, and so we study a variety of polynominal and exponential time problems.
This text investigates the practical application of Mathematica to solve complex problems within the fields of combinatorics and graph theory. Author Steven Skiena, a recognized expert in algorithms and discrete mathematics, provides a computational framework that bridges theoretical concepts with algorithmic implementation. By utilizing Mathematica as a primary tool, the book offers a methodology for generating combinatorial structures and analyzing graph properties through both symbolic computation and visual representation.
What You Will Find
Experts and students in computer science frequently cite this work as a practical bridge between abstract mathematical theory and functional programming. Readers often note the utility of the provided Mathematica functions for visualizing complex structures that are otherwise difficult to conceptualize.
Page Count:
334
Publication Date:
1990-01-21
Publisher:
Basic Books
ISBN-10:
0201509431
ISBN-13:
9780201509434
No comments yet. Be the first to share your thoughts!