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

Petersen, T. Kyle

ISBN 10: 3030183106 / ISBN 13: 9783030183103

Published by Springer, 2020

About this Item

Zustand: Hervorragend | Sprache: Englisch | Produktart: Bücher | 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 Combinatoricsis 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.

Seller Inventory # 38243391/1

Bibliographic Details

• Title: Inquiry-Based Enumerative Combinatorics : One, Two, Skip a Few. Ninety-Nine, One Hundred
• Publisher: Springer
• Publication Date: 2020
• Language: English
• ISBN 10: 3030183106
• ISBN 13: 9783030183103
• Binding: Soft cover
• Condition: Hervorragend
• Seller catalogs:
  • Bücher

About this title

Synopsis

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 Combinatoricsis 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.

About the Author

T. Kyle Petersen is Professor of Mathematics at DePaul University in Chicago. His research interests lie in algebraic, enumerative, and topological combinatorics, and he has been an active member of the Inquiry-Based Learning (IBL) community for over a decade. His graduate textbook, Eulerian Numbers, appears in Birkhäuser Advanced Texts Basler Lehrbücher.