{
"item_title" : "A First Course in Combinatorial Mathematics",
"item_author" : [" Ian Anderson "],
"item_description" : "Now in a new second edition, this volume presents a clear and concise treatment of an increasingly important branch of mathematics. A unique introductory survey complete with easy-to-understand examples and sample problems, this text includes information on such basic combinatorial tools as recurrence relations, generating functions, incidence matrices, and the non-exclusion principle. It also provides a study of block designs, Steiner triple systems, and expanded coverage of the marriage theorem, as well as a unified account of three important constructions which are significant in coding theory.",
"item_img_path" : "https://covers2.booksamillion.com/covers/bam/0/19/859/674/019859674X_b.jpg",
"price_data" : {
"retail_price" : "65.00", "online_price" : "65.00", "our_price" : "65.00", "club_price" : "65.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Overview
Now in a new second edition, this volume presents a clear and concise treatment of an increasingly important branch of mathematics. A unique introductory survey complete with easy-to-understand examples and sample problems, this text includes information on such basic combinatorial tools as recurrence relations, generating functions, incidence matrices, and the non-exclusion principle. It also provides a study of block designs, Steiner triple systems, and expanded coverage of the marriage theorem, as well as a unified account of three important constructions which are significant in coding theory.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9780198596745
- ISBN-10: 019859674X
- Publisher: Oxford University Press
- Publish Date: November 1989
- Dimensions: 8.75 x 5.63 x 0.57 inches
- Shipping Weight: 0.69 pounds
- Page Count: 144
Related Categories
