Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra : In Honour of Peter Paule on his 60th Birthday / edited by Veronika Pillwein, Carsten Schneider

Contributor(s):

Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: Texts & Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria | Springer eBook CollectionPublisher: Cham : Springer International Publishing, 2020Publisher: Cham : Imprint: Springer, 2020Edition: 1st ed. 2020Description: 1 Online-Ressource(XVII, 410 p. 55 illus., 19 illus. in color.)ISBN:

9783030445591

Subject(s):

Additional physical formats: 9783030445584 | 9783030445607 | 9783030445614 | Erscheint auch als: Algorithmic combinatorics: enumerative combinatorics, special functions and computer algebra. Druck-Ausgabe Cham, Switzerland : Springer Nature, 2020. xvii, 410 Seiten | Erscheint auch als: 9783030445607 Druck-Ausgabe | Erscheint auch als: 9783030445614 Druck-AusgabeDOI: DOI: 10.1007/978-3-030-44559-1Online resources:

Summary: 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.Summary: 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.PPN: PPN: 1734625554Package identifier: Produktsigel: ZDB-2-SCS | ZDB-2-SEB | ZDB-2-SXCS

Holdings ( 0 )

No physical items for this record