000 04426nam a22005175i 4500
001 978-3-030-44559-1
003 DE-He213
005 20240423125323.0
007 cr nn 008mamaa
008 200928s2020 sz | s |||| 0|eng d
020 _a9783030445591
_9978-3-030-44559-1
024 7 _a10.1007/978-3-030-44559-1
_2doi
050 4 _aQA76.9.M35
072 7 _aUYAM
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
082 0 4 _a005.131
_223
245 1 0 _aAlgorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra
_h[electronic resource] :
_bIn Honour of Peter Paule on his 60th Birthday /
_cedited by Veronika Pillwein, Carsten Schneider.
250 _a1st ed. 2020.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2020.
300 _aXVII, 410 p. 55 illus., 19 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTexts & Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria,
_x2197-8409
505 0 _aWhen 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 _aThe 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 _aComputer science
_xMathematics.
650 1 4 _aSymbolic and Algebraic Manipulation.
650 2 4 _aMathematical Applications in Computer Science.
700 1 _aPillwein, Veronika.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSchneider, Carsten.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030445584
776 0 8 _iPrinted edition:
_z9783030445607
776 0 8 _iPrinted edition:
_z9783030445614
830 0 _aTexts & Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria,
_x2197-8409
856 4 0 _uhttps://doi.org/10.1007/978-3-030-44559-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
942 _cSPRINGER
999 _c176666
_d176666