INQUIRY BASED ENUMERATIVE COMBINATORICS ONE TWO SKIP A FEW NINETY...

Details

Title INQUIRY BASED ENUMERATIVE COMBINATORICS ONE TWO SKIP A FEW NINETY NINE ONE HUNDRED (HB 2019)
Author PETERSEN T.K
Binding Hardback
Edition USA Edition
Condition New
Pages 238
Volumes 1
Language ENG
Publisher Springer
Bookseller's Inventory # CBS 9783030183073
ISBN 9783030183073 / 3030183076
Weight 1.41 lbs (0.64 kg)
Category Mathematics
Dewey Decimal Code 511.6
Quantity available 1

About XLANCEBOOKS L.L.C. India

Biblio member since 2022

USA EDITION, 30 day return guarantee,

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from XLANCEBOOKS L.L.C.

Reader reviews for INQUIRY BASED ENUMERATIVE COMBINATORICS ONE TWO SKIP A FEW NINETY NINE ONE HUNDRED (HB 2019)

Write a review for this book

Important Terms and Guidelines

Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
Reviews must be at least 140 characters in length.
Please do not reveal critical plot elements.
This is not a help line. Contact customer support if you need help.

Your review must not include:

Obscenities, discriminatory language, or other insulting language not suitable for public domain
Advertisements, “spam” content, or references to other products, offers or websites.
Email addresses, URLs, phone numbers, physical addresses or other contact information.
Overly critical comments about other reviews or reviewers
Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
Availability, price, or alternative ordering/shipping information

From the publisher

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.

From the rear cover

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 Birkhuser Advanced Texts Basler Lehrbcher.

BIBLIO is the largest independent book marketplace in the world, with over 100 million books.