• Title Foundations of Combinatorics with Applications
• Author(s) Edward A. Bender and S. Gill Williamson
• Publisher: Dover Publications (February 6, 2006)
• Paperback 480 pages
• eBook PDF and PostScript
• Language: English
• ISBN-10: 0486446034
• ISBN-13: 978-0486446035
• Share This:  

Book Description

This introduction to combinatorics, the foundation of the interaction between computer science and mathematics, is suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics.

The four-part treatment begins with a section on counting and listing that covers basic counting, functions, decision trees, and sieving methods. The following section addresses fundamental concepts in graph theory and a sampler of graph topics. The third part examines a variety of applications relevant to computer science and mathematics, including induction and recursion, sorting theory, and rooted plane trees. The final section, on generating functions, offers students a powerful tool for studying counting problems. Numerous exercises appear throughout the text, along with notes and references.

The text concludes with solutions to odd-numbered exercises and to all appendix exercises.

• Edward A. Bender is a Professor Emeritus of Mathematics at University of California, San Diego. He received his Ph.D. in Mathematics at California Institute of Technology in 1966.

• Amazon

• Combinatorics
• Game Theory
• Graph Theory
• Discrete and Finite Mathematics

• Foundations of Combinatorics with Applications (Edward A. Bender, et al)
• The Mirror Site (1) - PDF, ePub, etc.
• The Mirror Site (2) - PDF

• Combinatorics Through Guided Discovery (Kenneth P. Bogart)

  This book is an introduction to combinatorial mathematics, also known as combinatorics. The book focuses especially but not exclusively on the part of combinatorics that mathematicians refer to as 'counting'.

• Introduction to Ramsey Theory (Veselin Jungic)

  This book serves as a gentle introduction to Ramsey Theory for readers interested in becoming familiar with a dynamic segment of contemporary mathematics that combines ideas from number theory and combinatorics.

• Applied Combinatorics (Mitchel T. Keller, et al)

  This is a text with more than enough material for a one-semester introduction to combinatorics. The original target audience was primarily computer science majors, but the topics included make it suitable for a variety of different students.

• Analytic Combinatorics (Philippe Flajolet, et al)

  The definitive treatment of analytic combinatorics. This self-contained text covers the mathematics underlying the analysis of discrete structures, with thorough treatment of a large number of applications.

• An Introduction to Combinatorics and Graph Theory

  This book walks the reader through the classic parts of Combinatorics and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques.

• Lists, Decisions and Graphs - With an Introduction to Probability

  In this book, four basic areas of discrete mathematics are presented: Counting and Listing (Unit CL), Functions (Unit Fn), Decision Trees and Recursion (Unit DT), and Basic Concepts in Graph Theory (Unit GT).

• Magic Squares and Cubes (William Symes Andrews)

  This book cover topics such as magic squares, magic cubes, the Franklin squares, magics and Pythagorean numbers, the theory of reversions, magic circles, spheres, and stars, and magic octahedroids, among other things.