國立虎尾科技大學 |

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra = In Honour of Peter Paule on his 60th Birthday /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra/ edited by Veronika Pillwein, Carsten Schneider.
其他題名:	In Honour of Peter Paule on his 60th Birthday /
其他作者:	Schneider, Carsten.
面頁冊數:	XVII, 410 p. 55 illus., 19 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Mathematical Applications in Computer Science. -
電子資源:	https://doi.org/10.1007/978-3-030-44559-1
ISBN:	9783030445591

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra = In Honour of Peter Paule on his 60th Birthday /
Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer AlgebraIn Honour of Peter Paule on his 60th Birthday /[electronic resource] :edited by Veronika Pillwein, Carsten Schneider. - 1st ed. 2020. - XVII, 410 p. 55 illus., 19 illus. in color.online resource. - Texts & Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria,0943-853X. - Texts & Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria,.

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

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

815331
Mathematical Applications in Computer Science.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 005.131

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra = In Honour of Peter Paule on his 60th Birthday /
LDR:03804nam a22004095i 4500 001 1030154
003 DE-He213
005 20200928073714.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030445591 $9 978-3-030-44559-1
024 7 $a 10.1007/978-3-030-44559-1 $2 doi
035 $a 978-3-030-44559-1
050 4 $a QA76.9.M35
072 7 $a UYAM $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a UYAM $2 thema
082 0 4 $a 005.131 $2 23
245 1 0 $a Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra $h [electronic resource] : $b In Honour of Peter Paule on his 60th Birthday / $c edited by Veronika Pillwein, Carsten Schneider.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a XVII, 410 p. 55 illus., 19 illus. in color. $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 Texts & Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria, $x 0943-853X
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 2 4 $a Mathematical Applications in Computer Science. $3 815331
650 1 4 $a Symbolic and Algebraic Manipulation. $3 669944
650 0 $a Computer mathematics. $3 1199796
650 0 $a Computer science—Mathematics. $3 1253519
700 1 $a Schneider, Carsten. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1078871
700 1 $a Pillwein, Veronika. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1326983
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030445584
776 0 8 $i Printed edition: $z 9783030445607
776 0 8 $i Printed edition: $z 9783030445614
830 0 $a Texts & Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria, $x 0943-853X $3 1256871
856 4 0 $u https://doi.org/10.1007/978-3-030-44559-1
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)