Amazon.com: Discrete Mathematics (9780821841518): Martin Aigner: Books


or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
More Buying Choices
Have one to sell? Sell yours here
Discrete Mathematics
 
 
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Discrete Mathematics [Hardcover]

Martin Aigner (Author)
5.0 out of 5 stars  See all reviews (1 customer review)

Price: $61.00 & this item ships for FREE with Super Saver Shipping. Details
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
Only 1 left in stock--order soon (more on the way).
Want it delivered Monday, February 27? Choose One-Day Shipping at checkout. Details
Textbook Student FREE Two-Day Shipping for students on millions of items. Learn more


Book Description

March 14, 2007 0821841513 978-0821841518
The advent of fast computers and the search for efficient algorithms revolutionized combinatorics and brought about the field of discrete mathematics. This book is an introduction to the main ideas and results of discrete mathematics, and with its emphasis on algorithms it should be interesting to mathematicians and computer scientists alike. The book is organized into three parts: enumeration, graphs and algorithms, and algebraic systems. There are 600 exercises with hints and solutions to about half of them. The only prerequisites for understanding everything in the book are linear algebra and calculus at the undergraduate level. Martin Aigner is a professor of mathematics at the Free University of Berlin. He received his PhD at the University of Vienna and has held a number of positions in the USA and Germany before moving to Berlin. He is the author of several books on discrete mathematics, graph theory, and the theory of search. The Monthly article Turan's graph theorem earned him a 1995 Lester R. Ford Prize of the MAA for expository writing, and his book Proofs from the BOOK with Günter M. Ziegler has been an international success with translations into 12 languages.


Editorial Reviews

Review

Praise for the German edition ... This book is a well-written introduction to discrete mathematics and is highly recommended to every student of mathematics and computer science as well as to teachers of these topics. -- --Konrad Engel for MathSciNet

Product Details

  • Hardcover: 388 pages
  • Publisher: American Mathematical Society (March 14, 2007)
  • Language: English
  • ISBN-10: 0821841513
  • ISBN-13: 978-0821841518
  • Product Dimensions: 10.2 x 7.2 x 1 inches
  • Shipping Weight: 1.9 pounds (View shipping rates and policies)
  • Average Customer Review: 5.0 out of 5 stars  See all reviews (1 customer review)
  • Amazon Best Sellers Rank: #2,433,392 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

 

Customer Reviews

1 Review
5 star:
 (1)
4 star:    (0)
3 star:    (0)
2 star:    (0)
1 star:    (0)
 
 
 
 
 
Average Customer Review
5.0 out of 5 stars (1 customer review)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

2 of 3 people found the following review helpful:
5.0 out of 5 stars advanced book on discrete mathematics, July 27, 2008
This review is from: Discrete Mathematics (Hardcover)
This is an advanced book on discrete mathematics. The concepts, theorems and proofs are given clearly and concisely with no frills. It is an accurate, well-written book but readers need to be familiar with the basics of discrete mathematics to appreciate this book. Beginners should start with a more elementary text such as Discrete Mathematics and Its Applications by Rosen. Another highly recommended book by Aigner is Proofs from the BOOK. You should take a look at this one.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
 
 
 
Only search this product's reviews



Inside This Book (learn more)
First Sentence:
We would like to present here some fundamental rules on which all counting is based. Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
counting coefficients, admissible flow, rising factorials, optimal vertex, integer partitions, logical net, cycle indicator, repetition code, vert ices, admissible solutions, parity check matrix, increasing path, pigeonhole principle, vertex cover, current vertex, cyclic codes, dual program, cycle representation, internal vertices
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Boolean Algebras
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:



Suggested Tags from Similar Products

 (What's this?)
Be the first one to add a relevant tag (keyword that's strongly related to this product).
 
(1)
(1)

Your tags: Add your first tag
 

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums


Listmania!


Create a Listmania! list

So You'd Like to...


Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject