# Partition Analysis [F050-06]

### Project Lead

### Project Duration

01/03/2013 - 28/02/2021### Project URL

Go to Website## Partners

### The Austrian Science Fund (FWF)

## Publications

### 2020

[Goswami]

### 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. 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},

length = {13},

type = {RISC Report Series},

institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},

address = {Schloss Hagenberg, 4232 Hagenberg, Austria}

}

**techreport**{RISC6113,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},

length = {13},

type = {RISC Report Series},

institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},

address = {Schloss Hagenberg, 4232 Hagenberg, Austria}

}

[Goswami]

### 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}

}

**techreport**{RISC6114,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}

}

[Goswami]

### 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}

}

**techreport**{RISC6119,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}

}

[Paule]

### Holonomic Relations for Modular Functions and Forms: First Guess, then Prove

#### Peter Paule, Silviu Radu

2020. [pdf]@

author = {Peter Paule and Silviu Radu},

title = {{Holonomic Relations for Modular Functions and Forms: First Guess, then Prove}},

language = {english},

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}

}

**techreport**{RISC6081,author = {Peter Paule and Silviu Radu},

title = {{Holonomic Relations for Modular Functions and Forms: First Guess, then Prove}},

language = {english},

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}

}

[Paule]

### An algorithm to prove holonomic differential equations for modular forms

#### Peter Paule, Cristian-Silviu Radu

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

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}

}

**techreport**{RISC6108,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.},

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}

}

[Radu]

### 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}

}

**incollection**{RISC6110,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}

}

### 2019

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

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}

}

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

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}

}

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

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}

}

**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}

}

[Goswami]

### On the parity of some partition functions

#### Ankush Goswami, Abhash Kumar Jha

Technical report no. 20-06 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2019. [pdf]@

author = {Ankush Goswami and Abhash Kumar Jha},

title = {{On the parity of some partition functions}},

language = {english},

abstract = {Recently, Andrews carried out a thorough investigation of integer partitions in which all parts of a given parity are smaller than those of the opposite parity. Further, considering a subset of this set of partitions, he obtains several interesting arithmetic and combinatorial properties and its connections to the third order mock theta function $\nu(q)$. In fact, he shows the existence of a Dyson-type crank that explains a mod $5$ congruence in this subset. At the end of his paper, one of the problems he poses is to undertake a more extensive investigation on the properties of the subset of partitions. Since then there have been several investigations in various ways, including works of Jennings-Shaffer and Bringmann (Ann. Comb. 2019), Barman and Ray (2019), and Uncu (2019). In this paper, we study certain congruences satisfied by the above set of partitions (and the subset above) along with a certain subset of partitions (of Andrews' partitions above) studied by Uncu and also establish a connection between one of Andrews' partition function above with $p(n)$, the number of unrestricted partitions of $n$. Besides, we provide a combinatorial description of Uncu's partition function. },

number = {20-06},

year = {2019},

sponsor = {First author: SFB F50-06 of the Austrian Science Fund (FWF)},

length = {15},

type = {RISC Report Series},

institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},

address = {Schloss Hagenberg, 4232 Hagenberg, Austria}

}

**techreport**{RISC6112,author = {Ankush Goswami and Abhash Kumar Jha},

title = {{On the parity of some partition functions}},

language = {english},

abstract = {Recently, Andrews carried out a thorough investigation of integer partitions in which all parts of a given parity are smaller than those of the opposite parity. Further, considering a subset of this set of partitions, he obtains several interesting arithmetic and combinatorial properties and its connections to the third order mock theta function $\nu(q)$. In fact, he shows the existence of a Dyson-type crank that explains a mod $5$ congruence in this subset. At the end of his paper, one of the problems he poses is to undertake a more extensive investigation on the properties of the subset of partitions. Since then there have been several investigations in various ways, including works of Jennings-Shaffer and Bringmann (Ann. Comb. 2019), Barman and Ray (2019), and Uncu (2019). In this paper, we study certain congruences satisfied by the above set of partitions (and the subset above) along with a certain subset of partitions (of Andrews' partitions above) studied by Uncu and also establish a connection between one of Andrews' partition function above with $p(n)$, the number of unrestricted partitions of $n$. Besides, we provide a combinatorial description of Uncu's partition function. },

number = {20-06},

year = {2019},

sponsor = {First author: SFB F50-06 of the Austrian Science Fund (FWF)},

length = {15},

type = {RISC Report Series},

institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},

address = {Schloss Hagenberg, 4232 Hagenberg, Austria}

}

[Hemmecke]

### Construction of all Polynomial Relations among Dedekind Eta Functions of Level $N$

#### Ralf Hemmecke, Silviu Radu

Journal of Symbolic Compuation 95, pp. 39-52. 2019. ISSN 0747-7171. Also available as RISC Report 18-03 http://www.risc.jku.at/publications/download/risc_5561/etarelations.pdf. [url]@

author = {Ralf Hemmecke and Silviu Radu},

title = {{Construction of all Polynomial Relations among Dedekind Eta Functions of Level $N$}},

language = {english},

abstract = {We describe an algorithm that, given a positive integer $N$,computes a Gr\"obner basis of the ideal of polynomial relations among Dedekind$\eta$-functions of level $N$, i.e., among the elements of$\{\eta(\delta_1\tau),\ldots,\eta(\delta_n\tau)\}$ where$1=\delta_1<\delta_2\dots<\delta_n=N$ are the positive divisors of$N$.More precisely, we find a finite generating set (which is also aGr\"obner basis of the ideal $\ker\phi$ where\begin{gather*} \phi:Q[E_1,\ldots,E_n] \to Q[\eta(\delta_1\tau),\ldots,\eta(\delta_n\tau)], \quad E_k\mapsto \eta(\delta_k\tau), \quad k=1,\ldots,n.\end{gather*}},

journal = {Journal of Symbolic Compuation},

volume = {95},

pages = {39--52},

isbn_issn = {ISSN 0747-7171},

year = {2019},

note = {Also available as RISC Report 18-03 http://www.risc.jku.at/publications/download/risc_5561/etarelations.pdf},

refereed = {yes},

keywords = {Dedekind $\eta$ function, modular functions, modular equations, ideal of relations, Groebner basis},

length = {14},

url = {https://doi.org/10.1016/j.jsc.2018.10.001}

}

**article**{RISC5703,author = {Ralf Hemmecke and Silviu Radu},

title = {{Construction of all Polynomial Relations among Dedekind Eta Functions of Level $N$}},

language = {english},

abstract = {We describe an algorithm that, given a positive integer $N$,computes a Gr\"obner basis of the ideal of polynomial relations among Dedekind$\eta$-functions of level $N$, i.e., among the elements of$\{\eta(\delta_1\tau),\ldots,\eta(\delta_n\tau)\}$ where$1=\delta_1<\delta_2\dots<\delta_n=N$ are the positive divisors of$N$.More precisely, we find a finite generating set (which is also aGr\"obner basis of the ideal $\ker\phi$ where\begin{gather*} \phi:Q[E_1,\ldots,E_n] \to Q[\eta(\delta_1\tau),\ldots,\eta(\delta_n\tau)], \quad E_k\mapsto \eta(\delta_k\tau), \quad k=1,\ldots,n.\end{gather*}},

journal = {Journal of Symbolic Compuation},

volume = {95},

pages = {39--52},

isbn_issn = {ISSN 0747-7171},

year = {2019},

note = {Also available as RISC Report 18-03 http://www.risc.jku.at/publications/download/risc_5561/etarelations.pdf},

refereed = {yes},

keywords = {Dedekind $\eta$ function, modular functions, modular equations, ideal of relations, Groebner basis},

length = {14},

url = {https://doi.org/10.1016/j.jsc.2018.10.001}

}

[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]@

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}

}

**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}

}

[Hemmecke]

### Construction of Modular Function Bases for $\Gamma_0(121)$ related to $p(11n+6)$

#### Ralh Hemmecke, Peter Paule, Silviu Radu

Technical report no. 19-10 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. October 2019. [url] [pdf]@

author = {Ralh Hemmecke and Peter Paule and Silviu Radu},

title = {{Construction of Modular Function Bases for $\Gamma_0(121)$ related to $p(11n+6)$}},

language = {english},

number = {19-10},

year = {2019},

month = {October},

keywords = {Ramanujan identities, bases for modular functions, integral bases},

sponsor = {FWF (SFB F50-06)},

length = {17},

url = {https://risc.jku.at/people/hemmecke/papers/integralbasis/},

type = {RISC Report Series},

institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},

address = {Schloss Hagenberg, 4232 Hagenberg, Austria}

}

**techreport**{RISC5983,author = {Ralh Hemmecke and Peter Paule and Silviu Radu},

title = {{Construction of Modular Function Bases for $\Gamma_0(121)$ related to $p(11n+6)$}},

language = {english},

number = {19-10},

year = {2019},

month = {October},

keywords = {Ramanujan identities, bases for modular functions, integral bases},

sponsor = {FWF (SFB F50-06)},

length = {17},

url = {https://risc.jku.at/people/hemmecke/papers/integralbasis/},

type = {RISC Report Series},

institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},

address = {Schloss Hagenberg, 4232 Hagenberg, Austria}

}

[Radu]

### Infinite Product Formulae for Generating Functions for Sequences of Squares

#### Christian Krattenthaler, Mircea Merca, Cristian-Silviu Radu

2019. [pdf]@

author = {Christian Krattenthaler and Mircea Merca and Cristian-Silviu Radu},

title = {{Infinite Product Formulae for Generating Functions for Sequences of Squares}},

language = {english},

year = {2019},

length = {37},

type = {RISC Report Series},

institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},

address = {Schloss Hagenberg, 4232 Hagenberg, Austria}

}

**techreport**{RISC6013,author = {Christian Krattenthaler and Mircea Merca and Cristian-Silviu Radu},

title = {{Infinite Product Formulae for Generating Functions for Sequences of Squares}},

language = {english},

year = {2019},

length = {37},

type = {RISC Report Series},

institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},

address = {Schloss Hagenberg, 4232 Hagenberg, Austria}

}

### 2018

[Jiu]

### The Method of Brackets in Experimental Mathematics

#### Ivan Gonzalez, Karen Kohl, Lin Jiu, and Victor H. Moll

In: Frontiers in Orthogonal Polynomials and q-Series, Xin Li, Zuhair Nashed (ed.), pp. -. 2018. World Scientific Publishing, 978-981-3228-87-0. [url]@

author = {Ivan Gonzalez and Karen Kohl and Lin Jiu and and Victor H. Moll},

title = {{The Method of Brackets in Experimental Mathematics}},

booktitle = {{Frontiers in Orthogonal Polynomials and q-Series}},

language = {english},

pages = {--},

publisher = {World Scientific Publishing},

isbn_issn = {978-981-3228-87-0},

year = {2018},

editor = {Xin Li and Zuhair Nashed},

refereed = {no},

length = {0},

url = {http://www.worldscientific.com/worldscibooks/10.1142/10677}

}

**incollection**{RISC5497,author = {Ivan Gonzalez and Karen Kohl and Lin Jiu and and Victor H. Moll},

title = {{The Method of Brackets in Experimental Mathematics}},

booktitle = {{Frontiers in Orthogonal Polynomials and q-Series}},

language = {english},

pages = {--},

publisher = {World Scientific Publishing},

isbn_issn = {978-981-3228-87-0},

year = {2018},

editor = {Xin Li and Zuhair Nashed},

refereed = {no},

length = {0},

url = {http://www.worldscientific.com/worldscibooks/10.1142/10677}

}

[Magnusson]

### The functional equation of Dedekind's $\eta$-function

#### Tobias Magnusson

June 15 2018. [pdf] [tex]@

author = {Tobias Magnusson},

title = {{The functional equation of Dedekind's $\eta$-function}},

language = {English},

year = {2018},

month = {June 15},

length = {14},

type = {RISC Report Series},

institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},

address = {Schloss Hagenberg, 4232 Hagenberg, Austria}

}

**techreport**{RISC5701,author = {Tobias Magnusson},

title = {{The functional equation of Dedekind's $\eta$-function}},

language = {English},

year = {2018},

month = {June 15},

length = {14},

type = {RISC Report Series},

institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},

address = {Schloss Hagenberg, 4232 Hagenberg, Austria}

}

### 2017

[Jiu]

### Integral representations of equally positive integer-indexed harmonic sums at infinity

#### L. Jiu

Research in Number Theory 3(10), pp. 1-4. 2017. 2363-9555. [url]@

author = {L. Jiu},

title = {{Integral representations of equally positive integer-indexed harmonic sums at infinity}},

language = {English},

abstract = {We identify a partition-theoretic generalization of Riemann zeta function and the equally positive integer-indexed harmonic sums at infinity, to obtain the generating function and the integral representations of the latter. The special cases coincide with zeta values at positive integer arguments.},

journal = {Research in Number Theory},

volume = {3},

number = {10},

pages = {1--4},

isbn_issn = {2363-9555},

year = {2017},

refereed = {no},

length = {4},

url = {https://resnumtheor.springeropen.com/articles/10.1007/s40993-017-0074-x}

}

**article**{RISC5385,author = {L. Jiu},

title = {{Integral representations of equally positive integer-indexed harmonic sums at infinity}},

language = {English},

abstract = {We identify a partition-theoretic generalization of Riemann zeta function and the equally positive integer-indexed harmonic sums at infinity, to obtain the generating function and the integral representations of the latter. The special cases coincide with zeta values at positive integer arguments.},

journal = {Research in Number Theory},

volume = {3},

number = {10},

pages = {1--4},

isbn_issn = {2363-9555},

year = {2017},

refereed = {no},

length = {4},

url = {https://resnumtheor.springeropen.com/articles/10.1007/s40993-017-0074-x}

}

[Jiu]

### An extension of the method of brackets. Part 1

#### Ivan Gonzalez, Karen Kohl, Lin Jiu, and Victor H. Moll

Open Mathematics (formerly Central European Journal of Mathematics) 15, pp. 1181-1211. 2017. 2391-5455. [url]@

author = {Ivan Gonzalez and Karen Kohl and Lin Jiu and and Victor H. Moll},

title = {{An extension of the method of brackets. Part 1}},

language = {english},

abstract = {The method of brackets is an efficient method for the evaluation of a large class of definite integrals on the half-line. It is based on a small collection of rules, some of which are heuristic. The extension discussed here is based on the concepts of null and divergent series. These are formal representations of functions, whose coefficients $a_n$ have meromorphic representations for $n\in\mathbb{C}$, but might vanish or blow up when $n\in\mathbb{N}$. These ideas are illustrated with the evaluation of a variety of entries from the classical table of integrals by Gradshteyn and Ryzhik.},

journal = {Open Mathematics (formerly Central European Journal of Mathematics)},

volume = {15},

pages = {1181--1211},

isbn_issn = {2391-5455},

year = {2017},

refereed = {no},

length = {31},

url = {https://www.degruyter.com/view/j/math.2017.15.issue-1/math-2017-0100/math-2017-0100.xml?format=INT}

}

**article**{RISC5483,author = {Ivan Gonzalez and Karen Kohl and Lin Jiu and and Victor H. Moll},

title = {{An extension of the method of brackets. Part 1}},

language = {english},

abstract = {The method of brackets is an efficient method for the evaluation of a large class of definite integrals on the half-line. It is based on a small collection of rules, some of which are heuristic. The extension discussed here is based on the concepts of null and divergent series. These are formal representations of functions, whose coefficients $a_n$ have meromorphic representations for $n\in\mathbb{C}$, but might vanish or blow up when $n\in\mathbb{N}$. These ideas are illustrated with the evaluation of a variety of entries from the classical table of integrals by Gradshteyn and Ryzhik.},

journal = {Open Mathematics (formerly Central European Journal of Mathematics)},

volume = {15},

pages = {1181--1211},

isbn_issn = {2391-5455},

year = {2017},

refereed = {no},

length = {31},

url = {https://www.degruyter.com/view/j/math.2017.15.issue-1/math-2017-0100/math-2017-0100.xml?format=INT}

}

[Xiong]

### Overpartitions and ternary quadratic forms

#### xinhua xiong

The Ramanujan Journal 42(2), pp. 429-442. 2017. issn:1382-4090.@

author = {xinhua xiong},

title = {{Overpartitions and ternary quadratic forms}},

language = {english},

journal = {The Ramanujan Journal},

volume = {42},

number = {2},

pages = {429--442},

isbn_issn = {issn:1382-4090},

year = {2017},

refereed = {yes},

length = {13}

}

**article**{RISC5417,author = {xinhua xiong},

title = {{Overpartitions and ternary quadratic forms}},

language = {english},

journal = {The Ramanujan Journal},

volume = {42},

number = {2},

pages = {429--442},

isbn_issn = {issn:1382-4090},

year = {2017},

refereed = {yes},

length = {13}

}

[Ye]

### Elliptic Function Based Algorithms to Prove Jacobi Theta Function Relations

#### Liangjie Ye

Journal of Symbolic Computation, to appear, pp. 1-25. 2017. -. [pdf]@

author = {Liangjie Ye},

title = {{Elliptic Function Based Algorithms to Prove Jacobi Theta Function Relations}},

language = {english},

journal = {Journal of Symbolic Computation, to appear},

pages = {1--25},

isbn_issn = {-},

year = {2017},

refereed = {yes},

length = {25}

}

**article**{RISC5286,author = {Liangjie Ye},

title = {{Elliptic Function Based Algorithms to Prove Jacobi Theta Function Relations}},

language = {english},

journal = {Journal of Symbolic Computation, to appear},

pages = {1--25},

isbn_issn = {-},

year = {2017},

refereed = {yes},

length = {25}

}