Technologietransfer 2017
Project Lead
Project Duration
01/01/2017 - 31/12/2017Partners
Government of Upper Austria

Publications
2025
[Baumgartner]
Equational Generalization Problems with Atom-Variables
Alexander Baumgartner, Temur Kutsia, Daniele Nantes-Sobrinho, Manfred Schmidt-Schauss
In: Intelligent Computer Mathematics - 18th International Conference, CICM 2025, Brasilia, Brazil, October 6-10, 2025, Proceedings, Valeria de Paiva and Peter Koepke (ed.), Lecture Notes in Computer Science 16136, pp. 133-151. 2025. Springer, ISBN 978-3-032-07020-3. [doi]@inproceedings{RISC7188,
author = {Alexander Baumgartner and Temur Kutsia and Daniele Nantes-Sobrinho and Manfred Schmidt-Schauss},
title = {{Equational Generalization Problems with Atom-Variables}},
booktitle = {{Intelligent Computer Mathematics - 18th International Conference, CICM 2025, Brasilia, Brazil, October 6-10, 2025, Proceedings}},
language = {english},
series = {Lecture Notes in Computer Science},
volume = {16136},
pages = {133--151},
publisher = {Springer},
isbn_issn = {ISBN 978-3-032-07020-3},
year = {2025},
editor = {Valeria de Paiva and Peter Koepke},
refereed = {yes},
length = {19},
url = {https://doi.org/10.1007/978-3-032-07021-0_8}
}
author = {Alexander Baumgartner and Temur Kutsia and Daniele Nantes-Sobrinho and Manfred Schmidt-Schauss},
title = {{Equational Generalization Problems with Atom-Variables}},
booktitle = {{Intelligent Computer Mathematics - 18th International Conference, CICM 2025, Brasilia, Brazil, October 6-10, 2025, Proceedings}},
language = {english},
series = {Lecture Notes in Computer Science},
volume = {16136},
pages = {133--151},
publisher = {Springer},
isbn_issn = {ISBN 978-3-032-07020-3},
year = {2025},
editor = {Valeria de Paiva and Peter Koepke},
refereed = {yes},
length = {19},
url = {https://doi.org/10.1007/978-3-032-07021-0_8}
}
[Cerna]
Combining Generalization Algorithms in Regular Collapse-Free Theories
Mauricio Ayala-Rincón, David Cerna, Temur Kutsia, Christophe Ringeissen
In: Proceedings of the 10th International Conference on Formal Structures for Computation and Deduction (FSCD 2025), Maribel Fernandez (ed.), LIPIcs - Leibniz International Proceedings in Informatics 337, pp. 7:1-7:18. 2025. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, ISBN 978-3-95977-374-4. [doi]@inproceedings{RISC7156,
author = {Mauricio Ayala-Rincón and David Cerna and Temur Kutsia and Christophe Ringeissen},
title = {{Combining Generalization Algorithms in Regular Collapse-Free Theories}},
booktitle = {{Proceedings of the 10th International Conference on Formal Structures for Computation and Deduction (FSCD 2025)}},
language = {english},
series = {LIPIcs - Leibniz International Proceedings in Informatics},
volume = {337},
pages = {7:1--7:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn_issn = {ISBN 978-3-95977-374-4},
year = {2025},
editor = {Maribel Fernandez},
refereed = {yes},
length = {0},
url = {https://doi.org/10.4230/LIPIcs.FSCD.2025.7}
}
author = {Mauricio Ayala-Rincón and David Cerna and Temur Kutsia and Christophe Ringeissen},
title = {{Combining Generalization Algorithms in Regular Collapse-Free Theories}},
booktitle = {{Proceedings of the 10th International Conference on Formal Structures for Computation and Deduction (FSCD 2025)}},
language = {english},
series = {LIPIcs - Leibniz International Proceedings in Informatics},
volume = {337},
pages = {7:1--7:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn_issn = {ISBN 978-3-95977-374-4},
year = {2025},
editor = {Maribel Fernandez},
refereed = {yes},
length = {0},
url = {https://doi.org/10.4230/LIPIcs.FSCD.2025.7}
}
[Chen]
A Unified Reduction for Hypergeometric and $q$-Hypergeometric Creative Telescoping
Shaoshi Chen, Hao Du, Yiman Gao, Hui Huang, Ziming Li
The Ramanujan J. 68(14), pp. 1-39. 2025. ISSN 1572-9303. arXiv:2501.03837 [cs.SC]. [doi] [pdf]@article{RISC7154,
author = {Shaoshi Chen and Hao Du and Yiman Gao and Hui Huang and Ziming Li},
title = {{A Unified Reduction for Hypergeometric and $q$-Hypergeometric Creative Telescoping}},
language = {english},
journal = {The Ramanujan J.},
volume = {68},
number = {14},
pages = {1--39},
isbn_issn = {ISSN 1572-9303},
year = {2025},
note = {arXiv:2501.03837 [cs.SC]},
refereed = {yes},
length = {39},
url = {https://doi.org/10.1007/s11139-025-01164-w}
}
author = {Shaoshi Chen and Hao Du and Yiman Gao and Hui Huang and Ziming Li},
title = {{A Unified Reduction for Hypergeometric and $q$-Hypergeometric Creative Telescoping}},
language = {english},
journal = {The Ramanujan J.},
volume = {68},
number = {14},
pages = {1--39},
isbn_issn = {ISSN 1572-9303},
year = {2025},
note = {arXiv:2501.03837 [cs.SC]},
refereed = {yes},
length = {39},
url = {https://doi.org/10.1007/s11139-025-01164-w}
}
[de Freitas]
The three-loop single-mass heavy-flavor corrections to the structure functions $F_2(x, Q^2)$ and $g_1(x, Q^2)$
J. Ablinger, A. Behring, J. Blümlein, A. De Freitas, A. von Manteuffel, C. Schneider, K. Schönwald
Technical report no. 25-08 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). September 2025. Licensed under CC BY 4.0 International. [doi] [pdf]@techreport{RISC7178,
author = {J. Ablinger and A. Behring and J. Blümlein and A. De Freitas and A. von Manteuffel and C. Schneider and K. Schönwald},
title = {{The three-loop single-mass heavy-flavor corrections to the structure functions $F_2(x,Q^2)$ and $g_1(x,Q^2)$}},
language = {english},
abstract = {We report quantitative results on the single-mass heavy-flavor contributions up to three-loop order to the unpolarized structure function $F_2(x,Q^2)$ and the polarized structure function $g_1(x,Q^2)$ for the first time. These results are relevant for precision QCD analyses of the World deep-inelastic data and the data taken at future colliders, such as the Electron--Ion Collider, in order to measure the strong coupling constant $alpha_s(M_Z^2)$, and the twist-2 parton distribution functions consistently at next-to-next-to-leading order.},
number = {25-08},
year = {2025},
month = {September},
keywords = {single-mass heavy-flavor contributions, QCD, Feynman diagrams, computer algebra},
length = {6},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
author = {J. Ablinger and A. Behring and J. Blümlein and A. De Freitas and A. von Manteuffel and C. Schneider and K. Schönwald},
title = {{The three-loop single-mass heavy-flavor corrections to the structure functions $F_2(x,Q^2)$ and $g_1(x,Q^2)$}},
language = {english},
abstract = {We report quantitative results on the single-mass heavy-flavor contributions up to three-loop order to the unpolarized structure function $F_2(x,Q^2)$ and the polarized structure function $g_1(x,Q^2)$ for the first time. These results are relevant for precision QCD analyses of the World deep-inelastic data and the data taken at future colliders, such as the Electron--Ion Collider, in order to measure the strong coupling constant $alpha_s(M_Z^2)$, and the twist-2 parton distribution functions consistently at next-to-next-to-leading order.},
number = {25-08},
year = {2025},
month = {September},
keywords = {single-mass heavy-flavor contributions, QCD, Feynman diagrams, computer algebra},
length = {6},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
[de Freitas]
The Single-Mass Variable Flavor Number Scheme at Three-Loop Order
J. Ablinger, A. Behring, J. Blümlein, d, A. De Freitas, A. von Manteuffel, C. Schneider, and K. Schönwald
Technical report no. 25-04 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). October 2025. arXiv:2510.02175 [hep-ph]. Licensed under CC BY 4.0 International. [doi] [pdf]@techreport{RISC7181,
author = {J. Ablinger and A. Behring and J. Blümlein and d and A. De Freitas and A. von Manteuffel and C. Schneider and and K. Schönwald},
title = {{The Single-Mass Variable Flavor Number Scheme at Three-Loop Order}},
language = {english},
abstract = {The matching relations in the unpolarized and polarized variable flavor number scheme at three-loop order are presented in the single-mass case. They describe the process of massive quarks becoming light at large virtualities $Q^2$. In this framework, heavy-quark parton distributions can be defined. Numerical results are presented on the matching relations in the case of the single-mass variable flavor number scheme for the light parton, charm and bottom quark distributions. These relations are process independent. In the polarized case we generally work in the Larin scheme. To two-loop order we present the polarized massive OMEs also in the $overline{rm MS}$ scheme. Fast numerical codes for the single-mass massive operator matrix elements are provided. },
number = {25-04},
year = {2025},
month = {October},
note = {arXiv:2510.02175 [hep-ph]},
keywords = {QCD, Feynman diagrams, computer algebra},
length = {27},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
author = {J. Ablinger and A. Behring and J. Blümlein and d and A. De Freitas and A. von Manteuffel and C. Schneider and and K. Schönwald},
title = {{The Single-Mass Variable Flavor Number Scheme at Three-Loop Order}},
language = {english},
abstract = {The matching relations in the unpolarized and polarized variable flavor number scheme at three-loop order are presented in the single-mass case. They describe the process of massive quarks becoming light at large virtualities $Q^2$. In this framework, heavy-quark parton distributions can be defined. Numerical results are presented on the matching relations in the case of the single-mass variable flavor number scheme for the light parton, charm and bottom quark distributions. These relations are process independent. In the polarized case we generally work in the Larin scheme. To two-loop order we present the polarized massive OMEs also in the $overline{rm MS}$ scheme. Fast numerical codes for the single-mass massive operator matrix elements are provided. },
number = {25-04},
year = {2025},
month = {October},
note = {arXiv:2510.02175 [hep-ph]},
keywords = {QCD, Feynman diagrams, computer algebra},
length = {27},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
[de Freitas]
The two-mass contributions to the three-loop massive operator matrix elements $tilde{A}_{Qg}^{(3)}$ and $Delta tilde{A}_{Qg}^{(3)}$
J. Ablinger, J. Bluemlein, A. De Freitas, A. von Manteuffel, C. Schneider, Kay Schoenwald
To appear in Journal of High Energy Physics, pp. ?-?. 2025. ISSN 1029-8479. arXiv:2510.09403 [hep-ph]. [doi]@article{RISC7198,
author = {J. Ablinger and J. Bluemlein and A. De Freitas and A. von Manteuffel and C. Schneider and Kay Schoenwald},
title = {{The two-mass contributions to the three-loop massive operator matrix elements $tilde{A}_{Qg}^{(3)}$ and $Delta tilde{A}_{Qg}^{(3)}$}},
language = {english},
abstract = {We calculate the two-mass three-loop contributions to the unpolarized and polarized massive operator matrix elements $tilde{A}_{Qg}^{(3)}$ and $Delta tilde{A}_{Qg}^{(3)}$ in $x$-space for a general mass ratio by using a semi-analytic approach. We also compute Mellin moments up to $N = 2000 (3000)$ by an independent method, to which we compare the results in $x$-space. In the polarized case, we work in the Larin scheme. We present numerical results. The two-mass contributions amount to about $50 %$ of the full textcolor{blue}{$O(T_F^2)$} and textcolor{blue}{$O(T_F^3)$} terms contributing to the operator matrix elements. The present result completes the calculation of all unpolarized and polarized massive three-loop operator matrix elements.},
journal = {To appear in Journal of High Energy Physics},
volume = {?},
pages = {?--?},
isbn_issn = {ISSN 1029-8479},
year = {2025},
note = {arXiv:2510.09403 [hep-ph]},
refereed = {yes},
length = {50},
url = {https://doi.org/10.35011/risc.25-07}
}
author = {J. Ablinger and J. Bluemlein and A. De Freitas and A. von Manteuffel and C. Schneider and Kay Schoenwald},
title = {{The two-mass contributions to the three-loop massive operator matrix elements $tilde{A}_{Qg}^{(3)}$ and $Delta tilde{A}_{Qg}^{(3)}$}},
language = {english},
abstract = {We calculate the two-mass three-loop contributions to the unpolarized and polarized massive operator matrix elements $tilde{A}_{Qg}^{(3)}$ and $Delta tilde{A}_{Qg}^{(3)}$ in $x$-space for a general mass ratio by using a semi-analytic approach. We also compute Mellin moments up to $N = 2000 (3000)$ by an independent method, to which we compare the results in $x$-space. In the polarized case, we work in the Larin scheme. We present numerical results. The two-mass contributions amount to about $50 %$ of the full textcolor{blue}{$O(T_F^2)$} and textcolor{blue}{$O(T_F^3)$} terms contributing to the operator matrix elements. The present result completes the calculation of all unpolarized and polarized massive three-loop operator matrix elements.},
journal = {To appear in Journal of High Energy Physics},
volume = {?},
pages = {?--?},
isbn_issn = {ISSN 1029-8479},
year = {2025},
note = {arXiv:2510.09403 [hep-ph]},
refereed = {yes},
length = {50},
url = {https://doi.org/10.35011/risc.25-07}
}
[de Freitas]
The heavy quark-antiquark asymmetry in the variable flavor number scheme
A. Behring, J. Bluemlein, A. De Freitas, A. von Manteuffel, C. Schneider, K. Schoenwald
Technical report no. 25-10 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). December 2025. arXiv:2512.13508 [hep-ph]. Licensed under CC BY 4.0 International. [doi] [pdf]@techreport{RISC7210,
author = {A. Behring and J. Bluemlein and A. De Freitas and A. von Manteuffel and C. Schneider and K. Schoenwald},
title = {{The heavy quark-antiquark asymmetry in the variable flavor number scheme}},
language = {english},
abstract = {The twist-2 heavy-quark and antiquark distributions, as defined in the variable flavor number scheme, turn out to be different due to QCD corrections from three-loop onward. This is caused by terms containing the color factor $d_{abc} d^{abc}$ in the heavy-flavor massive pure-singlet operator matrix elements (OMEs) $A^{rm PS, s, (3)}_{Qq}$ for odd moments in the unpolarized case and for $Delta A^{rm PS, s, (3)}_{Qq}$ for even moments in the polarized case. The dependence on the factorization scale of the OMEs is ruled by the anomalous dimensions $gamma^{rm NS, s, (2)}_{qq}$ and $Delta gamma^{rm NS, s, (2)}_{qq}$. The polarized calculations are performed in the Larin scheme. We compute the corresponding three-loop heavy-flavor distributions $(Delta) f_Q(x,Q^2) - (Delta) f_{overline{Q}}(x,Q^2)$. Compared to the sum of the heavy-quark and antiquark parton distributions, their difference is small, however, non-vanishing. },
number = {25-10},
year = {2025},
month = {December},
note = {arXiv:2512.13508 [hep-ph]},
keywords = {particle physics, QCD, massive 3-loop eynman integrals, computer algebra, solving recurrences},
length = {17},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
author = {A. Behring and J. Bluemlein and A. De Freitas and A. von Manteuffel and C. Schneider and K. Schoenwald},
title = {{The heavy quark-antiquark asymmetry in the variable flavor number scheme}},
language = {english},
abstract = {The twist-2 heavy-quark and antiquark distributions, as defined in the variable flavor number scheme, turn out to be different due to QCD corrections from three-loop onward. This is caused by terms containing the color factor $d_{abc} d^{abc}$ in the heavy-flavor massive pure-singlet operator matrix elements (OMEs) $A^{rm PS, s, (3)}_{Qq}$ for odd moments in the unpolarized case and for $Delta A^{rm PS, s, (3)}_{Qq}$ for even moments in the polarized case. The dependence on the factorization scale of the OMEs is ruled by the anomalous dimensions $gamma^{rm NS, s, (2)}_{qq}$ and $Delta gamma^{rm NS, s, (2)}_{qq}$. The polarized calculations are performed in the Larin scheme. We compute the corresponding three-loop heavy-flavor distributions $(Delta) f_Q(x,Q^2) - (Delta) f_{overline{Q}}(x,Q^2)$. Compared to the sum of the heavy-quark and antiquark parton distributions, their difference is small, however, non-vanishing. },
number = {25-10},
year = {2025},
month = {December},
note = {arXiv:2512.13508 [hep-ph]},
keywords = {particle physics, QCD, massive 3-loop eynman integrals, computer algebra, solving recurrences},
length = {17},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
[Dundua]
Higher-Order Pattern Unification Modulo Similarity Relations
Besik Dundua, Temur Kutsia
Technical report no. 25-03 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). February 2025. Licensed under CC BY 4.0 International. [doi] [pdf]@techreport{RISC7141,
author = {Besik Dundua and Temur Kutsia},
title = {{Higher-Order Pattern Unification Modulo Similarity Relations}},
language = {english},
abstract = {The combination of higher-order theories and fuzzy logic can be useful in decision-making tasks that involve reasoning across abstract functions and predicates, where exact matches are often rare or unnecessary. Developing efficient reasoning and computational techniques for such a combined formalism presents a significant challenge. In this paper, we adopt a more straightforward approach aiming at integrating two well-established and computationally well-behaving components: higher-order patterns on one side and fuzzy equivalences expressed through similarity relations based on minimum T-norm on the other. We propose a unification algorithm for higher-order patterns modulo these similarity relations and prove its termination, soundness, and completeness. This unification problem, like its crisp counterpart, is unitary. The algorithm computes the most general unifier with the highest degree of approximation when the given terms are unifiable.},
number = {25-03},
year = {2025},
month = {February},
keywords = {Unification, higher-order patterns, fuzzy similarity relations},
length = {20},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
author = {Besik Dundua and Temur Kutsia},
title = {{Higher-Order Pattern Unification Modulo Similarity Relations}},
language = {english},
abstract = {The combination of higher-order theories and fuzzy logic can be useful in decision-making tasks that involve reasoning across abstract functions and predicates, where exact matches are often rare or unnecessary. Developing efficient reasoning and computational techniques for such a combined formalism presents a significant challenge. In this paper, we adopt a more straightforward approach aiming at integrating two well-established and computationally well-behaving components: higher-order patterns on one side and fuzzy equivalences expressed through similarity relations based on minimum T-norm on the other. We propose a unification algorithm for higher-order patterns modulo these similarity relations and prove its termination, soundness, and completeness. This unification problem, like its crisp counterpart, is unitary. The algorithm computes the most general unifier with the highest degree of approximation when the given terms are unifiable.},
number = {25-03},
year = {2025},
month = {February},
keywords = {Unification, higher-order patterns, fuzzy similarity relations},
length = {20},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
[Dundua]
Higher-Order Pattern Unification Modulo Similarity Relations
Besik Dundua, Temur Kutsia
In: Proceedings of the 35th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2025, Santiago Escobar and Laura Titolo (ed.), Lecture Notes in Computer Science 16117, pp. 75-93. 2025. Springer, ISBN 978-3-032-04847-9. [doi] [pdf]@inproceedings{RISC7162,
author = {Besik Dundua and Temur Kutsia},
title = {{Higher-Order Pattern Unification Modulo Similarity Relations}},
booktitle = {{Proceedings of the 35th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2025}},
language = {english},
series = {Lecture Notes in Computer Science},
volume = {16117},
pages = {75--93},
publisher = {Springer},
isbn_issn = {ISBN 978-3-032-04847-9},
year = {2025},
editor = {Santiago Escobar and Laura Titolo},
refereed = {yes},
length = {19},
url = {https://doi.org/10.1007/978-3-032-04848-6_5}
}
author = {Besik Dundua and Temur Kutsia},
title = {{Higher-Order Pattern Unification Modulo Similarity Relations}},
booktitle = {{Proceedings of the 35th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2025}},
language = {english},
series = {Lecture Notes in Computer Science},
volume = {16117},
pages = {75--93},
publisher = {Springer},
isbn_issn = {ISBN 978-3-032-04847-9},
year = {2025},
editor = {Santiago Escobar and Laura Titolo},
refereed = {yes},
length = {19},
url = {https://doi.org/10.1007/978-3-032-04848-6_5}
}
[Ehling]
Graded Quantitative Narrowing
Mauricio Ayala-Rincon, Thaynara Arielly de Lima, Georg Ehling, Temur Kutsia
In: Intelligent Computer Mathematics - 18th International Conference, CICM 2025, Brasilia, Brazil, October 6-10, 2025, Proceedings, Valeria de Paiva and Peter Koepke (ed.), Lecture Notes in Computer Science 16136, pp. 113-132. 2025. Springer, ISBN 978-3-032-07020-3. [doi]@inproceedings{RISC7189,
author = {Mauricio Ayala-Rincon and Thaynara Arielly de Lima and Georg Ehling and Temur Kutsia},
title = {{Graded Quantitative Narrowing}},
booktitle = {{Intelligent Computer Mathematics - 18th International Conference, CICM 2025, Brasilia, Brazil, October 6-10, 2025, Proceedings}},
language = {english},
series = {Lecture Notes in Computer Science},
volume = {16136},
pages = {113--132},
publisher = {Springer},
isbn_issn = {ISBN 978-3-032-07020-3},
year = {2025},
editor = {Valeria de Paiva and Peter Koepke},
refereed = {yes},
length = {20},
url = {https://doi.org/10.1007/978-3-032-07021-0_7}
}
author = {Mauricio Ayala-Rincon and Thaynara Arielly de Lima and Georg Ehling and Temur Kutsia},
title = {{Graded Quantitative Narrowing}},
booktitle = {{Intelligent Computer Mathematics - 18th International Conference, CICM 2025, Brasilia, Brazil, October 6-10, 2025, Proceedings}},
language = {english},
series = {Lecture Notes in Computer Science},
volume = {16136},
pages = {113--132},
publisher = {Springer},
isbn_issn = {ISBN 978-3-032-07020-3},
year = {2025},
editor = {Valeria de Paiva and Peter Koepke},
refereed = {yes},
length = {20},
url = {https://doi.org/10.1007/978-3-032-07021-0_7}
}
[Fadeev]
Computer algebra for special functions
Nikolai Fadeev
RISC, Johannes Kepler University Linz. PhD Thesis. May 2025.@phdthesis{RISC7201,
author = {Nikolai Fadeev},
title = {{Computer algebra for special functions}},
language = {english},
abstract = {Calculations done in different mathematical areas — such as computer algebra,combinatorics, number theory, differential equations — and physical areas — suchas particle physics — give rise to a plethora of problems involving special functionsthat need to be dealt with efficiently. In this PhD, we concentrated on two suchparticular problems.In the first part of this PhD thesis, we explored the relation between iteratedbinomial sums, an extension of general harmonic sums, and their integral representations, in order to compute their asymptotic expansions. To do that in a fullyautomatic way, we created a dedicated package, RICA. Using Mellin representations,we first formalised and extended a classical recursive method to compute Mellininverses of such sums, and together with it implemented several methods to compute asymptotic expansions of such integrals. In the process, we introduced andexplored a new class of functions related to Mellin convolutions. Those allowed usto automatically compute asymptotic expansions for more general classes of sumsin a new and efficient way, while providing a way to get symbolic representationsfor the constants appearing in the calculation of the Mellin inversions.In the second part of this PhD thesis, we studied first order inhomogeneous systems of differential equations involving an extra parameter epsilon coming from particlephysics computations. Since usually those systems could only be solved up to someorder in epsilon, we aimed at developing a method to optimise the solving task of suchsystems. We studied an approach centered on the minimisation of the epsilon-order in theexpansion of the inhomogeneous part. In particular, we proposed a method basedon separating the system in smaller subsystems called triangularization, beforeanalysing each of those individually using dffierent uncoupling schemes, selectedpriorization of equations and through comparisons of epsilon-orders. This method hasbeen implemented in a package called SystemAnalysis.},
year = {2025},
month = {May},
translation = {0},
school = {RISC, Johannes Kepler University Linz},
length = {292}
}
author = {Nikolai Fadeev},
title = {{Computer algebra for special functions}},
language = {english},
abstract = {Calculations done in different mathematical areas — such as computer algebra,combinatorics, number theory, differential equations — and physical areas — suchas particle physics — give rise to a plethora of problems involving special functionsthat need to be dealt with efficiently. In this PhD, we concentrated on two suchparticular problems.In the first part of this PhD thesis, we explored the relation between iteratedbinomial sums, an extension of general harmonic sums, and their integral representations, in order to compute their asymptotic expansions. To do that in a fullyautomatic way, we created a dedicated package, RICA. Using Mellin representations,we first formalised and extended a classical recursive method to compute Mellininverses of such sums, and together with it implemented several methods to compute asymptotic expansions of such integrals. In the process, we introduced andexplored a new class of functions related to Mellin convolutions. Those allowed usto automatically compute asymptotic expansions for more general classes of sumsin a new and efficient way, while providing a way to get symbolic representationsfor the constants appearing in the calculation of the Mellin inversions.In the second part of this PhD thesis, we studied first order inhomogeneous systems of differential equations involving an extra parameter epsilon coming from particlephysics computations. Since usually those systems could only be solved up to someorder in epsilon, we aimed at developing a method to optimise the solving task of suchsystems. We studied an approach centered on the minimisation of the epsilon-order in theexpansion of the inhomogeneous part. In particular, we proposed a method basedon separating the system in smaller subsystems called triangularization, beforeanalysing each of those individually using dffierent uncoupling schemes, selectedpriorization of equations and through comparisons of epsilon-orders. This method hasbeen implemented in a package called SystemAnalysis.},
year = {2025},
month = {May},
translation = {0},
school = {RISC, Johannes Kepler University Linz},
length = {292}
}
[Gao]
Complete Reduction for Derivatives in a Primitive Tower
Hao Du, Yiman Gao, Wenqiao Li and Ziming Li
In: Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation (ISSAC’25, Santiago Laplagne (ed.), pp. 42-51. 2025. 979-8-4007-2075-8/25/07.@inproceedings{RISC7191,
author = {Hao Du and Yiman Gao and Wenqiao Li and Ziming Li},
title = {{Complete Reduction for Derivatives in a Primitive Tower}},
booktitle = {{ Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation (ISSAC’25}},
language = {english},
pages = {42--51},
isbn_issn = {979-8-4007-2075-8/25/07},
year = {2025},
editor = {Santiago Laplagne},
refereed = {yes},
length = {10}
}
author = {Hao Du and Yiman Gao and Wenqiao Li and Ziming Li},
title = {{Complete Reduction for Derivatives in a Primitive Tower}},
booktitle = {{ Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation (ISSAC’25}},
language = {english},
pages = {42--51},
isbn_issn = {979-8-4007-2075-8/25/07},
year = {2025},
editor = {Santiago Laplagne},
refereed = {yes},
length = {10}
}
[Hemmecke]
Computer-assisted construction of Ramanujan-Sato series for 1 over pi
Ralf Hemmecke, Peter Paule, Cristian-Silviu Radu
Technical report no. 25-01 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). January 2025. Licensed under CC BY 4.0 International. [doi] [pdf] [pdf]@techreport{RISC7134,
author = {Ralf Hemmecke and Peter Paule and Cristian-Silviu Radu},
title = {{Computer-assisted construction of Ramanujan-Sato series for 1 over pi}},
language = {english},
abstract = {Referring to ideasof Takeshi Sato, Yifan Yang in~cite{YangDE} described a construction ofseries for $1$ over $pi$ startingwith a pair $(g,h)$, where $g$ is a modular formof weight $2$ and $h$ is a modular function; i.e.,a modular form of weight zero. In this article we present an algorithmicversion,called ``Sato construction''. Series for $1/pi$ obtained this way will becalled ``Ramanujan-Sato''series. Famous series fit into this definition, for instance, Ramanujan'sseries used by Gosperand the series used by the Chudnovsky brothersfor computing millions of digits of $pi$. Weshow that these series are induced by membersof infinite families of Sato triples $(N, gamma_N,tau_N)$ where $N>1$ is an integer and $gamma_N$ a $2times 2$ matrixsatisfying $gamma_N tau_N=N tau_N$ for$tau_N$ being an element from the upper half of thecomplex plane.In addition to procedures for guessingand proving from the holonomic toolbox togetherwiththe algorithm ``ModFormDE'', as describedin~cite{PPSR:ModFormDE1}, a central roleis played by the algorithm ``MultiSamba'',an extension ofSamba (``subalgebra module basis algorithm'') originating fromcite{Radu_RamanujanKolberg_2015} and cite{Hemmecke}.With thehelp of MultiSamba one canfind and prove evaluations of modular functions,at imaginary quadratic points, in terms of nested algebraic expressions.As a consequence,all the series for $1/pi$ constructed withthe help of MultiSamba are proven completelyin a rigorous non-numerical manner.},
number = {25-01},
year = {2025},
month = {January},
keywords = {modular forms and functions, holonomic differential equations, Ramanujan-Sato series for 1 over pi, MultiSamba algorithm},
length = {58},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
author = {Ralf Hemmecke and Peter Paule and Cristian-Silviu Radu},
title = {{Computer-assisted construction of Ramanujan-Sato series for 1 over pi}},
language = {english},
abstract = {Referring to ideasof Takeshi Sato, Yifan Yang in~cite{YangDE} described a construction ofseries for $1$ over $pi$ startingwith a pair $(g,h)$, where $g$ is a modular formof weight $2$ and $h$ is a modular function; i.e.,a modular form of weight zero. In this article we present an algorithmicversion,called ``Sato construction''. Series for $1/pi$ obtained this way will becalled ``Ramanujan-Sato''series. Famous series fit into this definition, for instance, Ramanujan'sseries used by Gosperand the series used by the Chudnovsky brothersfor computing millions of digits of $pi$. Weshow that these series are induced by membersof infinite families of Sato triples $(N, gamma_N,tau_N)$ where $N>1$ is an integer and $gamma_N$ a $2times 2$ matrixsatisfying $gamma_N tau_N=N tau_N$ for$tau_N$ being an element from the upper half of thecomplex plane.In addition to procedures for guessingand proving from the holonomic toolbox togetherwiththe algorithm ``ModFormDE'', as describedin~cite{PPSR:ModFormDE1}, a central roleis played by the algorithm ``MultiSamba'',an extension ofSamba (``subalgebra module basis algorithm'') originating fromcite{Radu_RamanujanKolberg_2015} and cite{Hemmecke}.With thehelp of MultiSamba one canfind and prove evaluations of modular functions,at imaginary quadratic points, in terms of nested algebraic expressions.As a consequence,all the series for $1/pi$ constructed withthe help of MultiSamba are proven completelyin a rigorous non-numerical manner.},
number = {25-01},
year = {2025},
month = {January},
keywords = {modular forms and functions, holonomic differential equations, Ramanujan-Sato series for 1 over pi, MultiSamba algorithm},
length = {58},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
[Hemmecke]
An Algorithm to Compute Algebraic Relations Between Modular Functions
Ralf Hemmecke, Peter Paule, Cristian-Silviu Radu
Technical report no. 25-09 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). November 2025. Licensed under CC BY 4.0 International. [doi] [pdf]@techreport{RISC7197,
author = {Ralf Hemmecke and Peter Paule and Cristian-Silviu Radu},
title = {{An Algorithm to Compute Algebraic Relations Between Modular Functions}},
language = {english},
abstract = {The existence of an algebraic relation between two modular functions,in short: a modular equation, is implied by a classical fact from thetheory of compact Riemann surfaces. In this article, we present a new,purely algebraic proof of the existence of modular equations. Oursetting consists of an algorithmic framework which is based on areduction procedure for tuples of formal Laurent series. The resultingalgorithm MultiSamba (“sub-algebra module basis algorithm”) is part ofHemmecke's computer algebra package QEta which has been implemented inFriCAS, a general purpose computer algebra system which is freelyavailable as open source. QEta is a powerful tool-box for actualcomputations. For example, MultiSamba has been used forcomputer-assisted discovery and proofs of Ramanujan-Sato series. Inthis article, we describe the mathematics underlying the MultiSambaalgorithm. Moreover, we explain in detail how MultiSamba works for thederivationof a well-known modular equation betweenthe modular $\lambda$-function and the Klein $j$function.Other examples of the automatic discovery and proving of modularequations include identities by Alladi and others, which suggestrelations of Ramanujan-G\"ollnitz-Gordon type as another promisingarea of MultiSamba application.},
number = {25-09},
year = {2025},
month = {November},
keywords = {modular functions, multisamba, modular equations},
length = {23},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
author = {Ralf Hemmecke and Peter Paule and Cristian-Silviu Radu},
title = {{An Algorithm to Compute Algebraic Relations Between Modular Functions}},
language = {english},
abstract = {The existence of an algebraic relation between two modular functions,in short: a modular equation, is implied by a classical fact from thetheory of compact Riemann surfaces. In this article, we present a new,purely algebraic proof of the existence of modular equations. Oursetting consists of an algorithmic framework which is based on areduction procedure for tuples of formal Laurent series. The resultingalgorithm MultiSamba (“sub-algebra module basis algorithm”) is part ofHemmecke's computer algebra package QEta which has been implemented inFriCAS, a general purpose computer algebra system which is freelyavailable as open source. QEta is a powerful tool-box for actualcomputations. For example, MultiSamba has been used forcomputer-assisted discovery and proofs of Ramanujan-Sato series. Inthis article, we describe the mathematics underlying the MultiSambaalgorithm. Moreover, we explain in detail how MultiSamba works for thederivationof a well-known modular equation betweenthe modular $\lambda$-function and the Klein $j$function.Other examples of the automatic discovery and proving of modularequations include identities by Alladi and others, which suggestrelations of Ramanujan-G\"ollnitz-Gordon type as another promisingarea of MultiSamba application.},
number = {25-09},
year = {2025},
month = {November},
keywords = {modular functions, multisamba, modular equations},
length = {23},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
[Hoxhaj]
How to reconstruct a planar map from its branching curve
E. Hoxhaj, J. Schicho
Math. Comp. 94, pp. 935-952. 2025. ISSN 1088-6842. [doi]@article{RISC7121,
author = {E. Hoxhaj and J. Schicho},
title = {{How to reconstruct a planar map from its branching curve}},
language = {english},
journal = {Math. Comp.},
volume = {94},
pages = {935--952},
isbn_issn = {ISSN 1088-6842},
year = {2025},
refereed = {yes},
length = {18},
url = {https://doi.org/10.1090/mcom/3988}
}
author = {E. Hoxhaj and J. Schicho},
title = {{How to reconstruct a planar map from its branching curve}},
language = {english},
journal = {Math. Comp.},
volume = {94},
pages = {935--952},
isbn_issn = {ISSN 1088-6842},
year = {2025},
refereed = {yes},
length = {18},
url = {https://doi.org/10.1090/mcom/3988}
}
[Kovacs]
Towards automatic detection of geometric difficulty of geometry problems
Andr'as Kerekes, Zolt'an Kov'acs
Maple Transactions, pp. to appear-. 2025. ISSN 2564-3029. to appear.@article{RISC7213,
author = {Andr'as Kerekes and Zolt'an Kov'acs},
title = {{Towards automatic detection of geometric difficulty of geometry problems}},
language = {english},
journal = {Maple Transactions},
pages = {to appear--},
isbn_issn = { ISSN 2564-3029},
year = {2025},
note = {to appear},
refereed = {yes},
length = {0}
}
author = {Andr'as Kerekes and Zolt'an Kov'acs},
title = {{Towards automatic detection of geometric difficulty of geometry problems}},
language = {english},
journal = {Maple Transactions},
pages = {to appear--},
isbn_issn = { ISSN 2564-3029},
year = {2025},
note = {to appear},
refereed = {yes},
length = {0}
}
[Kovacs]
Topology of Quartic Loci in 2D and 3D Inspired by A College Entrance Exam
Yang Wei-Chi, Kov'acs Zolt'an, Dana-Picard Thierry
The Electronic Journal of Mathematics and Technology 19(1), pp. 1-14. 2025. ISSN 1933-2823. [url]@article{RISC7214,
author = {Yang Wei-Chi and Kov'acs Zolt'an and Dana-Picard Thierry},
title = {{Topology of Quartic Loci in 2D and 3D Inspired by A College Entrance Exam}},
language = {english},
journal = {The Electronic Journal of Mathematics and Technology},
volume = {19},
number = {1},
pages = {1--14},
isbn_issn = {ISSN 1933-2823},
year = {2025},
refereed = {yes},
length = {14},
url = {https://ejmt.mathandtech.org/Contents/eJMT_v19n1p1.pdf}
}
author = {Yang Wei-Chi and Kov'acs Zolt'an and Dana-Picard Thierry},
title = {{Topology of Quartic Loci in 2D and 3D Inspired by A College Entrance Exam}},
language = {english},
journal = {The Electronic Journal of Mathematics and Technology},
volume = {19},
number = {1},
pages = {1--14},
isbn_issn = {ISSN 1933-2823},
year = {2025},
refereed = {yes},
length = {14},
url = {https://ejmt.mathandtech.org/Contents/eJMT_v19n1p1.pdf}
}
[Kutsia]
Verification of an Anti-unification Algorithm in PVS
Mauricio Ayala-Rincón, Thaynara Arielly de Lima, Maria Júlia Dias Lima, Mariano Miguel Moscato, and Temur Kutsia
In: NASA Formal Methods, Aaron Dutle, Laura Humphrey, Laura Titolo (ed.), Proceedings of The 17th NASA Formal Methods Symposium, NFM 2025, Williamsburg, VA, USA, Lecture Notes in Computer Science 15682, pp. 54-71. 2025. Springer, ISBN 978-3-031-93705-7. [doi]@inproceedings{RISC7152,
author = {Mauricio Ayala-Rincón and Thaynara Arielly de Lima and Maria Júlia Dias Lima and Mariano Miguel Moscato and and Temur Kutsia},
title = {{Verification of an Anti-unification Algorithm in PVS}},
booktitle = {{NASA Formal Methods}},
language = {english},
series = {Lecture Notes in Computer Science},
volume = {15682},
pages = {54--71},
publisher = {Springer},
isbn_issn = {ISBN 978-3-031-93705-7},
year = {2025},
editor = {Aaron Dutle and Laura Humphrey and Laura Titolo},
refereed = {yes},
length = {18},
conferencename = {The 17th NASA Formal Methods Symposium, NFM 2025, Williamsburg, VA, USA},
url = {https://doi.org/10.1007/978-3-031-93706-4_4}
}
author = {Mauricio Ayala-Rincón and Thaynara Arielly de Lima and Maria Júlia Dias Lima and Mariano Miguel Moscato and and Temur Kutsia},
title = {{Verification of an Anti-unification Algorithm in PVS}},
booktitle = {{NASA Formal Methods}},
language = {english},
series = {Lecture Notes in Computer Science},
volume = {15682},
pages = {54--71},
publisher = {Springer},
isbn_issn = {ISBN 978-3-031-93705-7},
year = {2025},
editor = {Aaron Dutle and Laura Humphrey and Laura Titolo},
refereed = {yes},
length = {18},
conferencename = {The 17th NASA Formal Methods Symposium, NFM 2025, Williamsburg, VA, USA},
url = {https://doi.org/10.1007/978-3-031-93706-4_4}
}
[Schneider]
Creative Telescoping for Hypergeometric Double Sums
P. Paule, C. Schneider
J. Symb. Comput. 128(102394), pp. 1-30. 2025. ISSN: 0747-7171. Symbolic Computation and Combinatorics: A special issue in memory and honor of Marko Petkovšek, edited by Shaoshi Chen, Sergei Abramov, Manuel Kauers, Eugene Zima. [doi]@article{RISC7068,
author = {P. Paule and C. Schneider},
title = {{Creative Telescoping for Hypergeometric Double Sums}},
language = {english},
abstract = {We present efficient methods for calculating linear recurrences of hypergeometric double sums and, more generally, of multiple sums. In particular, we supplement this approach with the algorithmic theory of contiguous relations, which guarantees the applicability of our method for many input sums. In addition, we elaborate new techniques to optimize the underlying key task of our method to compute rational solutions of parameterized linear recurrences.},
journal = {J. Symb. Comput.},
volume = {128},
number = {102394},
pages = {1--30},
isbn_issn = {ISSN: 0747-7171},
year = {2025},
note = {Symbolic Computation and Combinatorics: A special issue in memory and honor of Marko Petkovšek, edited by Shaoshi Chen, Sergei Abramov, Manuel Kauers, Eugene Zima},
refereed = {yes},
keywords = {creative telescoping; symbolic summation, hypergeometric multi-sums, contiguous relations, parameterized recurrences, rational solutions},
length = {30},
url = {https://doi.org/10.1016/j.jsc.2024.102394}
}
author = {P. Paule and C. Schneider},
title = {{Creative Telescoping for Hypergeometric Double Sums}},
language = {english},
abstract = {We present efficient methods for calculating linear recurrences of hypergeometric double sums and, more generally, of multiple sums. In particular, we supplement this approach with the algorithmic theory of contiguous relations, which guarantees the applicability of our method for many input sums. In addition, we elaborate new techniques to optimize the underlying key task of our method to compute rational solutions of parameterized linear recurrences.},
journal = {J. Symb. Comput.},
volume = {128},
number = {102394},
pages = {1--30},
isbn_issn = {ISSN: 0747-7171},
year = {2025},
note = {Symbolic Computation and Combinatorics: A special issue in memory and honor of Marko Petkovšek, edited by Shaoshi Chen, Sergei Abramov, Manuel Kauers, Eugene Zima},
refereed = {yes},
keywords = {creative telescoping; symbolic summation, hypergeometric multi-sums, contiguous relations, parameterized recurrences, rational solutions},
length = {30},
url = {https://doi.org/10.1016/j.jsc.2024.102394}
}
[Schneider]
Asymptotics for the reciprocal and shifted quotient of the partition function
Koustav Banerjee, Peter Paule, Cristian-Silviu Radu, Carsten Schneider
Research in Number Theory 11(101), pp. 1-46. 2025. ISSN 2363-9555. arXiv:2412.02257 [math.NT]. [doi]@article{RISC7184,
author = {Koustav Banerjee and Peter Paule and Cristian-Silviu Radu and Carsten Schneider},
title = {{Asymptotics for the reciprocal and shifted quotient of the partition function}},
language = {english},
abstract = {Let $p(n)$ denote the partition function. In this paper our main goal is to derive an asymptotic expansion up to order $N$ (for any fixed positive integer $N$) along with estimates for error bounds for the shifted quotient of the partition function, namely $p(n+k)/p(n)$ with $kin mathbb{N}$, which generalizes a result of Gomez, Males, and Rolen. In order to do so, we derive asymptotic expansions with error bounds for the shifted version $p(n+k)$ and the multiplicative inverse $1/p(n)$, which is of independent interest.},
journal = {Research in Number Theory},
volume = {11},
number = {101},
pages = {1--46},
isbn_issn = {ISSN 2363-9555},
year = {2025},
note = { arXiv:2412.02257 [math.NT]},
refereed = {yes},
length = {46},
url = {https://doi.org/10.1007/s40993-025-00678-y}
}
author = {Koustav Banerjee and Peter Paule and Cristian-Silviu Radu and Carsten Schneider},
title = {{Asymptotics for the reciprocal and shifted quotient of the partition function}},
language = {english},
abstract = {Let $p(n)$ denote the partition function. In this paper our main goal is to derive an asymptotic expansion up to order $N$ (for any fixed positive integer $N$) along with estimates for error bounds for the shifted quotient of the partition function, namely $p(n+k)/p(n)$ with $kin mathbb{N}$, which generalizes a result of Gomez, Males, and Rolen. In order to do so, we derive asymptotic expansions with error bounds for the shifted version $p(n+k)$ and the multiplicative inverse $1/p(n)$, which is of independent interest.},
journal = {Research in Number Theory},
volume = {11},
number = {101},
pages = {1--46},
isbn_issn = {ISSN 2363-9555},
year = {2025},
note = { arXiv:2412.02257 [math.NT]},
refereed = {yes},
length = {46},
url = {https://doi.org/10.1007/s40993-025-00678-y}
}
