國立虎尾科技大學 |

Discrete Calculus = Methods for Counting /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Discrete Calculus/ by Carlo Mariconda, Alberto Tonolo.
其他題名:	Methods for Counting /
作者:	Mariconda, Carlo.
其他作者:	Tonolo, Alberto.
面頁冊數:	XXI, 659 p. 66 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Combinatorics. -
電子資源:	https://doi.org/10.1007/978-3-319-03038-8
ISBN:	9783319030388

Discrete Calculus = Methods for Counting /
Mariconda, Carlo.

Discrete CalculusMethods for Counting /[electronic resource] :by Carlo Mariconda, Alberto Tonolo. - 1st ed. 2016. - XXI, 659 p. 66 illus.online resource. - La Matematica per il 3+2,1032038-5722 ;. - La Matematica per il 3+2,84.

1 Let’s Learn to Count -- 2 Counting Sequences and Collections -- 3 Occupancy Constraints -- 4 Inclusion/Exclusion -- 5 Stirling Numbers and Eulerian Numbers -- 6 Manipulation of Sums -- 7 Formal Power Series -- 8 Generating Formal Series and Applications -- 9 Recurrence Relations -- 10 Linear Recurrence Relations -- 11 Symbolic Calculus -- 12 The Euler-Maclaurin Formulas of Order 1 and 2 -- 13 The Euler-Maclaurin Formula of Arbitrary Order -- 14 Cauchy and Riemann Sums, Factorials, Ramanujan Numbers and their Approximations -- 15 Tables and Formulas -- 16 Appendix A.

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.

ISBN: 9783319030388

Standard No.: 10.1007/978-3-319-03038-8doiSubjects--Topical Terms:

669353
Combinatorics.

LC Class. No.: QA164-167.2

Dewey Class. No.: 511.6

Discrete Calculus = Methods for Counting /
LDR:03422nam a22003975i 4500 001 981045
003 DE-He213
005 20200706225443.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783319030388 $9 978-3-319-03038-8
024 7 $a 10.1007/978-3-319-03038-8 $2 doi
035 $a 978-3-319-03038-8
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 Mariconda, Carlo. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1116475
245 1 0 $a Discrete Calculus $h [electronic resource] : $b Methods for Counting / $c by Carlo Mariconda, Alberto Tonolo.
250 $a 1st ed. 2016.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a XXI, 659 p. 66 illus. $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 La Matematica per il 3+2, $x 2038-5722 ; $v 103
505 0 $a 1 Let’s Learn to Count -- 2 Counting Sequences and Collections -- 3 Occupancy Constraints -- 4 Inclusion/Exclusion -- 5 Stirling Numbers and Eulerian Numbers -- 6 Manipulation of Sums -- 7 Formal Power Series -- 8 Generating Formal Series and Applications -- 9 Recurrence Relations -- 10 Linear Recurrence Relations -- 11 Symbolic Calculus -- 12 The Euler-Maclaurin Formulas of Order 1 and 2 -- 13 The Euler-Maclaurin Formula of Arbitrary Order -- 14 Cauchy and Riemann Sums, Factorials, Ramanujan Numbers and their Approximations -- 15 Tables and Formulas -- 16 Appendix A.
520 $a 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.
650 0 $a Combinatorics. $3 669353
650 0 $a Approximation theory. $3 527707
650 2 4 $a Approximations and Expansions. $3 672153
700 1 $a Tonolo, Alberto. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1116476
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319030371
776 0 8 $i Printed edition: $z 9783319030395
830 0 $a La Matematica per il 3+2, $x 2038-5722 ; $v 84 $3 1253905
856 4 0 $u https://doi.org/10.1007/978-3-319-03038-8
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)