國立虎尾科技大學 |

Solomon Golomb’s Course on Undergraduate Combinatorics

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Solomon Golomb’s Course on Undergraduate Combinatorics/ by Solomon W. Golomb, Andy Liu.
作者:	Golomb, Solomon W.
其他作者:	Liu, Andy.
面頁冊數:	XVIII, 458 p.online resource. :
Contained By:	Springer Nature eBook
標題:	Combinatorics. -
電子資源:	https://doi.org/10.1007/978-3-030-72228-9
ISBN:	9783030722289

Solomon Golomb’s Course on Undergraduate Combinatorics
Golomb, Solomon W.

Solomon Golomb’s Course on Undergraduate Combinatorics[electronic resource] /by Solomon W. Golomb, Andy Liu. - 1st ed. 2021. - XVIII, 458 p.online resource.

0. Basic Tools -- 1. Combinations -- 2. Recurrence Relations and Generating Functions -- 3. Permutations -- 4. Special Numbers -- 5. Counting Under Symmetries -- 6. Combinatorial Structures -- A. Additional Exercises -- B. Additional Examples -- C. Solutions to Odd-numbered Exercises -- Bibliography -- Index.

This textbook offers an accessible introduction to combinatorics, infused with Solomon Golomb’s insights and illustrative examples. Core concepts in combinatorics are presented with an engaging narrative that suits undergraduate study at any level. Featuring early coverage of the Principle of Inclusion-Exclusion and a unified treatment of permutations later on, the structure emphasizes the cohesive development of ideas. Combined with the conversational style, this approach is especially well suited to independent study. Falling naturally into three parts, the book begins with a flexible Chapter Zero that can be used to cover essential background topics, or as a standalone problem-solving course. The following three chapters cover core topics in combinatorics, such as combinations, generating functions, and permutations. The final three chapters present additional topics, such as Fibonacci numbers, finite groups, and combinatorial structures. Numerous illuminating examples are included throughout, along with exercises of all levels. Three appendices include additional exercises, examples, and solutions to a selection of problems. Solomon Golomb’s Course on Undergraduate Combinatorics is ideal for introducing mathematics students to combinatorics at any stage in their program. There are no formal prerequisites, but readers will benefit from mathematical curiosity and a willingness to engage in the book’s many entertaining challenges.

ISBN: 9783030722289

Standard No.: 10.1007/978-3-030-72228-9doiSubjects--Topical Terms:

669353
Combinatorics.

LC Class. No.: QA164-167.2

Dewey Class. No.: 511.6

Solomon Golomb’s Course on Undergraduate Combinatorics
LDR:03121nam a22003975i 4500 001 1049003
003 DE-He213
005 20210913101133.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030722289 $9 978-3-030-72228-9
024 7 $a 10.1007/978-3-030-72228-9 $2 doi
035 $a 978-3-030-72228-9
050 4 $a QA164-167.2
072 7 $a PBV $2 bicssc
072 7 $a MAT036000 $2 bisacsh
072 7 $a PBV $2 thema
082 0 4 $a 511.6 $2 23
100 1 $a Golomb, Solomon W. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1353021
245 1 0 $a Solomon Golomb’s Course on Undergraduate Combinatorics $h [electronic resource] / $c by Solomon W. Golomb, Andy Liu.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XVIII, 458 p. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a 0. Basic Tools -- 1. Combinations -- 2. Recurrence Relations and Generating Functions -- 3. Permutations -- 4. Special Numbers -- 5. Counting Under Symmetries -- 6. Combinatorial Structures -- A. Additional Exercises -- B. Additional Examples -- C. Solutions to Odd-numbered Exercises -- Bibliography -- Index.
520 $a This textbook offers an accessible introduction to combinatorics, infused with Solomon Golomb’s insights and illustrative examples. Core concepts in combinatorics are presented with an engaging narrative that suits undergraduate study at any level. Featuring early coverage of the Principle of Inclusion-Exclusion and a unified treatment of permutations later on, the structure emphasizes the cohesive development of ideas. Combined with the conversational style, this approach is especially well suited to independent study. Falling naturally into three parts, the book begins with a flexible Chapter Zero that can be used to cover essential background topics, or as a standalone problem-solving course. The following three chapters cover core topics in combinatorics, such as combinations, generating functions, and permutations. The final three chapters present additional topics, such as Fibonacci numbers, finite groups, and combinatorial structures. Numerous illuminating examples are included throughout, along with exercises of all levels. Three appendices include additional exercises, examples, and solutions to a selection of problems. Solomon Golomb’s Course on Undergraduate Combinatorics is ideal for introducing mathematics students to combinatorics at any stage in their program. There are no formal prerequisites, but readers will benefit from mathematical curiosity and a willingness to engage in the book’s many entertaining challenges.
650 0 $a Combinatorics. $3 669353
700 1 $a Liu, Andy. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1286521
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030722272
776 0 8 $i Printed edition: $z 9783030722296
776 0 8 $i Printed edition: $z 9783030722302
856 4 0 $u https://doi.org/10.1007/978-3-030-72228-9
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)