Discrete Calculus: Methods for Counting - UNITEXT 103 (Paperback)
  • Discrete Calculus: Methods for Counting - UNITEXT 103 (Paperback)

Discrete Calculus: Methods for Counting - UNITEXT 103 (Paperback)

(author), (author)
Paperback 659 Pages / Published: 15/12/2016
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket

This book provides an introduction to combinatorics, finite calculus, formal series, recurrences, and approximations of sums. Readers will find not only coverage of the basic elements of the subjects but also deep insights into a range of less common topics rarely considered within a single book, such as counting with occupancy constraints, a clear distinction between algebraic and analytical properties of formal power series, an introduction to discrete dynamical systems with a thorough description of Sarkovskii's theorem, symbolic calculus, and a complete description of the Euler-Maclaurin formulas and their applications. Although several books touch on one or more of these aspects, precious few cover all of them. The authors, both pure mathematicians, have attempted to develop methods that will allow the student to formulate a given problem in a precise mathematical framework. The aim is to equip readers with a sound strategy for classifying and solving problems by pursuing a mathematically rigorous yet user-friendly approach. This is particularly useful in combinatorics, a field where, all too often, exercises are solved by means of ad hoc tricks. The book contains more than 400 examples and about 300 problems, and the reader will be able to find the proof of every result. To further assist students and teachers, important matters and comments are highlighted, and parts that can be omitted, at least during a first and perhaps second reading, are identified.

Publisher: Springer International Publishing AG
ISBN: 9783319030371
Number of pages: 659
Weight: 1192 g
Dimensions: 235 x 155 x 36 mm
Edition: 1st ed. 2016

"Discrete Calculus is an introductory text to combinatorics and finite calculus. ... the work is well organized, and its massive size is also a strength since an interested reader will be able to find any related topic with the assistance of its comprehensive index including symbols, helpful appendixes, and markers indicating what information is most and least important. ... Summing Up: Recommended. Graduate students, researchers, and faculty." (A. Misseldine, Choice, Vol. 54 (11), July, 2017)

You may also be interested in...


Please sign in to write a review

Your review has been submitted successfully.