Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday de Veronika Pillwein

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday: Texts & Monographs in Symbolic Computation

Editat de Veronika Pillwein, Carsten Schneider
en Limba Engleză Paperback – 30 sep 2021
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 64110 lei  6-8 săpt.
  Springer International Publishing – 30 sep 2021 64110 lei  6-8 săpt.
Hardback (1) 64742 lei  6-8 săpt.
  Springer International Publishing – 29 sep 2020 64742 lei  6-8 săpt.

Din seria Texts & Monographs in Symbolic Computation

Preț: 64110 lei

Preț vechi: 80137 lei
-20% Nou

Puncte Express: 962
Preț estimativ în valută:
12269€ • 12782$ • 10201£

Carte tipărită la comandă

Livrare economică 11-25 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030445614
ISBN-10: 3030445615
Pagini: 410
Ilustrații: XVII, 410 p. 55 illus., 19 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.6 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seria Texts & Monographs in Symbolic Computation

Locul publicării:Cham, Switzerland

Cuprins

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.


Textul de pe ultima copertă

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.

Caracteristici

Up-to-date reviews on hot topics in mathematics Interdisciplinary research between highly visible research areas Focuses on algorithmic aspects Surveys existing software packages relating to the topics