Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra

In Honour of Peter Paule on his 60th Birthday

Inbunden, Engelska, 2020

1 409 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

The book is centered around the research areas of combinatorics, special functions, and computer algebra. Readers will range from graduate students, researchers to practitioners who are interested in solving concrete problems within mathematics and other research disciplines.

Produktinformation

Utgivningsdatum2020-09-29
Mått155 x 235 x 29 mm
Vikt805 g
FormatInbunden
SpråkEngelska
SerieTexts & Monographs in Symbolic Computation
Antal sidor410
Upplaga20001
FörlagSpringer Nature Switzerland AG
ISBN9783030445584

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT

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.