- Home
- Mathematics
- Combinatorics
- Combinatorial Enumeration
Combinatorial Enumeration
List Price:
$34.95
- Availability: Confirm prior to ordering
- Branding: minimum 50 pieces (add’l costs below)
- Check Freight Rates (branded products only)
Branding Options (v), Availability & Lead Times
- 1-Color Imprint: $2.00 ea.
- Promo-Page Insert: $2.50 ea. (full-color printed, single-sided page)
- Belly-Band Wrap: $2.50 ea. (full-color printed)
- Set-Up Charge: $45 per decoration
- Availability: Product availability changes daily, so please confirm your quantity is available prior to placing an order.
- Branded Products: allow 10 business days from proof approval for production. Branding options may be limited or unavailable based on product design or cover artwork.
- Unbranded Products: allow 3-5 business days for shipping. All Unbranded items receive FREE ground shipping in the US. Inquire for international shipping.
- RETURNS/CANCELLATIONS: All orders, branded or unbranded, are NON-CANCELLABLE and NON-RETURNABLE once a purchase order has been received.
Product Details
Author:
Ian P. Goulden, David M. Jackson
Format:
Paperback
Pages:
608
Publisher:
Dover Publications (June 23, 2004)
Language:
English
ISBN-13:
9780486435978
ISBN-10:
0486435970
Weight:
25.6oz
Dimensions:
5.5" x 8.5"
Case Pack:
14
Series:
Dover Books on Mathematics
File:
Dover-Dover_08032024_P7614837_onix30_Complete-20240803.xml
Folder:
Dover
As low as:
$33.20
List Price:
$34.95
Publisher Identifier:
P-DOVER
Discount Code:
D
Audience:
College/higher education
Pub Discount:
65
Overview
This graduate-level text presents an encyclopedic account of the mathematical theory and problem-solving techniques associated with enumeration problems. Its approach blends combinatorial and algebraic ideas to offer insights into a wide variety of problems, and each section of the book focuses on a specific discrete structure, advancing from elementary (often classical) results to those at research level. Subjects include the combinatorics of the ordinary generating function and the exponential generating function, the combinatorics of sequences, and the combinatorics of paths. The text is complemented by approximately 350 exercises with full solutions. 1983 edition. Foreword by Gian-Carlo Rota. References. Index.
