Members
Jakob Ablinger
Koustav Banerjee
Nikolai Fadeev
Ankush Goswami
Ralf Hemmecke
Antonio Jimenez Pastor
Philipp Nuspl
Evans Doe Ocansey
Peter Paule
Veronika Pillwein
Cristian-Silviu Radu
Carsten Schneider
Nicolas Smoot
Ali Uncu
Ongoing Projects
SAGEX – Scattering Amplitudes: from Geometry to Experiment
Extension of Algorithms for D-finite functions [DK15]
Computer Algebra and Combinatorial Inequalities [FWF SFB F050-07]
Computer Algebra for Nested Sums and Products [FWF SFB F050-09]
Partition Analysis [SFB F050-06]
Computer Algebra Tools for Special Functions [DK6]
Software
Asymptotics
A Mathematica Package for Computing Asymptotic Series Expansions of Univariate Holonomic Sequences
This package is part of the RISCErgoSum bundle. The Asymptotics package provides a command for computing asymptotic series expansions of solutions of P-finite recurrence equations. ...
Bibasic Telescope
A Mathematica Implementation of a Generalization of Gosper's Algorithm to Bibasic Hypergeometric Summation
This package is part of the RISCErgoSum bundle. pqTelescope is a Mathematica implementation of a generalization of Gosper’s algorithm to indefinite bibasic hypergeometric summation. The package has been developed by Axel Riese, a former member of the RISC Combinatorics group. ...
Dependencies
A Mathematica Package for Computing Algebraic Relations of C-finite Sequences and Multi-Sequences
This package is part of the RISCErgoSum bundle. For any tuple f_1, f_2,..., f_r of sequences, the set of multivariate polynomials p such that p(f1(n),f2(n),...,fr(n))=0 for all points n forms ...
DiffTools
A Mathematica Implementation of several Algorithms for Solving Linear Difference Equations with Polynomial Coefficients
DiffTools is a Mathematica implementation for solving linear difference equations with polynomial coefficients. It contains an algorithm for finding polynomial solutions (by Marko Petkovsek), the algorithm by Sergei Abramov for finding rational solutions, the algorithm of Mark van Hoeij for ...
This package is part of the RISCErgoSum bundle. Engel is a Mathematica implementation of the q -Engel Expansion algorithm which expands q-series into inverse polynomial series. Examples of q-Engel Expansions include the Rogers-Ramanujan identities together with their elegant generalization by ...
A Mathematica package based on Sigma that tries to evaluate automatically multi-sums to expressions in terms of indefinite nested sums defined over (q-)hypergeometric products. ...
fastZeil
The Paule/Schorn Implementation of Gosper’s and Zeilberger’s Algorithms
This package is part of the RISCErgoSum bundle. With Gosper’s algorithm you can find closed forms for indefinite hypergeometric sums. If you do not succeed, then you may use Zeilberger’s algorithm to come up with a recurrence relation for that ...
GeneratingFunctions
A Mathematica Package for Manipulations of Univariate Holonomic Functions and Sequences
This package is part of the RISCErgoSum bundle. GeneratingFunctions is a Mathematica package for manipulations of univariate holonomic functions and sequences. ...
GenOmega
A Mathematica Implementation of Guo-Niu Han's General Algorithm for MacMahon's Partition Analysis
This package is part of the RISCErgoSum bundle. GenOmega is a Mathematica implementation of Guo-Niu Han’s general Algorithm for MacMahon’s Partition Analysis carried out by Manuela Wiesinger, a master student of the RISC Combinatorics group. Partition Analysis is a computational ...
Guess
A Mathematica Package for Guessing Multivariate Recurrence Equations
This package is part of the RISCErgoSum bundle. The Guess package provides commands for guessing multivariate recurrence equations, as well as for efficiently guessing minimal order univariate recurrence, differential, or algebraic equations given the initial terms of a sequence or ...
HarmonicSums
A Mathematica Package for dealing with Harmonic Sums, Generalized Harmonic Sums and Cyclotomic Sums and their related Integral Representations
The HarmonicSums package by Jakob Ablinger allows to deal with nested sums such as harmonic sums, S-sums, cyclotomic sums and cyclotmic S-sums as well as iterated integrals such as harmonic polylogarithms, multiple polylogarithms and cyclotomic polylogarithms in an algorithmic fashion. ...
HolonomicFunctions
A Mathematica Package for dealing with Multivariate Holonomic Functions, including Closure Properties, Summation, and Integration
This package is part of the RISCErgoSum bundle. The HolonomicFunctions package allows to deal with multivariate holonomic functions and sequences in an algorithmic fashion. For this purpose the package can compute annihilating ideals and execute closure properties (addition, multiplication, substitutions) ...
math4ti2.m is an interface package, allowing the execution of zsolve of the package 4ti2 from within Mathematica notebooks. The package is written by Ralf Hemmecke and Silviu Radu. Licence This program is free software: you can redistribute it and/or ...
ModularGroup
A Mathematica Package providing Basic Algorithms and Visualization Routines related to the Modular Group, e.g. for Drawing the Tessellation of the Upper Half-Plane
ModularGroup.m is a Mathematica package which has been developed in the course of the diploma thesis Computer Algebra and Analysis: Complex Variables Visualized, carried out at the Research Institute for Symbolic Computation (RISC) of the Johannes Kepler University Linz ...
MultiIntegrate
The MultiIntegrate package allows to compute multi-dimensional integrals over hyperexponential integrands in terms of (generalized) harmonic sums.
The MultiIntegrate package allows to compute multi-dimensional integrals over hyperexponential integrands in terms of (generalized) harmonic sums. This package uses variations and extensions of the multivariate Alkmkvist-Zeilberger algorithm. Registration and Legal Notices The source code for this package is password ...
MultiSum
A Mathematica Package for Proving Hypergeometric Multi-Sum Identities
This package is part of the RISCErgoSum bundle. MultiSum is a Mathematica package for proving hypergeometric multi-sum identities. It uses an efficient generalization of Sister Celine’s technique to find a homogeneous polynomial recurrence relation for the sum. The package has ...
Omega is a Mathematica implementation of MacMahon’s Partition Analysis carried out by Axel Riese, a Postdoc of the RISC Combinatorics group. It has been developed together with George E. Andrews and Peter Paule within the frame of a project initiated ...
ore_algebra
A Sage Package for doing Computations with Ore Operators
The ore_algebra package provides an implementation of Ore algebras for Sage. The main features for the most common instances include basic arithmetic and actions; gcrd and lclm; D-finite closure properties; natural transformations between related algebras; guessing; desingularization; solvers for polynomials, ...
OreSys
A Mathematica Implementation of several Algorithms for Uncoupling Systems of Linear Ore Operator Equations
This package is part of the RISCErgoSum bundle. OreSys is a Mathematica package for uncoupling systems of linear Ore operator equations. It offers four algorithms for reducing systems of differential or (q-)difference equations to higher order equations in a single ...
PermGroup
A Mathematica Package for Permutation Groups, Group Actions and Polya Theory
PermGroup is a Mathematica package dealing with permutation groups, group actions and Polya theory. The package has been developed by Thomas Bayer, a former student of the RISC Combinatorics group. ...
The QEta package is a collection of programs written in the FriCAS computer algebra system that allow to compute with Dedekind eta-functions and related q-series where q=exp(2 π i τ). Furthermore, we provide a number of functions connected to the ...
qFunctions
The qFunctions package is a Mathematica package for q-series and partition theory applications.
The qFunctions package by Jakob Ablinger and Ali K. Uncu is a Mathematica package for q-series and partition theory applications. This package includes both experimental and symbolic tools. The experimental set of elements includes guessers for q-shift equations and recurrences ...
qGeneratingFunctions
A Mathematica Package for Manipulations of Univariate q-Holonomic Functions and Sequences
This package is part of the RISCErgoSum bundle. The qGeneratingFunctions package provides commands for manipulating q-holonomic sequences and power series. ...
qMultiSum
A Mathematica Package for Proving q-Hypergeometric Multi-Sum Identities
This package is part of the RISCErgoSum bundle. qMultiSum is a Mathematica package for proving q-hypergeometric multiple summation identities. The package has been developed by Axel Riese, a former member of the RISC Combinatorics group. ...
qZeil
A Mathematica Implementation of q-Analogues of Gosper's and Zeilberger's Algorithm
This package is part of the RISCErgoSum bundle. qZeil is a Mathematica implementation of q-analogues of Gosper’s and Zeilberger’s algorithm for proving and finding indefinite and definite q-hypergeometric summation identities. The package has been developed by Axel Riese, a former ...
RaduRK is a Mathematica implementation of an algorithm developed by Cristian-Silviu Radu. The algorithm takes as input an arithmetic sequence a(n) generated from a large class of q-Pochhammer quotients, together with a given arithmetic progression mn+j, and the level of ...
RatDiff
A Mathematica Implementation of Mark van Hoeij's Algorithm for Finding Rational Solutions of Linear Difference Equations
RatDiff is a Mathematica implementation of Mark van Hoeij's algorithm for finding rational solutions of linear difference equations. The package has been developed by Axel Riese, a Postdoc of the RISC Combinatorics group during a stay at the University of ...
RLangGFun
A Maple Implementation of the Inverse Schützenberger Methodology
The inverse Schützenberger methodology transforms a rational generating function into a (pseudo-) regular expression for a corresponding regular language, and is based on Soittola's Theorem about the N-rationality of a formal power series. It is implemented in the Maple package ...
Sigma
A Mathematica Package for Discovering and Proving Multi-Sum Identities
Sigma is a Mathematica package that can handle multi-sums in terms of indefinite nested sums and products. The summation principles of Sigma are: telescoping, creative telescoping and recurrence solving. The underlying machinery of Sigma is based on difference field theory. ...
Singular.m is an interface package, allowing the execution of Singular functions from Mathematica notebooks, written by Manuel Kauers and Viktor Levandovskyy. ...
Stirling
A Mathematica Package for Computing Recurrence Equations of Sums Involving Stirling Numbers or Eulerian Numbers
This package is part of the RISCErgoSum bundle. The Stirling package provides a command for computing recurrence equations of sums involving Stirling numbers or Eulerian numbers. ...
SumCracker
A Mathematica Implementation of several Algorithms for Identities and Inequalities of Special Sequences, including Summation Problems
This package is part of the RISCErgoSum bundle. The SumCracker package contains routines for manipulating a large class of sequences (admissible sequences). It can prove identities and inequalities for these sequences, simplify expressions, evaluate symbolic sums, and solve certain difference ...
Zeilberger
A Maxima Implementation of Gosper's and Zeilberger's Algorithm
Zeilberger is an implementatian for the free and open source Maxima computer algebra system of Gosper's and Zeilberger's algorithm for proving and finding indefinite and definite hypergeometric summation identities. The package has been developed by Fabrizio Caruso, a former Ph. ...
Publications
2021
The Polarized Transition Matrix Element $A_{g, q}(N)$ of the Variable Flavor Number Scheme at $O(\alpha_s^3)$
A. Behring, J. Blümlein, A. De Freitas, A. von Manteuffel, K. Schönwald, and C. Schneider
Technical report no. 21-01 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2021. Available also under arXiv:2101.05733 [hep-ph]. [pdf]author = {A. Behring and J. Blümlein and A. De Freitas and A. von Manteuffel and K. Schönwald and and C. Schneider},
title = {{The Polarized Transition Matrix Element $A_{g,q}(N)$ of the Variable Flavor Number Scheme at $O(\alpha_s^3)$}},
language = {english},
number = {21-01},
year = {2021},
note = {Available also under arXiv:2101.05733 [hep-ph]},
length = {25},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}
2020
Proving Two Conjectural Series for $\zeta(7)$ and Discovering More Series for $\zeta(7)$
J. Ablinger
In: Mathematical Aspects of Computer and Information Science, D. Slamanig, E. Tsigaridas, Z. Zafeirakopoulos (ed.), pp. 42-47. 2020. Springer International Publishing, 978-3-030-43120-4. [url]author = {J. Ablinger},
title = {{Proving Two Conjectural Series for $\zeta(7)$ and Discovering More Series for $\zeta(7)$}},
booktitle = {{Mathematical Aspects of Computer and Information Science}},
language = {english},
pages = {42--47},
publisher = {Springer International Publishing},
isbn_issn = {978-3-030-43120-4},
year = {2020},
editor = {D. Slamanig and E. Tsigaridas and Z. Zafeirakopoulos},
refereed = {yes},
length = {6},
url = {https://arxiv.org/abs/1908.06631v1}
}
Subleading logarithmic QED initial state corrections to $e^+e^−\to γ^⁎/Z^{0⁎}$ to $O(\alpha^6L^5)$
J. Ablinger, J. Blümlein, A. De Freitas, K. Schönwald
Nuclear Physics B 955, pp. 115045-115045. 2020. ISSN 0550-3213. [url]author = {J. Ablinger and J. Blümlein and A. De Freitas and K. Schönwald},
title = {{Subleading logarithmic QED initial state corrections to $e^+e^−\to γ^⁎/Z^{0⁎}$ to $O(\alpha^6L^5)$}},
language = {english},
journal = {Nuclear Physics B},
volume = {955},
pages = {115045--115045},
isbn_issn = { ISSN 0550-3213},
year = {2020},
refereed = {yes},
length = {0},
url = {http://www.sciencedirect.com/science/article/pii/S0550321320301310}
}
Hook Type Tableaux and Partition Identities
Koustav Banerjee, Manosij Ghosh Dastidar
Research Institute for Symbolic Computation. Technical report, 2020. Preprint. [pdf]author = {Koustav Banerjee and Manosij Ghosh Dastidar},
title = {{Hook Type Tableaux and Partition Identities}},
language = {english},
abstract = {In this paper we exhibit the box-stacking principle (BSP) in conjunction with Young diagrams to prove generalizations of the Stanley’s and Elder’s theorem without the use of partition statistics in general. We explain how the principle can be used to prove another interesting theorem on partitions with parts separated by parity, a special case of which is George Andrews’s result in [2].},
year = {2020},
note = {Preprint},
institution = {Research Institute for Symbolic Computation},
length = {19}
}
First-order factorizable systems of differential equations in one variable
N. Fadeev
Technical report no. 20-20 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2020. [pdf]author = {N. Fadeev},
title = {{First-order factorizable systems of differential equations in one variable}},
language = {english},
number = {20-20},
year = {2020},
length = {29},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}
On sums of coefficients of polynomials related to the Borwein conjectures
Ankush Goswami, Venkata Raghu Tej Pantangi
Technical report no. 20-07 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. Ramanujan J. (to appear), May 2020. [pdf]author = {Ankush Goswami and Venkata Raghu Tej Pantangi},
title = {{On sums of coefficients of polynomials related to the Borwein conjectures}},
language = {english},
abstract = {Recently, Li (Int. J. Number Theory 2020) obtained an asymptotic formula for a certain partial sum involving coefficients for the polynomial in the First Borwein conjecture. As a consequence, he showed the positivity of this sum. His result was based on a sieving principle discovered by himself and Wan (Sci. China. Math. 2010). In fact, Li points out in his paper that his method can be generalized to prove an asymptotic formula for a general partial sum involving coefficients for any prime $p>3$. In this work, we extend Li's method to obtain asymptotic formula for several partial sums of coefficients of a very general polynomial. We find that in the special cases $p=3, 5$, the signs of these sums are consistent with the three famous Borwein conjectures. Similar sums have been studied earlier by Zaharescu (Ramanujan J. 2006) using a completely different method. We also improve on the error terms in the asymptotic formula for Li and Zaharescu. Using a recent result of Borwein (JNT 1993), we also obtain an asymptotic estimate for the maximum of the absolute value of these coefficients for primes $p=2, 3, 5, 7, 11, 13$ and for $p>15$, we obtain a lower bound on the maximum absolute value of these coefficients for sufficiently large $n$.},
number = {20-07},
year = {2020},
month = {May},
howpublished = {Ramanujan J. (to appear)},
length = {13},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}
Some formulae for coefficients in restricted $q$-products
Ankush Goswami, Venkata Raghu Tej Pantangi
Technical report no. 20-08 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. May 2020. [pdf]author = {Ankush Goswami and Venkata Raghu Tej Pantangi},
title = {{Some formulae for coefficients in restricted $q$-products}},
language = {english},
abstract = {In this paper, we derive some formulae involving coefficients of polynomials which occur quite naturally in the study of restricted partitions. Our method involves a recently discovered sieve technique by Li and Wan (Sci. China. Math. 2010). Based on this method, by considering cyclic groups of different orders we obtain some new results for these coefficients. The general result (see Theorem \ref{main00}) holds for any group of the form $\mathbb{Z}_{N}$ where $N\in\mathbb{N}$ and expresses certain partial sums of coefficients in terms of expressions involving roots of unity. By specializing $N$ to different values, we see that these expressions simplify in some cases and we obtain several nice identities involving these coefficients. We also use a result of Sudler (Quarterly J. Math. 1964) to obtain an asymptotic formula for the maximum absolute value of these coefficients.},
number = {20-08},
year = {2020},
month = {May},
length = {11},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}
Congruences for generalized Fishburn numbers at roots of unity
Ankush Goswami
Technical report no. 20-09 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2020. [pdf]author = {Ankush Goswami},
title = {{Congruences for generalized Fishburn numbers at roots of unity}},
language = {english},
abstract = {There has been significant recent interest in the arithmeticproperties of the coefficients of $F(1-q)$ and $\mathcal{F}_t(1-q)$where $F(q)$ is the Kontsevich-Zagier strange series and $\mathcal{F}_t(q)$ is the strange series associated to a family of torus knots as studied by Bijaoui, Boden, Myers, Osburn, Rushworth, Tronsgardand Zhou. In this paper, we prove prime power congruences for two families of generalized Fishburn numbers, namely, for the coefficients of $(\zeta_N - q)^s F((\zeta_N - q)^r)$ and $(\zeta_N - q)^s \mathcal{F}_t((\zeta_N -q)^r)$, where $\zeta_N$ is an $N$th root of unity and $r$, $s$ are certain integers.},
number = {20-09},
year = {2020},
length = {17},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}
Some structural results on D^n finite functions
A. Jimenez-Pastor, V. Pillwein, M.F. Singer
Advances in Applied Mathematics 117, pp. 0-0. June 2020. Elsevier, 0196-8858. [url] [pdf]author = {A. Jimenez-Pastor and V. Pillwein and M.F. Singer},
title = {{Some structural results on D^n finite functions}},
language = {english},
abstract = {D-finite (or holonomic) functions satisfy linear differential equations with polynomial coefficients. They form a large class of functions that appear in many applications in Mathematics or Physics. It is well-known that these functions are closed under certain operations and these closure properties can be executed algorithmically. Recently, the notion of D-finite functions has been generalized to differentially definable or Dn-finite functions. Also these functions are closed under operations such as forming (anti)derivative, addition or multiplication and, again, these can be implemented. In this paper we investigate how Dn-finite functions behave under composition and how they are related to algebraic and differentially algebraic functions.},
journal = {Advances in Applied Mathematics},
volume = {117},
pages = {0--0},
publisher = {Elsevier},
isbn_issn = {0196-8858},
year = {2020},
month = {June},
refereed = {yes},
length = {0},
url = {https://doi.org/10.1016/j.aam.2020.102027}
}
Holonomic Relations for Modular Functions and Forms: First Guess, then Prove
Peter Paule, Silviu Radu
Technical report no. 20-14 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2020. [pdf]author = {Peter Paule and Silviu Radu},
title = {{Holonomic Relations for Modular Functions and Forms: First Guess, then Prove}},
language = {english},
number = {20-14},
year = {2020},
length = {46},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}
An algorithm to prove holonomic differential equations for modular forms
Peter Paule, Cristian-Silviu Radu
Technical report no. 20-05 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. May 2020. [pdf]author = {Peter Paule and Cristian-Silviu Radu},
title = {{An algorithm to prove holonomic differential equations for modular forms}},
language = {english},
abstract = {Express a modular form $g$ of positive weight locally in terms of a modular function $h$ as$y(h)$, say. Then $y(h)$ as a function in $h$ satisfiesa holonomic differential equation; i.e., one which islinear with coefficients being polynomials in $h$.This fact traces back to Gau{\ss} and has beenpopularized prominently by Zagier. Using holonomicprocedures, computationally it is often straightforwardto derive such differential equations as conjectures.In the spirit of the ``first guess, then prove'' paradigm,we present a new algorithm to prove such conjectures.},
number = {20-05},
year = {2020},
month = {May},
keywords = {modular functions, modular forms, holonomic differential equations, holonomic functions and sequences, Fricke-Klein relations, $q$-series, partition congruences},
sponsor = {FWF SFB F50},
length = {48},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}
A sequence of polynomials generated by a Kapteyn series of the second kind
D. Dominici, V. Pillwein
In: Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra, in Honour of Peter Paule on his 60th Birthday, V. Pillwein and C. Schneider (ed.), Texts and Monographs in Symbolic Computuation, in press , pp. ?-?. 2020. Springer, arXiv:1607.05314 [math.CO]. [url] [pdf]author = {D. Dominici and V. Pillwein},
title = {{A sequence of polynomials generated by a Kapteyn series of the second kind}},
booktitle = {{Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra, in Honour of Peter Paule on his 60th Birthday}},
language = {english},
series = {Texts and Monographs in Symbolic Computuation, in press},
pages = {?--?},
publisher = {Springer},
isbn_issn = {?},
year = {2020},
note = {arXiv:1607.05314 [math.CO]},
editor = {V. Pillwein and C. Schneider},
refereed = {yes},
length = {0},
url = {https://www.dk-compmath.jku.at/publications/dk-reports/2019-05-28/view}
}
A Reduction Theorem of Certain Relations Modulo p Involving Modular Forms
Radu, Cristian-Silviu
In: Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra, in Honour of Peter Paule on his 60th Birthday, V. Pillwein, C. Schneider (ed.), pp. 1-15. 2020. Springer, 978-3-030-44558-4. [pdf]author = {Radu and Cristian-Silviu},
title = {{A Reduction Theorem of Certain Relations Modulo p Involving Modular Forms}},
booktitle = {{Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra, in Honour of Peter Paule on his 60th Birthday}},
language = {english},
pages = {1--15},
publisher = {Springer},
isbn_issn = {978-3-030-44558-4},
year = {2020},
editor = {V. Pillwein and C. Schneider},
refereed = {yes},
length = {15}
}
Three loop QCD corrections to heavy quark form factors
J. Ablinger, J. Blümlein, P. Marquard, N. Rana, C. Schneider
In: Proc. ACAT 2019, , J. Phys.: Conf. Ser. 1525012018, pp. 1-10. 2020. ISSN 1742-6596. arXiv:1905.03728 [hep-ph], doi:10.1088/1742-6596/1525/1/012018. [url]author = {J. Ablinger and J. Blümlein and P. Marquard and N. Rana and C. Schneider},
title = {{Three loop QCD corrections to heavy quark form factors}},
booktitle = {{Proc. ACAT 2019}},
language = {english},
series = {J. Phys.: Conf. Ser.},
volume = {1525},
number = {012018},
pages = {1--10},
isbn_issn = {ISSN 1742-6596},
year = {2020},
note = {arXiv:1905.03728 [hep-ph], doi:10.1088/1742-6596/1525/1/012018},
editor = {?},
refereed = {yes},
length = {10},
url = {https://iopscience.iop.org/article/10.1088/1742-6596/1525/1/012018/}
}
The Absent-Minded Passengers Problem: A Motivating Challenge Solved by Computer Algebra
C. Schneider
Mathematics in Computer Science , pp. ?-?. 2020. ISSN 1661-8289. arXiv:2003.01921 [math.CO]. [url]author = {C. Schneider},
title = {{The Absent-Minded Passengers Problem: A Motivating Challenge Solved by Computer Algebra}},
language = {english},
journal = {Mathematics in Computer Science },
pages = {?--?},
isbn_issn = {ISSN 1661-8289},
year = {2020},
note = {arXiv:2003.01921 [math.CO]},
refereed = {yes},
length = {12},
url = {https://doi.org/10.1007/s11786-020-00494-w}
}
Evaluation of binomial double sums involving absolute values
C. Krattenthaler, C. Schneider
In: Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra, in Honour of Peter Paule on his 60th Birthday, V. Pillwein, C. Schneider (ed.), Texts and Monographs in Symbolic Computuation , pp. 249-295. 2020. Springer, ISBN 978-3-030-44558-4. arXiv:1607.05314 [math.CO]. [url]author = {C. Krattenthaler and C. Schneider},
title = {{Evaluation of binomial double sums involving absolute values}},
booktitle = {{Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra, in Honour of Peter Paule on his 60th Birthday}},
language = {english},
series = {Texts and Monographs in Symbolic Computuation},
pages = {249--295},
publisher = {Springer},
isbn_issn = {ISBN 978-3-030-44558-4},
year = {2020},
note = {arXiv:1607.05314 [math.CO]},
editor = {V. Pillwein and C. Schneider},
refereed = {yes},
length = {47},
url = {https://doi.org/10.1007/978-3-030-44559-1_14}
}
Minimal representations and algebraic relations for single nested products
C. Schneider
Programming and Computer Software 46(2), pp. 133-161. 2020. ISSN 1608-3261. arXiv:1911.04837 [cs.SC]. [url]author = {C. Schneider},
title = {{Minimal representations and algebraic relations for single nested products}},
language = {english},
journal = {Programming and Computer Software},
volume = {46},
number = {2},
pages = {133--161},
isbn_issn = {ISSN 1608-3261},
year = {2020},
note = {arXiv:1911.04837 [cs.SC]},
refereed = {yes},
length = {29},
url = {https://arxiv.org/abs/1911.04837}
}
Representation of hypergeometric products of higher nesting depths in difference rings
E.D. Ocansey, C. Schneider
Technical report no. 20-19 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2020. arXiv:2011.08775 [cs.SC]. [url] [pdf]author = {E.D. Ocansey and C. Schneider},
title = {{Representation of hypergeometric products of higher nesting depths in difference rings}},
language = {english},
number = {20-19},
year = {2020},
note = {arXiv:2011.08775 [cs.SC]},
length = {48},
url = {https://arxiv.org/abs/2011.08775},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}
From Momentum Expansions to Post-Minkowskian Hamiltonians by Computer Algebra Algorithms
J. Blümlein, A. Maier, P. Marquard, G. Schäfer, C. Schneider
Physics Letters B 801(135157), pp. 1-8. 2020. ISSN 0370-2693. arXiv:1911.04411 [gr-qc]. [url]author = {J. Blümlein and A. Maier and P. Marquard and G. Schäfer and C. Schneider},
title = {{From Momentum Expansions to Post-Minkowskian Hamiltonians by Computer Algebra Algorithms}},
language = {english},
journal = {Physics Letters B},
volume = {801},
number = {135157},
pages = {1--8},
isbn_issn = {ISSN 0370-2693},
year = {2020},
note = {arXiv:1911.04411 [gr-qc]},
refereed = {yes},
length = {8},
url = {https://doi.org/10.1016/j.physletb.2019.135157}
}
Heavy quark form factors at three loops
J. Blümlein, P. Marquard, N. Rana, C. Schneider
In: 14th International Symposium on Radiative Corrections (RADCOR2019), D. Kosower, M. Cacciari (ed.)POS(RADCOR2019)013, pp. 1-7. 2020. ISSN 1824-8039. [url]author = {J. Blümlein and P. Marquard and N. Rana and C. Schneider},
title = {{Heavy quark form factors at three loops}},
booktitle = {{14th International Symposium on Radiative Corrections (RADCOR2019)}},
language = {english},
volume = {POS(RADCOR2019)013},
pages = {1--7},
isbn_issn = {ISSN 1824-8039},
year = {2020},
editor = {D. Kosower and M. Cacciari},
refereed = {yes},
length = {7},
url = {https://doi.org/10.22323/1.375.0013 }
}