國立虎尾科技大學 |

Inquiry-Based Enumerative Combinatorics = One, Two, Skip a Few... Ninety-Nine, One Hundred /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Inquiry-Based Enumerative Combinatorics/ by T. Kyle Petersen.
其他題名:	One, Two, Skip a Few... Ninety-Nine, One Hundred /
作者:	Petersen, T. Kyle.
面頁冊數:	XI, 238 p. 104 illus., 9 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Combinatorics. -
電子資源:	https://doi.org/10.1007/978-3-030-18308-0
ISBN:	9783030183080

Inquiry-Based Enumerative Combinatorics = One, Two, Skip a Few... Ninety-Nine, One Hundred /
Petersen, T. Kyle.

Inquiry-Based Enumerative CombinatoricsOne, Two, Skip a Few... Ninety-Nine, One Hundred /[electronic resource] :by T. Kyle Petersen. - 1st ed. 2019. - XI, 238 p. 104 illus., 9 illus. in color.online resource. - Undergraduate Texts in Mathematics,0172-6056. - Undergraduate Texts in Mathematics,.

0. Introduction to this book -- 1. First Principles -- 2. Permutations -- 3. Combinations -- 4. The Binomial Theorem -- 5. Recurrences -- 6. Generating Functions -- 7. Exponential Generating Functions and Bell Numbers -- 8. Eulerian Numbers -- 9. Catalan and Narayana Numbers -- 10. Refined Enumeration -- 11. Applications to Probability -- 12. Some Partition Theory -- 13. A Bit of Number Theory -- A. Supplementary Exercises.

This textbook offers the opportunity to create a uniquely engaging combinatorics classroom by embracing Inquiry-Based Learning (IBL) techniques. Readers are provided with a carefully chosen progression of theorems to prove and problems to actively solve. Students will feel a sense of accomplishment as their collective inquiry traces a path from the basics to important generating function techniques. Beginning with an exploration of permutations and combinations that culminates in the Binomial Theorem, the text goes on to guide the study of ordinary and exponential generating functions. These tools underpin the in-depth study of Eulerian, Catalan, and Narayana numbers that follows, and a selection of advanced topics that includes applications to probability and number theory. Throughout, the theory unfolds via over 150 carefully selected problems for students to solve, many of which connect to state-of-the-art research. Inquiry-Based Enumerative Combinatorics is ideal for lower-division undergraduate students majoring in math or computer science, as there are no formal mathematics prerequisites. Because it includes many connections to recent research, students of any level who are interested in combinatorics will also find this a valuable resource.

ISBN: 9783030183080

Standard No.: 10.1007/978-3-030-18308-0doiSubjects--Topical Terms:

669353
Combinatorics.

LC Class. No.: QA164-167.2

Dewey Class. No.: 511.6

Inquiry-Based Enumerative Combinatorics = One, Two, Skip a Few... Ninety-Nine, One Hundred /
LDR:03159nam a22004095i 4500 001 1012018
003 DE-He213
005 20200702130935.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030183080 $9 978-3-030-18308-0
024 7 $a 10.1007/978-3-030-18308-0 $2 doi
035 $a 978-3-030-18308-0
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 Petersen, T. Kyle. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1069782
245 1 0 $a Inquiry-Based Enumerative Combinatorics $h [electronic resource] : $b One, Two, Skip a Few... Ninety-Nine, One Hundred / $c by T. Kyle Petersen.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XI, 238 p. 104 illus., 9 illus. in color. $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
490 1 $a Undergraduate Texts in Mathematics, $x 0172-6056
505 0 $a 0. Introduction to this book -- 1. First Principles -- 2. Permutations -- 3. Combinations -- 4. The Binomial Theorem -- 5. Recurrences -- 6. Generating Functions -- 7. Exponential Generating Functions and Bell Numbers -- 8. Eulerian Numbers -- 9. Catalan and Narayana Numbers -- 10. Refined Enumeration -- 11. Applications to Probability -- 12. Some Partition Theory -- 13. A Bit of Number Theory -- A. Supplementary Exercises.
520 $a This textbook offers the opportunity to create a uniquely engaging combinatorics classroom by embracing Inquiry-Based Learning (IBL) techniques. Readers are provided with a carefully chosen progression of theorems to prove and problems to actively solve. Students will feel a sense of accomplishment as their collective inquiry traces a path from the basics to important generating function techniques. Beginning with an exploration of permutations and combinations that culminates in the Binomial Theorem, the text goes on to guide the study of ordinary and exponential generating functions. These tools underpin the in-depth study of Eulerian, Catalan, and Narayana numbers that follows, and a selection of advanced topics that includes applications to probability and number theory. Throughout, the theory unfolds via over 150 carefully selected problems for students to solve, many of which connect to state-of-the-art research. Inquiry-Based Enumerative Combinatorics is ideal for lower-division undergraduate students majoring in math or computer science, as there are no formal mathematics prerequisites. Because it includes many connections to recent research, students of any level who are interested in combinatorics will also find this a valuable resource.
650 0 $a Combinatorics. $3 669353
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030183073
776 0 8 $i Printed edition: $z 9783030183097
776 0 8 $i Printed edition: $z 9783030183103
830 0 $a Undergraduate Texts in Mathematics, $x 0172-6056 $3 1253653
856 4 0 $u https://doi.org/10.1007/978-3-030-18308-0
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)