東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Introduction to combinatorics /

Erickson, Martin J., (1963-)

Linked to FindBook

Google Book

Amazon

博客來

Introduction to combinatorics /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Introduction to combinatorics // Martin J. Erickson.
Author:	Erickson, Martin J.,
Published:	Hoboken, New Jersey :John Wiley & Sons, : 2013.,
Description:	xli, 230 p. :ill. ;25 cm.
Subject:	Combinatorial analysis. -
ISBN:	9781118637531 (hbk.) :

Introduction to combinatorics /
Erickson, Martin J.,1963-

Introduction to combinatorics /Martin J. Erickson. - 2nd ed. - Hoboken, New Jersey :John Wiley & Sons,2013. - xli, 230 p. :ill. ;25 cm. - Wiley series in discrete mathematics and optimization. - Wiley series in discrete mathematics and optimization..

Includes bibliographical references (pages 223-224) and index.

Praise for the First Edition--"This excellent text should prove a useful accoutrement for any developing mathematics program. it's short, it's sweet, it's beautifully written."--The Mathematical Intelligencer"Erickson has prepared an exemplary work. strongly recommended for inclusion in undergraduate-level library collections." --ChoiceFeaturing a modern approach, Introduction to Combinatorics, Second Edition illustrates the applicability of combinatorial methods and discusses topics that are not typically addressed in literature, such as Alcuin's sequence, Rook paths, and Leech's lattice. The book also presents fundamental results, discusses interconnection and problem-solving techniques, and collects and disseminates open problems that raise questions and observations. Many important combinatorial methods are revisited and repeated several times throughout the book in exercises, examples, theorems, and proofs alike, allowing readers to build confidence and reinforce their understanding of complex material. In addition, the author successfully guides readers step-by-step through three major achievements of combinatorics: Van der Waerden's theorem on arithmetic progressions, Polya's graph enumeration formula, and Leech's 24-dimensional lattice. Along with updated tables and references that reflect recent advances in various areas, such as error-correcting codes and combinatorial designs, the Second Edition also features: Many new exercises to help readers understand and apply combinatorial techniques and ideas A deeper, investigative study of combinatorics through exercises requiring the use of computer programs Over fifty new examples, ranging in level from routine to advanced, that illustrate important combinatorial concepts Basic principles and theories in combinatorics as well as new and innovative results in the field Introduction to Combinatorics, Second Edition is an ideal textbook for a one- or two-semester sequence in combinatorics, graph theory, and discrete mathematics at the upper-undergraduate level. The book is also an excellent reference for anyone interested in the various applications of elementary combinatorics.

ISBN: 9781118637531 (hbk.) :US94.95

LCCN: 2013002850Subjects--Topical Terms:

523878
Combinatorial analysis.

LC Class. No.: QA164 / .E74 2013

Dewey Class. No.: 511/.6

Introduction to combinatorics /
LDR:02972cam a2200265 i 4500 001 1931875
003 OCoLC
005 20141117112147.0
008 140826s2013 njua b 001 0 eng
010 $a 2013002850
020 $a 9781118637531 (hbk.) : $c US94.95
020 $a 1118637534 (hbk.)
020 $a 9781118637586 (ebk.)
020 $a 1118637585 (ebk.)
020 $a 9781118640210
020 $a 1118640217
040 $a DLC $b eng
050 0 0 $a QA164 $b .E74 2013
082 0 0 $a 511/.6 $2 23
100 1 $a Erickson, Martin J., $d 1963- $3 629819
245 1 0 $a Introduction to combinatorics / $c Martin J. Erickson.
250 $a 2nd ed.
260 # $a Hoboken, New Jersey : $b John Wiley & Sons, $c 2013.
300 $a xli, 230 p. : $b ill. ; $c 25 cm.
490 1 0 $a Wiley series in discrete mathematics and optimization
504 $a Includes bibliographical references (pages 223-224) and index.
520 # $a Praise for the First Edition--"This excellent text should prove a useful accoutrement for any developing mathematics program. it's short, it's sweet, it's beautifully written."--The Mathematical Intelligencer"Erickson has prepared an exemplary work. strongly recommended for inclusion in undergraduate-level library collections." --ChoiceFeaturing a modern approach, Introduction to Combinatorics, Second Edition illustrates the applicability of combinatorial methods and discusses topics that are not typically addressed in literature, such as Alcuin's sequence, Rook paths, and Leech's lattice. The book also presents fundamental results, discusses interconnection and problem-solving techniques, and collects and disseminates open problems that raise questions and observations. Many important combinatorial methods are revisited and repeated several times throughout the book in exercises, examples, theorems, and proofs alike, allowing readers to build confidence and reinforce their understanding of complex material. In addition, the author successfully guides readers step-by-step through three major achievements of combinatorics: Van der Waerden's theorem on arithmetic progressions, Polya's graph enumeration formula, and Leech's 24-dimensional lattice. Along with updated tables and references that reflect recent advances in various areas, such as error-correcting codes and combinatorial designs, the Second Edition also features: Many new exercises to help readers understand and apply combinatorial techniques and ideas A deeper, investigative study of combinatorics through exercises requiring the use of computer programs Over fifty new examples, ranging in level from routine to advanced, that illustrate important combinatorial concepts Basic principles and theories in combinatorics as well as new and innovative results in the field Introduction to Combinatorics, Second Edition is an ideal textbook for a one- or two-semester sequence in combinatorics, graph theory, and discrete mathematics at the upper-undergraduate level. The book is also an excellent reference for anyone interested in the various applications of elementary combinatorics.
650 # 0 $a Combinatorial analysis. $3 523878
830 0 $a Wiley series in discrete mathematics and optimization. $3 2070365