國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Algorithmic combinatoricsenumerative...

Paule, Peter,

Algorithmic combinatoricsenumerative combinatorics, special functions and computer algebra : in honour of Peter Paule on his 60th birthday /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Algorithmic combinatoricsedited by Veronika Pillwein, Carsten Schneider.
其他題名:	enumerative combinatorics, special functions and computer algebra : in honour of Peter Paule on his 60th birthday /
其他作者:	Pillwein, Veronika.
出版者:	Cham :Springer International Publishing :2020.
面頁冊數:	xvii, 410 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Combinatorial analysis.
電子資源:	https://doi.org/10.1007/978-3-030-44559-1
ISBN:	9783030445591$q(electronic bk.)

Algorithmic combinatoricsenumerative combinatorics, special functions and computer algebra : in honour of Peter Paule on his 60th birthday /
Algorithmic combinatoricsenumerative combinatorics, special functions and computer algebra : in honour of Peter Paule on his 60th birthday /[electronic resource] :edited by Veronika Pillwein, Carsten Schneider. - Cham :Springer International Publishing :2020. - xvii, 410 p. :ill., digital ;24 cm. - Texts & monographs in symbolic computation. - Texts & monographs in symbolic computation..

When the search for solutions can be terminated -- Euler's partition theorem and refinement without appeal to infinit -- Sequences in partitions, double q-series and the Mock Theta Function -- Refine q-trinomial coecients and two infinit hierarchies of q-series identities -- Large scale analytic calculations in quantum field theories -- An eigenvalue problem for the associated Askey-Wilson polynomials -- Context-free grammars and stable multivariate polynomials over Stirling permutations -- An interesting class of Hankel determinants -- A sequence of polynomials generated by a Kapteyn series of the second kind -- Comparative analysis of random generators -- Difference equation theory meets mathematical finance -- Evaluations as L-subsets -- Exact lower bounds for monochromatic Schur triples and generalizations -- Evaluation of binomial double sums involving absolute values -- On two subclasses of Motzkin paths and their relation to ternary trees -- A theorem to reduce certain modular form relations modulo primes -- Trying to solve a linear system for strict partitions in 'closed form' -- Untying the Gordian Knot via experimental mathematics.

The book is centered around the research areas of combinatorics, special functions, and computer algebra. What these research fields share is that many of their outstanding results do not only have applications in Mathematics, but also other disciplines, such as computer science, physics, chemistry, etc. A particular charm of these areas is how they interact and influence one another. For instance, combinatorial or special functions' techniques have motivated the development of new symbolic algorithms. In particular, first proofs of challenging problems in combinatorics and special functions were derived by making essential use of computer algebra. This book addresses these interdisciplinary aspects. Algorithmic aspects are emphasized and the corresponding software packages for concrete problem solving are introduced. Readers will range from graduate students, researchers to practitioners who are interested in solving concrete problems within mathematics and other research disciplines.

ISBN: 9783030445591$q(electronic bk.)

Standard No.: 10.1007/978-3-030-44559-1doiSubjects--Topical Terms:

182280
Combinatorial analysis.

LC Class. No.: QA164 / .A44 2020

Dewey Class. No.: 511.6

Algorithmic combinatoricsenumerative combinatorics, special functions and computer algebra : in honour of Peter Paule on his 60th birthday /
LDR:03306nmm a2200337 a 4500 001 585913
003 DE-He213
005 20200928073714.0
006 m d
007 cr nn 008maaau
008 210323s2020 sz s 0 eng d
020 $a 9783030445591$q(electronic bk.)
020 $a 9783030445584$q(paper)
024 7 $a 10.1007/978-3-030-44559-1 $2 doi
035 $a 978-3-030-44559-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA164 $b .A44 2020
072 7 $a UYAM $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a UYAM $2 thema
082 0 4 $a 511.6 $2 23
090 $a QA164 $b .A396 2020
245 0 0 $a Algorithmic combinatorics $h [electronic resource] : $b enumerative combinatorics, special functions and computer algebra : in honour of Peter Paule on his 60th birthday / $c edited by Veronika Pillwein, Carsten Schneider.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a xvii, 410 p. : $b ill., digital ; $c 24 cm.
490 1 $a Texts & monographs in symbolic computation
505 0 $a When the search for solutions can be terminated -- Euler's partition theorem and refinement without appeal to infinit -- Sequences in partitions, double q-series and the Mock Theta Function -- Refine q-trinomial coecients and two infinit hierarchies of q-series identities -- Large scale analytic calculations in quantum field theories -- An eigenvalue problem for the associated Askey-Wilson polynomials -- Context-free grammars and stable multivariate polynomials over Stirling permutations -- An interesting class of Hankel determinants -- A sequence of polynomials generated by a Kapteyn series of the second kind -- Comparative analysis of random generators -- Difference equation theory meets mathematical finance -- Evaluations as L-subsets -- Exact lower bounds for monochromatic Schur triples and generalizations -- Evaluation of binomial double sums involving absolute values -- On two subclasses of Motzkin paths and their relation to ternary trees -- A theorem to reduce certain modular form relations modulo primes -- Trying to solve a linear system for strict partitions in 'closed form' -- Untying the Gordian Knot via experimental mathematics.
520 $a The book is centered around the research areas of combinatorics, special functions, and computer algebra. What these research fields share is that many of their outstanding results do not only have applications in Mathematics, but also other disciplines, such as computer science, physics, chemistry, etc. A particular charm of these areas is how they interact and influence one another. For instance, combinatorial or special functions' techniques have motivated the development of new symbolic algorithms. In particular, first proofs of challenging problems in combinatorics and special functions were derived by making essential use of computer algebra. This book addresses these interdisciplinary aspects. Algorithmic aspects are emphasized and the corresponding software packages for concrete problem solving are introduced. Readers will range from graduate students, researchers to practitioners who are interested in solving concrete problems within mathematics and other research disciplines.
650 0 $a Combinatorial analysis. $3 182280
650 0 $a Combinatorial enumeration problems. $3 190930
650 1 4 $a Symbolic and Algebraic Manipulation. $3 273720
650 2 4 $a Mathematical Applications in Computer Science. $3 530811
700 1 $a Pillwein, Veronika. $3 877177
700 1 $a Schneider, Carsten. $3 806735
700 1 $a Paule, Peter, $e honouree. $3 877178
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Texts & monographs in symbolic computation. $3 726410
856 4 0 $u https://doi.org/10.1007/978-3-030-44559-1
950 $a Computer Science (SpringerNature-11645)