Constructive Combinatorics (Undergraduate Texts in Mathematics)

0 avg rating
( 0 ratings by Goodreads )
 
9780387963471: Constructive Combinatorics (Undergraduate Texts in Mathematics)
View all copies of this ISBN edition:
 
 

The notes that eventually became this book were written between 1977 and 1985 for the course called Constructive Combinatorics at the University of Minnesota. This is a one-quarter (10 week) course for upper level undergraduate students. The class usually consists of mathematics and computer science majors, with an occasional engineering student. Several graduate students in computer science also attend. At Minnesota, Constructive Combinatorics is the third quarter of a three quarter sequence. The fIrst quarter, Enumerative Combinatorics, is at the level of the texts by Bogart [Bo], Brualdi [Br], Liu [Li] or Tucker [Tu] and is a prerequisite for this course. The second quarter, Graph Theory and Optimization, is not a prerequisite. We assume that the students are familiar with the techniques of enumeration: basic counting principles, generating functions and inclusion/exclusion. This course evolved from a course on combinatorial algorithms. That course contained a mixture of graph algorithms, optimization and listing algorithms. The computer assignments generally consisted of testing algorithms on examples. While we felt that such material was useful and not without mathematical content, we did not think that the course had a coherent mathematical focus. Furthermore, much of it was being taught, or could have been taught, elsewhere. Graph algorithms and optimization, for instance, were inserted into the graph theory course where they naturally belonged. The computer science department already taught some of the material: the simpler algorithms in a discrete mathematics course; effIciency of algorithms in a more advanced course.

"synopsis" may belong to another edition of this title.

From the Back Cover:

The notes that eventually became this book were written between 1977 and 1985 for the course called Constructive Combinatorics at the University of Minnesota. This is a one-quarter (10 week) course for upper level undergraduate students. The class usually consists of mathematics and computer science majors, with an occasional engineering student.

"About this title" may belong to another edition of this title.

Buy New View Book
List Price: US$ 74.99
US$ 66.00

Convert currency

Shipping: FREE
From United Kingdom to U.S.A.

Destination, rates & speeds

Add to Basket

Top Search Results from the AbeBooks Marketplace

1.

Dennis W. Stanton, Dennis White
Published by Springer-Verlag New York Inc., United States (1986)
ISBN 10: 0387963472 ISBN 13: 9780387963471
New Paperback Quantity Available: 1
Seller:
The Book Depository
(London, United Kingdom)
Rating
[?]

Book Description Springer-Verlag New York Inc., United States, 1986. Paperback. Condition: New. 1986 ed.. Language: English . Brand New Book. The notes that eventually became this book were written between 1977 and 1985 for the course called Constructive Combinatorics at the University of Minnesota. This is a one-quarter (10 week) course for upper level undergraduate students. The class usually consists of mathematics and computer science majors, with an occasional engineering student. Several graduate students in computer science also attend. At Minnesota, Constructive Combinatorics is the third quarter of a three quarter sequence. The fIrst quarter, Enumerative Combinatorics, is at the level of the texts by Bogart [Bo], Brualdi [Br], Liu [Li] or Tucker [Tu] and is a prerequisite for this course. The second quarter, Graph Theory and Optimization, is not a prerequisite. We assume that the students are familiar with the techniques of enumeration: basic counting principles, generating functions and inclusion/exclusion. This course evolved from a course on combinatorial algorithms. That course contained a mixture of graph algorithms, optimization and listing algorithms. The computer assignments generally consisted of testing algorithms on examples. While we felt that such material was useful and not without mathematical content, we did not think that the course had a coherent mathematical focus. Furthermore, much of it was being taught, or could have been taught, elsewhere. Graph algorithms and optimization, for instance, were inserted into the graph theory course where they naturally belonged. The computer science department already taught some of the material: the simpler algorithms in a discrete mathematics course; effIciency of algorithms in a more advanced course. Seller Inventory # KNV9780387963471

More information about this seller | Contact this seller

Buy New
US$ 66.00
Convert currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, rates & speeds

2.

Dennis W. Stanton, Dennis White
Published by Springer-Verlag New York Inc., United States (1986)
ISBN 10: 0387963472 ISBN 13: 9780387963471
New Paperback Quantity Available: 1
Seller:
Book Depository International
(London, United Kingdom)
Rating
[?]

Book Description Springer-Verlag New York Inc., United States, 1986. Paperback. Condition: New. 1986 ed.. Language: English . Brand New Book. The notes that eventually became this book were written between 1977 and 1985 for the course called Constructive Combinatorics at the University of Minnesota. This is a one-quarter (10 week) course for upper level undergraduate students. The class usually consists of mathematics and computer science majors, with an occasional engineering student. Several graduate students in computer science also attend. At Minnesota, Constructive Combinatorics is the third quarter of a three quarter sequence. The fIrst quarter, Enumerative Combinatorics, is at the level of the texts by Bogart [Bo], Brualdi [Br], Liu [Li] or Tucker [Tu] and is a prerequisite for this course. The second quarter, Graph Theory and Optimization, is not a prerequisite. We assume that the students are familiar with the techniques of enumeration: basic counting principles, generating functions and inclusion/exclusion. This course evolved from a course on combinatorial algorithms. That course contained a mixture of graph algorithms, optimization and listing algorithms. The computer assignments generally consisted of testing algorithms on examples. While we felt that such material was useful and not without mathematical content, we did not think that the course had a coherent mathematical focus. Furthermore, much of it was being taught, or could have been taught, elsewhere. Graph algorithms and optimization, for instance, were inserted into the graph theory course where they naturally belonged. The computer science department already taught some of the material: the simpler algorithms in a discrete mathematics course; effIciency of algorithms in a more advanced course. Seller Inventory # KNV9780387963471

More information about this seller | Contact this seller

Buy New
US$ 68.84
Convert currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, rates & speeds

3.

Dennis Stanton (author), Dennis White (author)
Published by Springer New York 1986-05-15, New York (1986)
ISBN 10: 0387963472 ISBN 13: 9780387963471
New paperback Quantity Available: 10
Seller:
Blackwell's
(Oxford, OX, United Kingdom)
Rating
[?]

Book Description Springer New York 1986-05-15, New York, 1986. paperback. Condition: New. Seller Inventory # 9780387963471

More information about this seller | Contact this seller

Buy New
US$ 61.39
Convert currency

Add to Basket

Shipping: US$ 7.65
From United Kingdom to U.S.A.
Destination, rates & speeds

4.

Dennis W. Stanton, Dennis White
Published by Springer-Verlag New York Inc., United States (1986)
ISBN 10: 0387963472 ISBN 13: 9780387963471
New Paperback Quantity Available: 10
Seller:
Book Depository hard to find
(London, United Kingdom)
Rating
[?]

Book Description Springer-Verlag New York Inc., United States, 1986. Paperback. Condition: New. 1986 ed.. Language: English . This book usually ship within 10-15 business days and we will endeavor to dispatch orders quicker than this where possible. Brand New Book. The notes that eventually became this book were written between 1977 and 1985 for the course called Constructive Combinatorics at the University of Minnesota. This is a one-quarter (10 week) course for upper level undergraduate students. The class usually consists of mathematics and computer science majors, with an occasional engineering student. Several graduate students in computer science also attend. At Minnesota, Constructive Combinatorics is the third quarter of a three quarter sequence. The fIrst quarter, Enumerative Combinatorics, is at the level of the texts by Bogart [Bo], Brualdi [Br], Liu [Li] or Tucker [Tu] and is a prerequisite for this course. The second quarter, Graph Theory and Optimization, is not a prerequisite. We assume that the students are familiar with the techniques of enumeration: basic counting principles, generating functions and inclusion/exclusion. This course evolved from a course on combinatorial algorithms. That course contained a mixture of graph algorithms, optimization and listing algorithms. The computer assignments generally consisted of testing algorithms on examples. While we felt that such material was useful and not without mathematical content, we did not think that the course had a coherent mathematical focus. Furthermore, much of it was being taught, or could have been taught, elsewhere. Graph algorithms and optimization, for instance, were inserted into the graph theory course where they naturally belonged. The computer science department already taught some of the material: the simpler algorithms in a discrete mathematics course; effIciency of algorithms in a more advanced course. Seller Inventory # LIE9780387963471

More information about this seller | Contact this seller

Buy New
US$ 70.70
Convert currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, rates & speeds

5.

Stanton, Dennis
Published by Springer-Verlag New York Inc. (1986)
ISBN 10: 0387963472 ISBN 13: 9780387963471
New Quantity Available: > 20
Print on Demand
Seller:
Pbshop
(Wood Dale, IL, U.S.A.)
Rating
[?]

Book Description Springer-Verlag New York Inc., 1986. PAP. Condition: New. New Book. Shipped from US within 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9780387963471

More information about this seller | Contact this seller

Buy New
US$ 66.90
Convert currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

6.

Stanton, Dennis / White, Dennis
ISBN 10: 0387963472 ISBN 13: 9780387963471
New Quantity Available: 1
Seller:
Rating
[?]

Book Description Condition: New. Publisher/Verlag: Springer, Berlin | The notes that eventually became this book were written between 1977 and 1985 for the course called Constructive Combinatorics at the University of Minnesota. This is a one-quarter (10 week) course for upper level undergraduate students. The class usually consists of mathematics and computer science majors, with an occasional engineering student. Several graduate students in computer science also attend. At Minnesota, Constructive Combinatorics is the third quarter of a three quarter sequence. The fIrst quarter, Enumerative Combinatorics, is at the level of the texts by Bogart [Bo], Brualdi [Br], Liu [Li] or Tucker [Tu] and is a prerequisite for this course. The second quarter, Graph Theory and Optimization, is not a prerequisite. We assume that the students are familiar with the techniques of enumeration: basic counting principles, generating functions and inclusion/exclusion. This course evolved from a course on combinatorial algorithms. That course contained a mixture of graph algorithms, optimization and listing algorithms. The computer assignments generally consisted of testing algorithms on examples. While we felt that such material was useful and not without mathematical content, we did not think that the course had a coherent mathematical focus. Furthermore, much of it was being taught, or could have been taught, elsewhere. Graph algorithms and optimization, for instance, were inserted into the graph theory course where they naturally belonged. The computer science department already taught some of the material: the simpler algorithms in a discrete mathematics course; effIciency of algorithms in a more advanced course. | 1 Listing Basic Combinatorial Objects.- 1.1 Permutations.- 1.2 Subsets.- 1.3 Integer Partitions.- 1.4 Product Spaces.- 1.5 Set Partitions.- Notes.- Exercises.- 2 Partially Ordered Sets.- 2.1 Six Posets.- 2.2 Matching the Boolean Algebra.- 2.3 The Littlewood-Offord Problem.- 2.4 Extremal Set Theory.- Notes.- Exercises.- 3 Bijections.- 3.1 The Catalan Family.- 3.2 The Prüfer Correspondence.- 3.3 Partitions.- 3.4 Permutations.- 3.5 Tableaux.- 3.6 The Schensted Correspondence.- 3.7 Properties of the Schensted Correspondence.- Notes.- Exercises.- 4 Involutions.- 4.1 The Euler Pentagonal Number Theorem.- 4.2 Vandermonde's Determinant.- 4.3 The Cayley-Hamilton Theorem.- 4.4 The Matrix-Tree Theorem.- 4.5 Lattice Paths.- 4.6 The Involution Principle.- Notes.- Exercises.- A.1 Permutations.- A.2 Subsets.- A.3 Set Partitions.- A.4 Integer Partitions.- A.5 Product Spaces.- A.6 Match to First Available.- A.7 The Schensted Correspondence.- A.8 The Prüfer Correspondence.- A.9 The Involution Principle. | Format: Paperback | Language/Sprache: english | 311 gr | 235x155x10 mm | 186 pp. Seller Inventory # K9780387963471

More information about this seller | Contact this seller

Buy New
US$ 74.18
Convert currency

Add to Basket

Shipping: US$ 3.15
From Germany to U.S.A.
Destination, rates & speeds

7.

Dennis Stanton, Dennis White
Published by Springer (1986)
ISBN 10: 0387963472 ISBN 13: 9780387963471
New Hardcover Quantity Available: 1
Seller:
Ergodebooks
(RICHMOND, TX, U.S.A.)
Rating
[?]

Book Description Springer, 1986. Hardcover. Condition: New. Seller Inventory # DADAX0387963472

More information about this seller | Contact this seller

Buy New
US$ 73.66
Convert currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

8.

Stanton, Dennis
Published by Springer (2016)
ISBN 10: 0387963472 ISBN 13: 9780387963471
New Paperback Quantity Available: 1
Print on Demand
Seller:
Ria Christie Collections
(Uxbridge, United Kingdom)
Rating
[?]

Book Description Springer, 2016. Paperback. Condition: New. PRINT ON DEMAND Book; New; Publication Year 2016; Not Signed; Fast Shipping from the UK. No. book. Seller Inventory # ria9780387963471_lsuk

More information about this seller | Contact this seller

Buy New
US$ 74.44
Convert currency

Add to Basket

Shipping: US$ 4.92
From United Kingdom to U.S.A.
Destination, rates & speeds

9.

Stanton, Dennis
Published by Springer-Verlag New York Inc. (1986)
ISBN 10: 0387963472 ISBN 13: 9780387963471
New Quantity Available: > 20
Print on Demand
Seller:
Books2Anywhere
(Fairford, GLOS, United Kingdom)
Rating
[?]

Book Description Springer-Verlag New York Inc., 1986. PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9780387963471

More information about this seller | Contact this seller

Buy New
US$ 69.41
Convert currency

Add to Basket

Shipping: US$ 11.48
From United Kingdom to U.S.A.
Destination, rates & speeds

10.

DENNIS STANTON
Published by Springer (1986)
ISBN 10: 0387963472 ISBN 13: 9780387963471
New Paperback Quantity Available: 1
Seller:
Herb Tandree Philosophy Books
(Stroud, GLOS, United Kingdom)
Rating
[?]

Book Description Springer, 1986. Paperback. Condition: NEW. 9780387963471 This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. For all enquiries, please contact Herb Tandree Philosophy Books directly - customer service is our primary goal. Seller Inventory # HTANDREE0411300

More information about this seller | Contact this seller

Buy New
US$ 72.25
Convert currency

Add to Basket

Shipping: US$ 10.18
From United Kingdom to U.S.A.
Destination, rates & speeds

There are more copies of this book

View all search results for this book