Computer Algebra for Combinatorics

Computer algebra for enumerative combinatorics and related fields like symbolic integration and summation, number theory (partitions, q-series, etc.), and special functions, incl. particle physics.

Computer Algebra for Combinatorics at RISC is devoted to research that combines computer algebra with enumerative combinatorics and related fields like symbolic integration and summation, number theory (partitions, q-series, etc.), and special functions, including particle physics. For further details see the research groups

Software

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. ...

Authors: Axel Riese
MoreSoftware Website

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 ...

MoreSoftware Website

Engel

A Mathematica Implementation of q-Engel Expansion

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 ...

MoreSoftware Website

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 ...

MoreSoftware Website

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 ...

Authors: Manuel Kauers
MoreSoftware Website

HarmonicSums

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. ...

MoreSoftware Website

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) ...

MoreSoftware Website

ModularGroup

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 ...

MoreSoftware Website

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 ...

MoreSoftware Website

Omega

A Mathematica Implementation of Partition Analysis

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 ...

Authors: Axel Riese
MoreSoftware Website

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 ...

MoreSoftware Website

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. ...

Authors: Axel Riese
MoreSoftware Website

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 ...

Authors: Axel Riese
MoreSoftware Website

RaduRK

RaduRK: Ramanujan-Kolberg Program

RaduRK is a Mathematica implementation of Cristian-Silviu Radu’s algorithm designed to compute Ramanujan-Kolberg identities. These are identities between the generating functions of certain classes of arithmetic sequences a(n), restricted to an arithmetic progression, and linear Q-combinations of eta quotients. These ...

Authors: Nicolas Smoot
More

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 ...

Authors: Axel Riese
MoreSoftware Website

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 ...

MoreSoftware Website

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. ...

MoreSoftware Website

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. ...

Authors: Manuel Kauers
MoreSoftware Website

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 ...

Authors: Manuel Kauers
MoreSoftware Website

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. ...

MoreSoftware Website

Publications

2019

[Ablinger]

Discovering and Proving Infinite Pochhammer Sum Identities

J. Ablinger

Experimental Mathematics, pp. 1-15. 2019. Taylor & Francis, 10.1080/10586458.2019.1627254. [url]
[bib]
@article{RISC5896,
author = {J. Ablinger},
title = {{Discovering and Proving Infinite Pochhammer Sum Identities}},
language = {english},
journal = {Experimental Mathematics},
pages = {1--15},
publisher = {Taylor & Francis},
isbn_issn = {?},
year = {2019},
note = {10.1080/10586458.2019.1627254},
refereed = {yes},
length = {15},
url = {https://doi.org/10.1080/10586458.2019.1627254}
}
[Berkovich]

Polynomial Identities Implying Capparelli's Partition Theorems

Ali Kemal Uncu, Alexander Berkovich

Accepted - Journal of Number Theory, pp. -. 2019. N/A. [url]
[bib]
@article{RISC5790,
author = {Ali Kemal Uncu and Alexander Berkovich},
title = {{Polynomial Identities Implying Capparelli's Partition Theorems }},
language = {english},
journal = {Accepted - Journal of Number Theory},
pages = {--},
isbn_issn = {N/A},
year = {2019},
refereed = {yes},
length = {21},
url = {https://arxiv.org/pdf/1807.10974.pdf}
}
[Berkovich]

Refined q-Trinomial Coefficients and Two Infinite Hierarchies of q-Series Identities

Ali Kemal Uncu, Alexander Berkovich

ArXiv e-prints (accepted), pp. 1-10. 2019. N/A. [url]
[bib]
@article{RISC5801,
author = {Ali Kemal Uncu and Alexander Berkovich},
title = {{Refined q-Trinomial Coefficients and Two Infinite Hierarchies of q-Series Identities }},
language = {english},
abstract = {We will prove an identity involving refined q-trinomial coefficients. We then extend this identity to two infinite families of doubly bounded polynomial identities using transformation properties of the refined q-trinomials in an iterative fashion in the spirit of Bailey chains. One of these two hierarchies contains an identity which is equivalent to Capparelli's first Partition Theorem. },
journal = {ArXiv e-prints (accepted)},
pages = {1--10},
isbn_issn = {N/A},
year = {2019},
refereed = {yes},
length = {10},
url = {https://arxiv.org/abs/1810.12048}
}
[Goswami]

A q-analogue for Euler’s evaluations of the Riemann zeta function

Ankush Goswami

Research in Number Theory 5:3, pp. 1-11. 2019. Springer, 10.1007.
[bib]
@article{RISC5959,
author = {Ankush Goswami},
title = {{A q-analogue for Euler’s evaluations of the Riemann zeta function}},
language = {english},
journal = {Research in Number Theory},
volume = {5:3},
pages = {1--11},
publisher = {Springer},
isbn_issn = {10.1007},
year = {2019},
refereed = {yes},
length = {11}
}
[Goswami]

A q-analogue for Euler’s $\zeta(6)=\pi^6/6$

Ankush Goswami

In: Combinatory Analysis 2018: A Conference in Honor of George Andrews' 80th Birthday, Springer-Birkhauser (ed.), Proceedings of Combinatory Analysis 2018: A Conference in Honor of George Andrews' 80th Birthday, pp. 1-5. 2019. none.
[bib]
@inproceedings{RISC5960,
author = {Ankush Goswami},
title = {{A q-analogue for Euler’s $\zeta(6)=\pi^6/6$}},
booktitle = {{Combinatory Analysis 2018: A Conference in Honor of George Andrews' 80th Birthday}},
language = {english},
pages = {1--5},
isbn_issn = {none},
year = {2019},
editor = {Springer-Birkhauser},
refereed = {yes},
length = {5},
conferencename = {Combinatory Analysis 2018: A Conference in Honor of George Andrews' 80th Birthday}
}
[Goswami]

Some Problems in Analytic Number Theory

Ankush Goswami

University of Florida. PhD Thesis. 2019. First part of this thesis is to appear in Proceedings of Analytic and Combinatorial Number Theory: The Legacy of Ramanujan - A CONFERENCE IN HONOR OF BRUCE C. BERNDT'S 80TH BIRTHDAY.
[bib]
@phdthesis{RISC5961,
author = {Ankush Goswami},
title = {{Some Problems in Analytic Number Theory}},
language = {english},
year = {2019},
note = {First part of this thesis is to appear in Proceedings of Analytic and Combinatorial Number Theory: The Legacy of Ramanujan -- A CONFERENCE IN HONOR OF BRUCE C. BERNDT'S 80TH BIRTHDAY},
translation = {0},
school = {University of Florida},
length = {90}
}
[Hemmecke]

The Generators of all Polynomial Relations among Jacobi Theta Functions

Ralf Hemmecke, Silviu Radu, Liangjie Ye

In: Elliptic Integrals, Elliptic Functions and Modular Forms in Quantum Field Theory, Johannes Blümlein and Carsten Schneider and Peter Paule (ed.), Texts & Monographs in Symbolic Computation 18-09, pp. 259-268. 2019. Springer International Publishing, Cham, 978-3-030-04479-4. Also available as RISC Report 18-09 http://www.risc.jku.at/publications/download/risc_5719/thetarelations.pdf. [url]
[bib]
@incollection{RISC5913,
author = {Ralf Hemmecke and Silviu Radu and Liangjie Ye},
title = {{The Generators of all Polynomial Relations among Jacobi Theta Functions}},
booktitle = {{Elliptic Integrals, Elliptic Functions and Modular Forms in Quantum Field Theory}},
language = {english},
abstract = {In this article, we consider the classical Jacobi theta functions$\theta_i(z)$, $i=1,2,3,4$ and show that the ideal of all polynomialrelations among them with coefficients in$K :=\setQ(\theta_2(0|\tau),\theta_3(0|\tau),\theta_4(0|\tau))$ isgenerated by just two polynomials, that correspond to well knownidentities among Jacobi theta functions.},
series = {Texts & Monographs in Symbolic Computation},
number = {18-09},
pages = {259--268},
publisher = {Springer International Publishing},
address = {Cham},
isbn_issn = {978-3-030-04479-4},
year = {2019},
note = {Also available as RISC Report 18-09 http://www.risc.jku.at/publications/download/risc_5719/thetarelations.pdf},
editor = {Johannes Blümlein and Carsten Schneider and Peter Paule},
refereed = {yes},
length = {9},
url = {https://doi.org/10.1007/978-3-030-04480-0_11}
}
[Jimenez Pastor]

A Computable Extension for Holonomic Functions: DD-Finite Functions

Jiménez-Pastor Antonio, Pillwein Veronika

Journal of Symbolic Computation 94, pp. 90-104. September-October 2019. ISSN 0747-7171. [url]
[bib]
@article{RISC5831,
author = {Jiménez-Pastor Antonio and Pillwein Veronika},
title = {{A Computable Extension for Holonomic Functions: DD-Finite Functions}},
language = {english},
abstract = {Differentiably finite (D-finite) formal power series form a large class of useful functions for which a variety of symbolic algorithms exists. Among these methods are several closure properties that can be carried out automatically. We introduce a natural extension of these functions to a larger class of computable objects for which we prove closure properties. These are again algorithmic. This extension can be iterated constructively preserving the closure properties},
journal = {Journal of Symbolic Computation},
volume = {94},
pages = {90--104},
isbn_issn = {ISSN 0747-7171},
year = {2019},
month = {September-October},
refereed = {yes},
length = {15},
url = {https://doi.org/10.1016/j.jsc.2018.07.002}
}
[Paule]

A Proof of the Weierstrass Gap Theorem not using the Riemann-Roch Formula

Peter Paule, Silviu Radu

Technical report no. 19-02 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. To appear in the Annals of Combinatorics: special issue dedicated to George E. Andrews at the occasion of his 80th birthday., May 2019. [pdf]
[bib]
@techreport{RISC5928,
author = {Peter Paule and Silviu Radu},
title = {{A Proof of the Weierstrass Gap Theorem not using the Riemann-Roch Formula}},
language = {english},
number = {19-02},
year = {2019},
month = {May},
howpublished = {To appear in the Annals of Combinatorics: special issue dedicated to George E. Andrews at the occasion of his 80th birthday.},
length = {47},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}
[Pillwein]

On the positivity of the Gillis–Reznick–Zeilberger rational function

V. Pillwein

Advances in Applied Mathematics 104, pp. 75 - 84. 2019. ISSN 0196-8858. [url]
[bib]
@article{RISC5813,
author = {V. Pillwein},
title = {{On the positivity of the Gillis–Reznick–Zeilberger rational function}},
language = {english},
journal = {Advances in Applied Mathematics},
volume = {104},
pages = {75 -- 84},
isbn_issn = { ISSN 0196-8858},
year = {2019},
refereed = {yes},
keywords = {Positivity, Cylindrical decomposition, Rational function, Symbolic summation},
length = {10},
url = {http://www.sciencedirect.com/science/article/pii/S0196885818301179}
}
[Radu]

COMPUTING AN ORDER COMPLETE BASIS FOR M∞(N) AND APPLICATIONS

Mark van Hoeij and Cristian-Silviu Radu

Technical report no. 19-50 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2019. [pdf]
[bib]
@techreport{RISC5946,
author = {Mark van Hoeij and Cristian-Silviu Radu },
title = {{COMPUTING AN ORDER COMPLETE BASIS FOR M∞(N) AND APPLICATIONS}},
language = {english},
number = {19-50},
year = {2019},
length = {6},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}
[Schneider]

Automated Solution of First Order Factorizable Systems of Differential Equations in One Variable

J. Ablinger, J. Blümlein, P. Marquard, N. Rana, C. Schneider

Nucl. Phys. B 939, pp. 253-291. 2019. ISSN 0550-3213. arXiv:1810.12261 [hep-ph]. [url]
[bib]
@article{RISC5795,
author = {J. Ablinger and J. Blümlein and P. Marquard and N. Rana and C. Schneider},
title = {{Automated Solution of First Order Factorizable Systems of Differential Equations in One Variable}},
language = {english},
journal = {Nucl. Phys. B},
volume = {939},
pages = {253--291},
isbn_issn = {ISSN 0550-3213},
year = {2019},
note = {arXiv:1810.12261 [hep-ph]},
refereed = {yes},
length = {39},
url = {https://www.sciencedirect.com/science/article/pii/S055032131830350X?via%3Dihub}
}
[Schneider]

Towards a symbolic summation theory for unspecified sequences

P. Paule, C. Schneider

In: Elliptic Integrals, Elliptic Functions and Modular Forms in Quantum Field Theory, J. Blümlein, P. Paule, C. Schneider (ed.), Texts and Monographs in Symbolic Computation , pp. 351-390. 2019. Springer, ISBN 978-3-030-04479-4. arXiv:1809.06578 [cs.SC]. [url]
[bib]
@incollection{RISC5750,
author = {P. Paule and C. Schneider},
title = {{Towards a symbolic summation theory for unspecified sequences}},
booktitle = {{Elliptic Integrals, Elliptic Functions and Modular Forms in Quantum Field Theory}},
language = {english},
series = {Texts and Monographs in Symbolic Computation},
pages = {351--390},
publisher = {Springer},
isbn_issn = {ISBN 978-3-030-04479-4},
year = {2019},
note = {arXiv:1809.06578 [cs.SC]},
editor = {J. Blümlein and P. Paule and C. Schneider},
refereed = {yes},
length = {40},
url = {https://arxiv.org/abs/1809.06578}
}
[Schneider]

Three loop QCD corrections to heavy quark form factors

J. Ablinger, J. Blümlein, P. Marquard, N. Rana, C. Schneider

Arxiv. Technical report, 2019. arXiv:1905.03728 [hep-ph]. [url]
[bib]
@techreport{RISC5927,
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}},
language = {english},
year = {2019},
note = {arXiv:1905.03728 [hep-ph]},
institution = {Arxiv},
length = {9},
url = {https://arxiv.org/abs/1905.03728}
}
[Schneider]

Three loop heavy quark form factors and their asymptotic behavior

J. Ablinger, J. Blümlein, P. Marquard, N. Rana, C. Schneider

Cornell University, arxive. Technical report, 2019. arXiv:1906.05829 [hep-ph]. [url]
[bib]
@techreport{RISC5937,
author = {J. Ablinger and J. Blümlein and P. Marquard and N. Rana and C. Schneider},
title = {{Three loop heavy quark form factors and their asymptotic behavior}},
language = {english},
year = {2019},
note = {arXiv:1906.05829 [hep-ph]},
institution = {Cornell University, arxive},
length = {8},
url = {https://arxiv.org/abs/1906.05829}
}
[Schneider]

Numerical Implementation of Harmonic Polylogarithms to Weight w = 8

J. Ablinger, J. Blümlein, M. Round, C. Schneider

Comput. Phys. Comm. 240, pp. 189-201. 2019. ISSN 0010-4655. arXiv:1809.07084 [hep-ph]. [url]
[bib]
@article{RISC5938,
author = {J. Ablinger and J. Blümlein and M. Round and C. Schneider},
title = {{Numerical Implementation of Harmonic Polylogarithms to Weight w = 8}},
language = {english},
journal = {Comput. Phys. Comm.},
volume = {240},
pages = {189--201},
isbn_issn = {ISSN 0010-4655},
year = {2019},
note = {arXiv:1809.07084 [hep-ph]},
refereed = {yes},
length = {12},
url = {https://arxiv.org/pdf/1809.07084.pdf}
}
[Schneider]

The Polarized Three-Loop Anomalous Dimensions from On-Shell Massive Operator Matrix Elements

A. Behring, J. Blümlein, A. De Freitas, A. Goedicke, S. Klein, A. von Manteuffel, C. Schneider, K. Schönwald

Cornell University, arxive. Technical report, 2019. arXiv:1908.03779 [hep-ph]. [url]
[bib]
@techreport{RISC5966,
author = {A. Behring and J. Blümlein and A. De Freitas and A. Goedicke and S. Klein and A. von Manteuffel and C. Schneider and K. Schönwald},
title = {{The Polarized Three-Loop Anomalous Dimensions from On-Shell Massive Operator Matrix Elements}},
language = {english},
year = {2019},
note = {arXiv:1908.03779 [hep-ph]},
institution = {Cornell University, arxive},
length = {40},
url = {https://arxiv.org/abs/1908.03779}
}
[Schneider]

The Heavy Fermion Contributions to the Massive Three Loop Form Factors

J. Blümlein, P. Marquard, N. Rana, C. Schneider

To appear in Nuclear Physics B, pp. 1-88. 2019. ISSN 0550-3213. arXiv:1908.00357 [hep-ph]. [url]
[bib]
@article{RISC5967,
author = {J. Blümlein and P. Marquard and N. Rana and C. Schneider},
title = {{The Heavy Fermion Contributions to the Massive Three Loop Form Factors}},
language = {english},
journal = {To appear in Nuclear Physics B},
volume = {?},
pages = {1--88},
isbn_issn = {ISSN 0550-3213},
year = {2019},
note = {arXiv:1908.00357 [hep-ph]},
refereed = {no},
length = {88},
url = {https://arxiv.org/abs/1908.00357}
}
[Smoot]

A Family of Congruences for Rogers-Ramanujan Subpartitions

Nicolas Allen Smoot

Journal of Number Theory 196, pp. 35-60. March 2019. ISSN 0022-314X. [pdf]
[bib]
@article{RISC5809,
author = {Nicolas Allen Smoot},
title = {{A Family of Congruences for Rogers--Ramanujan Subpartitions}},
language = {english},
abstract = {In 2015 Choi, Kim, and Lovejoy studied a weighted partition function, A1(m), which counted subpartitions with a structure related to the Rogers–Ramanujan identities. They conjectured the existence of an infinite class of congruences for A1(m), modulo powers of 5. We give an explicit form of this conjecture, and prove it for all powers of 5.},
journal = {Journal of Number Theory},
volume = {196},
pages = {35--60},
isbn_issn = {ISSN 0022-314X},
year = {2019},
month = {March},
refereed = {yes},
keywords = {Integer partitions, Partition congruences, Rogers--Ramanujan identities, Ramanujan--Kolberg identities, Modular functions},
sponsor = {FWF: W1214-N15},
length = {26}
}
[Smoot]

An Implementation of Radu's Ramanujan-Kolberg Algorithm

Nicolas Allen Smoot

Research Institute for Symbolic Computation (RISC). Technical report, 2019. Submitted. [pdf]
[bib]
@techreport{RISC5951,
author = {Nicolas Allen Smoot},
title = {{An Implementation of Radu's Ramanujan-Kolberg Algorithm}},
language = {english},
abstract = {In 2015 Cristian-Silviu Radu designed an algorithm to detect identities of a class studied by Ramanujan and Kolberg. This class includes the famous identities by Ramanujan which provide a witness to the divisibility properties of $p(5n+4),$ $p(7n+5)$. We give an implementation of this algorithm using Mathematica. The basic theory is first described, and an outline of the algorithm is briefly given, in order to describe the functionality and utility of our package. We thereafter give multiple examples of applications to recent work in partition theory. In many cases we have used our package to derive alternate proofs of various identities or congruences; in other cases we have improved previously established identities, and in at least one case we have confirmed a standing conjecture.},
year = {2019},
note = {Submitted},
institution = {Research Institute for Symbolic Computation (RISC)},
length = {40}
}

Loading…