Inquiry-based enumerative combinatorics : one, two, skip a few-- ninety-nine, one hundred
著者
書誌事項
Inquiry-based enumerative combinatorics : one, two, skip a few-- ninety-nine, one hundred
（Undergraduate texts in mathematics）
Springer, c2019
大学図書館所蔵 件 / 全21件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
内容説明・目次
内容説明
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.
目次
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.
「Nielsen BookData」 より
