東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁 到查詢結果 [ subject:"Approximations and Expansions." ]

切換: 標籤 | MARC模式 | ISBD

Discrete calculus = methods for coun...

Mariconda, Carlo.

FindBook

Google Book

Amazon

博客來

Discrete calculus = methods for counting /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Discrete calculus/ by Carlo Mariconda, Alberto Tonolo.
其他題名:	methods for counting /
作者:	Mariconda, Carlo.
其他作者:	Tonolo, Alberto.
出版者:	Cham :Springer International Publishing : : 2016.,
面頁冊數:	xxi, 659 p. :ill., digital ;24 cm.
內容註:	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.
Contained By:	Springer eBooks
標題:	Combinatorial analysis. -
電子資源:	http://dx.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. - Cham :Springer International Publishing :2016. - xxi, 659 p. :ill., digital ;24 cm. - UNITEXT,v.1032038-5714 ;. - UNITEXT ;v.103..

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:

523878
Combinatorial analysis.

LC Class. No.: QA164

Dewey Class. No.: 511.6

Discrete calculus = methods for counting /
LDR:03038nmm a2200325 a 4500 001 2082579
003 DE-He213
005 20161202001016.0
006 m d
007 cr nn 008maaau
008 170717s2016 gw s 0 eng d
020 $a 9783319030388 $q (electronic bk.)
020 $a 9783319030371 $q (paper)
024 7 $a 10.1007/978-3-319-03038-8 $2 doi
035 $a 978-3-319-03038-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA164
072 7 $a PBV $2 bicssc
072 7 $a MAT036000 $2 bisacsh
082 0 4 $a 511.6 $2 23
090 $a QA164 $b .M333 2016
100 1 $a Mariconda, Carlo. $3 3206151
245 1 0 $a Discrete calculus $h [electronic resource] : $b methods for counting / $c by Carlo Mariconda, Alberto Tonolo.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a xxi, 659 p. : $b ill., digital ; $c 24 cm.
490 1 $a UNITEXT, $x 2038-5714 ; $v 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 Combinatorial analysis. $3 523878
650 0 $a Computer science $x Mathematics. $3 532725
650 1 4 $a Mathematics. $3 515831
650 2 4 $a Combinatorics. $3 895617
650 2 4 $a Approximations and Expansions. $3 897324
700 1 $a Tonolo, Alberto. $3 3206152
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a UNITEXT ; $v v.103. $3 3206153
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-03038-8
950 $a Mathematics and Statistics (Springer-11649)