HomeGroupsTalkZeitgeist
Hide this

Results from Google Books

Click on a thumbnail to go to Google Books.

Introduction to Combinatorics (Discrete…
Loading...

Introduction to Combinatorics (Discrete Mathematics and Its Applications)

by Alan Slomson

MembersReviewsPopularityAverage ratingConversations
6None1,268,033 (4)None

None.

None
Loading...

Sign up for LibraryThing to find out whether you'll like this book.

No current Talk conversations about this book.

No reviews
no reviews | add a review
You must log in to edit Common Knowledge data.
For more help see the Common Knowledge help page.
Series (with order)
Canonical title
Original title
Alternative titles
Original publication date
People/Characters
Important places
Important events
Related movies
Awards and honors
Epigraph
Dedication
First words
Quotations
Last words
Disambiguation notice
Publisher's editors
Blurbers
Publisher series
Original language

References to this work on external resources.

Wikipedia in English

None

Book description
Haiku summary

Amazon.com Product Description (ISBN 0412353709, Paperback)

The growth in digital devices, which require discrete formulation of problems, has revitalized the role of combinatorics, making it indispensable to computer science. Furthermore, the challenges of new technologies have led to its use in industrial processes, communications systems, electrical networks, organic chemical identification, coding theory, economics, and more. With a unique approach, Introduction to Combinatorics builds a foundation for problem-solving in any of these fields.

Although combinatorics deals with finite collections of discrete objects, and as such differs from continuous mathematics, the two areas do interact. The author, therefore, does not hesitate to use methods drawn from continuous mathematics, and in fact shows readers the relevance of abstract, pure mathematics to real-world problems. The author has structured his chapters around concrete problems, and as he illustrates the solutions, the underlying theory emerges. His focus is on counting problems, beginning with the very straightforward and ending with the complicated problem of counting the number of different graphs with a given number of vertices.

Its clear, accessible style and detailed solutions to many of the exercises, from routine to challenging, provided at the end of the book make Introduction to Combinatorics ideal for self-study as well as for structured coursework.

(retrieved from Amazon Thu, 12 Mar 2015 18:19:49 -0400)

No library descriptions found.

Quick Links

Swap Ebooks Audio
1 pay

Popular covers

Rating

Average: (4)
0.5
1
1.5
2
2.5
3
3.5
4 1
4.5
5

Is this you?

Become a LibraryThing Author.

 

About | Contact | Privacy/Terms | Help/FAQs | Blog | Store | APIs | TinyCat | Legacy Libraries | Early Reviewers | Common Knowledge | 119,641,876 books! | Top bar: Always visible